(2+sqrt(3))^50 close to being an integer

  • Context: MHB 
  • Thread starter Thread starter Ciaran
  • Start date Start date
  • Tags Tags
    Integer
Click For Summary
SUMMARY

The discussion centers on the integer approximation of the expression (2 + √3)^50 through the construction of a recursive sequence defined by a characteristic equation. The roots of the polynomial x^2 - 4x + 1 = 0 lead to the recursion relation a_{n+1} = 4a_n - a_{n-1}, with initial conditions a_0 = 2 and a_1 = 4. This sequence demonstrates that (2 + √3)^n is close to an integer, as the term (2 - √3)^n approaches zero for increasing n, confirming the integer nature of a_n.

PREREQUISITES
  • Understanding of recursive sequences and their properties
  • Familiarity with characteristic equations in linear recurrences
  • Knowledge of polynomial roots and their significance
  • Basic concepts of limits and convergence in sequences
NEXT STEPS
  • Study the derivation of linear recurrence relations from characteristic equations
  • Explore the properties of the Fibonacci sequence and its relation to other recursive sequences
  • Learn about the convergence of sequences and how they relate to integer approximations
  • Investigate the implications of irrational numbers in recursive sequences
USEFUL FOR

Mathematicians, educators, and students interested in number theory, recursive sequences, and the approximation of irrational numbers by integers.

Ciaran
Messages
71
Reaction score
0
Q:Explain this phenomenon by finding a sequence of integers a_i, defined by a recursion relation similar to the Fibonacci sequence, such that a_n = (2 + √
3)^n + (2 −√3)^n.
Make sure to explain why constructing such a sequence proves (2 + √3)^50 is close to an integer, though you needn’t analyze precisely how close it is.

I managed to come up with a proof of why the number is so close to an integer but I have not been able to explain it in the way the question is asking me. Can somebody please help?
 
Physics news on Phys.org
To find the recursion having the given closed form, we should look for the minimal polynomial having the roots:

$$2\pm\sqrt{3}$$

So, we could write:

$$x=2\pm\sqrt{3}$$

$$x-2=\pm\sqrt{3}$$

$$(x-2)^2=3$$

$$x^2-4x+4=3$$

$$x^2-4x+1=0$$

So, using this as your characteristic equation, and the initial values of the given closed form, can you construct the recursion?
 
Thanks for your reply! This was actually as far as I got, because I was told to look at the Golden Ratios and how they are the solutions to x^2= x+1, and apply this to 2 +- sqrt3
 
Okay, using the characteristic equation we found, along with the fact that:

$$a_0=2,\,a_1=4$$

we may state:

$$a_{n+1}=4a_{n}-a_{n-1}$$

Does this make sense?
 
Yes, this makes sense! It's analogous to the one for the Fibonacci sequence
 
Yes, the method for finding the closed form of a linear recurrence is to raise each of the roots of the corresponding characteristic equation by a power of $n$ and multiply each by a parameter which you can determine from the given initial conditions.

So, knowing that $a_n$ is an integer for all $n$ (which we can see from the recurrence), then we know that $$\left(2+\sqrt{3}\right)^n$$ will differ from an integer by the value of $$\left(2-\sqrt{3}\right)^n$$. Since $2-\sqrt{3}<1$, we know that as $n$ increases, this value will approach zero.
 
Thank you very much indeed! It was the forming of the recurrence relation that got me; you made it very clear indeed.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 3 ·
Replies
3
Views
899
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
8
Views
3K