Is the Number 2 Truly Persistent?

  • MHB
  • Thread starter anemone
  • Start date
In summary, "Prove 2 is Persistent" is a mathematical problem that asks whether or not the number 2, when used as the base of an exponential function, will always eventually reach a cycle of repeating digits. POTW #349 Jan 15th, 2019 is a specific problem of the week that was posted on January 15th, 2019, and it is "Prove 2 is Persistent". To prove that 2 is Persistent, one would need to show that no matter how many times you square the number 2, you will eventually reach a cycle of repeating digits. This is important because it helps us understand the behavior of exponential functions and numbers, and it has practical applications in various fields.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Here is this week's POTW:

-----

This week POTW is a follow-up question from https://mathhelpboards.com/potw-secondary-school-high-school-students-35/problem-week-348-jan-8th-2019-a-25563.htmlProve that 2 is persistent.

-----

Remember to read the https://mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to https://mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
  • #2
No one answered last week's problem. (Sadface)

But, you can check the suggested solution as follows:

Suppose $a+b+c+d=2$ and $\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}+\dfrac{1}{d}=2$.

Consider the monic polynomial $f(x)$ with roots $a,\,b,\,c,\,d$. Let $f(x)$ have expansion

$f(x)=x^4-e_1x^3+e_2x^2-e_3x+e_4$

By Vieta's formulas, we have

$e_1=a+b+c+d=2$

$\dfrac{e_3}{e_4}=\dfrac{bcd+cda+dab+abc}{abcd}=\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}+\dfrac{1}{d}=2$

Thus, $f(x)$ has the form $x^4-2x^3+rx^2-2sx+s$.

Next, we consider the polynomial $g(x)=f(1-x)$, which is the monic polynomial with roots $1-a,\,1-b,\,1-c,\,1-d$. We have

$\begin{align*}g(x)&=(1-x)^4-2(1-x)^3+r(1-x)^2-2s(1-x)+2\\&=x^4-2x^3+rx^2+(2-2r+2s)x-(1-r+s)\end{align*}$

By Vieta's formulas again, we have

$\begin{align*}\dfrac{1}{1-a}+\dfrac{1}{1-b}+\dfrac{1}{1-c}+\dfrac{1}{1-d}&=\dfrac{-2(2-2r+2s)}{-(1-r+s)}\\&=2\end{align*}$

Therefore, 2 is persistent.
 

FAQ: Is the Number 2 Truly Persistent?

What is "Prove 2 is Persistent: POTW #349 Jan 15th, 2019"?

"Prove 2 is Persistent: POTW #349 Jan 15th, 2019" is a mathematical problem posed as the Problem of the Week (#349) on January 15th, 2019. It challenges individuals to prove that the number 2 is persistent, meaning that when repeatedly multiplied, the resulting number eventually becomes a single digit.

Who can participate in "Prove 2 is Persistent: POTW #349 Jan 15th, 2019"?

Anyone with a basic understanding of mathematics and problem-solving skills can participate in "Prove 2 is Persistent: POTW #349 Jan 15th, 2019". It is open to individuals of all ages and backgrounds.

What is the significance of proving 2 is persistent?

Proving 2 is persistent has practical applications in computer science and number theory. It also serves as a fun and challenging problem for individuals to solve and improve their mathematical reasoning skills.

Can the problem be solved using different methods?

Yes, there are multiple ways to approach and solve "Prove 2 is Persistent: POTW #349 Jan 15th, 2019". Some possible methods include using algebraic manipulation, modular arithmetic, and mathematical induction.

Are there any rewards for solving the problem?

While there may not be any tangible rewards, successfully solving "Prove 2 is Persistent: POTW #349 Jan 15th, 2019" can bring a sense of accomplishment and satisfaction. It also allows individuals to sharpen their problem-solving skills and expand their knowledge of mathematics.

Back
Top