Let \(n\ge r\) be positive integers. What is \(F_n^2-F_{n-r}F_{n+r}\) in terms of \(F_r\)?
Have you wondered if \(F_{-5}\) is possible? Here is how we can extend the Fibonacci sequence to the negative indices. The relation \(F_{n+1} = F_n + F_{n-1}\) can be rewritten as \(F_{n-1} = F_{n+1} - F_n\). We can simply define the Fibonacci sequence with negative indices with this formula. For example, \(F_{-1} = F_1 - F_0 = 1 - 0 = 1\).
Write out \(F_{-1}, F_{-2},\dots,F_{-10}\). What do you notice about the Fibonacci sequence with negative indices?
Let \(n\) be a positive integer. We denote by \(s(n)\) the sum of the divisors of \(n\). For example, the divisors of \(n=6\) are \(1\), \(2\), \(3\) and \(6\), so \(s(6)=1+2+3+6=12\). Prove that, for all \(n\ge1\), \[\sum_{k=1}^ns(k)=s(1)+s(2)+...+s(n)\le\frac{\pi^2}{12}n^2+\frac{n\log n}{2}+\frac{n}{2}.\]
A shop sells golf balls, golf clubs and golf hats. Golf balls can be purchased at a rate of \(25\) pennies for two balls. Golf hats cost \(\mathsterling1\) each. Golf clubs cost \(\mathsterling10\) each. At this shop, Ross purchased \(100\) items for a total cost of exactly \(\mathsterling100\) (Ross purchased at least one of each type of item). How many golf hats did Ross purchase?
For every pair of integers \(a\),
\(b\), we define an operator \(a\otimes b\) with the following three
properties.
1. \(a\otimes a=a+2\);
2. \(a\otimes b = b\otimes a\);
3. \(\frac{a\otimes(a+b)}{a\otimes
b}=\frac{a+b}{b}.\)
Calculate \(8\otimes5\).
During a tournament with six players, each player plays a match against each other player. At each match there is a winner; ties do not occur. A journalist asks five of the six players how many matches each of them has won. The answers given are \(4\), \(3\), \(2\), \(2\) and \(2\). How many matches have been won by the sixth player?
The letters \(A\), \(E\) and \(T\) each represent different digits from \(0\) to \(9\) inclusive. We are told that \[ATE\times EAT\times TEA=36239651.\] What is \(A\times E\times T\)?
\(x\), \(y\) and \(z\) are all integers. We’re told that \[\begin{align} x^3yz&=6\\ xy^3z&=24\\ xyz^3&=54. \end{align}\] What’s \(xyz\)?
Let \(a\), \(b\) and \(c\) be positive real numbers such that \(a+b+c=3\). Prove that \(a^a+b^b+c^c\ge3\).
Two players are playing a game. The first player is thinking of a finite sequence of positive integers \(a_1\), \(a_2\), ..., \(a_n\). The second player can try to find the first player’s sequence by naming their own sequence \(b_1\), \(b_2\), ..., \(b_n\). After this, the first player will give the result \(a_1b_1 + a_2b_2 + ...+a_nb_n\). Then the second player can say another sequence \(c_1\), \(c_2\), ..., \(c_n\) to get another answer \(a_1c_1+ a_2c_2 + ... +a_nc_n\) from the first player. Find the smallest number of sequences the second player has to name to find out the sequence \(a_1\), \(a_2\), ..., \(a_n\).