HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /The golden ratio is φ = (1 + √5)/2, and its partner is ψ = (1 - √5)/2…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalproofOlympiad

The golden ratio is φ = (1 + √5)/2, and its partner is ψ = (1 - √5)/2…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

The golden ratio is φ=1+52\varphi = \dfrac{1 + \sqrt{5}}{2}φ=21+5​​, and its partner is ψ=1−52\psi = \dfrac{1 - \sqrt{5}}{2}ψ=21−5​​. A calculator shows that φ12\varphi^{12}φ12 is very close to a whole number, and a student wants to know why.

Let Ln=φn+ψnL_n = \varphi^n + \psi^nLn​=φn+ψn. Show that LnL_nLn​ follows the Fibonacci recurrence with L0=2L_0 = 2L0​=2 and L1=1L_1 = 1L1​=1, so every LnL_nLn​ is a whole number. Find L12L_{12}L12​. Then use 0<ψ12<10 < \psi^{12} < 10<ψ12<1 to find the whole number part of φ12\varphi^{12}φ12.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

For an=pan−1+qan−2a_n = pa_{n-1} + qa_{n-2}an​=pan−1​+qan−2​ solve x2=px+qx^2 = px + qx2=px+q. Two different roots give an=Arn+Bsna_n = Ar^n + Bs^nan​=Arn+Bsn; a double root gives an=(A+Bn)rna_n = (A + Bn)r^nan​=(A+Bn)rn. For an=can−1+da_n = ca_{n-1} + dan​=can−1​+d use the fixed point L=cL+dL = cL + dL=cL+d.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. The recurrence. φ\varphiφ and ψ\psiψ solve x2=x+1x^2 = x + 1x2=x+1. Multiply by xn−2x^{n-2}xn−2: φn=φn−1+φn−2\varphi^n = \varphi^{n-1} + \varphi^{n-2}φn=φn−1+φn−2, and the same for ψ\psiψ. Adding, Ln=Ln−1+Ln−2L_n = L_{n-1} + L_{n-2}Ln​=Ln−1​+Ln−2​.

Step 2. Starting values. L0=1+1=2L_0 = 1 + 1 = 2L0​=1+1=2 and L1=φ+ψ=1L_1 = \varphi + \psi = 1L1​=φ+ψ=1. So every LnL_nLn​ is a whole number.

Step 3. Work forward. 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322. So L12=322L_{12} = 322L12​=322.

Step 4. The size of ψ12\psi^{12}ψ12. ∣ψ∣≈0.618|\psi| \approx 0.618∣ψ∣≈0.618, and an even power is positive, so 0<ψ12<10 < \psi^{12} < 10<ψ12<1. In fact ψ12≈0.0031\psi^{12} \approx 0.0031ψ12≈0.0031.

Step 5. The whole number part. φ12=322−ψ12\varphi^{12} = 322 - \psi^{12}φ12=322−ψ12, which lies between 321321321 and 322322322. So its whole number part is 321321321, and φ12≈321.997\varphi^{12} \approx 321.997φ12≈321.997.

Answer: L12=322L_{12} = 322L12​=322, and the whole number part of φ12\varphi^{12}φ12 is 321321321. Proof complete.

Log in to save this for later
← All Problems
← A culture of cells triples every hour. At the end of each hour a technician removes 4 thousand…Six friends each bring a wrapped gift with their name on it… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Solving linear recurrencesRecurrences and Counting by Recursion

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  3. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  4. The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…
Advanced
  • A river town has five land areas, A, B, C, D and E, joined by ten bridges…Hard
  • All problems on this topic →