(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

Discussion Overview

The discussion revolves around the phenomenon of the expression \((2+\sqrt{3})^{50}\) being close to an integer. Participants explore the construction of a sequence of integers defined by a recursion relation, similar to the Fibonacci sequence, to explain this closeness without determining the exact proximity.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning

Main Points Raised

  • One participant asks for help in explaining why \((2+\sqrt{3})^{50}\) is close to an integer by finding a sequence defined by a recursion relation.
  • Another participant suggests finding the minimal polynomial with roots \(2 \pm \sqrt{3}\) to derive the characteristic equation.
  • A participant mentions the connection to the Golden Ratios and their relation to the equation \(x^2 = x + 1\), indicating a potential analogy.
  • Using the characteristic equation, a participant proposes the recursion \(a_{n+1} = 4a_n - a_{n-1}\) based on initial values \(a_0 = 2\) and \(a_1 = 4\).
  • Another participant confirms the recursion makes sense and draws a parallel to the Fibonacci sequence.
  • A later reply explains that since \(a_n\) is an integer for all \(n\), \((2+\sqrt{3})^n\) will differ from an integer by \((2-\sqrt{3})^n\), which approaches zero as \(n\) increases.

Areas of Agreement / Disagreement

Participants generally agree on the formulation of the recursion and its implications, but there is no consensus on the precise explanation of how close \((2+\sqrt{3})^{50}\) is to an integer.

Contextual Notes

The discussion does not resolve the specifics of the closeness of \((2+\sqrt{3})^{50}\) to an integer, nor does it clarify the implications of the recursion in that context.

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
1K
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