What’s \(\sum_{i=0}^nF_i^2=F_0^2+F_1^2+F_2^2+...+F_{n-1}^2+F_n^2\) in terms of just \(F_n\) and \(F_{n+1}\)?
What are the ratios \(\frac{F_2}{F_1}\), \(\frac{F_3}{F_2}\), and so on until \(\frac{F_7}{F_6}\)? What do you notice about them?
In the example, we saw that \(\varphi^2=\varphi+1\). Can you write \(\varphi^3\) in the form \(a\varphi+b\), where \(a\) and \(b\) are positive integers?
Let \(m\) and \(n\) be positive integers. What positive integers can be written as \(m+n+\gcd(m,n)+\text{lcm}(m,n)\), for some \(m\) and \(n\)?
Let \(n\ge r\) be positive integers. What is \(F_n^2-F_{n-r}F_{n+r}\) in terms of \(F_r\)?
On the questioners’ planet (where everyone can only ask questions. Cricks can only ask questions to which the answer is yes, and Goops can only ask questions to which the answer is no), you meet 4 alien mathematicians.
They’re called Alexander Grothendieck, Bernhard Riemann, Claire Voisin and Daniel Kan (you may like to shorten their names to \(A\), \(B\), \(C\) and \(D\)).
Alexander asks the following question “Am I the kind who could ask whether Bernhard could ask whether Claire could ask whether Daniel is a Goop?"
Amongst the final three (that is, Bernhard, Claire and Daniel), are there an even or an odd number of Goops?
Four different digits are given. We use each of them exactly once to construct the largest possible four-digit number. We also use each of them exactly once to construct the smallest possible four-digit number which does not start with \(0\). If the sum of these two numbers is \(10477\), what are the given digits?
Suppose that \(n\) is a natural number and \(p\) is a prime number. How many numbers are there less than \(p^n\) that are relatively prime to \(p^n\)?