37 problems found
Write down the cubes of the integers \(1, 2, \ldots , 10\). The positive integers \(x\), \(y\) and \(z\), where \(x < y\), satisfy \[ x^3+y^3 = kz^3\,, \tag{\(*\)} \] where \(k\) is a given positive integer.
Solution: \begin{array}{c|c} n & n^3 \\ \hline 1 & 1 \\ 2 & 8 \\ 3 & 27 \\ 4 & 64 \\ 5 & 125 \\ 6 & 216 \\ 7 & 343 \\ 8 & 512 \\ 9 & 729 \\ 10 & 1000 \\ \end{array}
Solution:
A {\em proper factor} of an integer \(N\) is a positive integer, not \(1\) or \(N\), that divides \(N\).
Solution:
Solution:
Find the integer, \(n\), that satisfies \(n^2 < 33\,127< (n+1)^2\). Find also a small integer \(m\) such that \((n+m)^2-33\,127\) is a perfect square. Hence express \(33\,127\) in the form \(pq\), where \(p\) and \(q\) are integers greater than \(1\). By considering the possible factorisations of \(33\, 127\), show that there are exactly two values of \(m\) for which \((n+m)^2 -33\,127\) is a perfect square, and find the other value.
Solution: \begin{align*} 180^2 &= 32400 \\ 181^2 &= 32761 \\ 182^2 &= 33124 \\ 183^2 &= 33489 \\ 184^2 &= 33856 \end{align*} Therefore \(182^2 < 33\,127 < (182+1)^2\). and \((182+2)^2 - 33\,127 = 729 = 27^2\). Therefore \(33\,127 = 184^2 - 27^2 = 211 \times 157\). (Note both of these numbers are prime). Suppose \((n+m)^2 - 33\,127 = k^2\) then \(33\,127 = (n+m)^2-k^2 = (n+m-k)(n+m+k)\). Since there are only two factorisations of \(33\,127\) into positive integer factors with one factor larger than the other, the other factorisation must be: \(n+m+k = 33\,127, n+m-k = 1 \Rightarrow k = \frac{33\, 126}{2} = 16563\), ie \(16564^2 - 33\,127 = 16563^2\)
For any positive integer \(N\), the function \(\f(N)\) is defined by \[ \f(N) = N\Big(1-\frac1{p_1}\Big)\Big(1-\frac1{p_2}\Big) \cdots\Big(1-\frac1{p_k}\Big) \] where \(p_1\), \(p_2\), \(\dots\) , \(p_k\) are the only prime numbers that are factors of \(N\). Thus \(\f(80)=80(1-\frac12)(1-\frac15)\,\).
Solution:
The positive integers can be split into five distinct arithmetic progressions, as shown: \begin{align*} A&: \ \ 1, \ 6, \ 11, \ 16, \ ... \\ B&: \ \ 2, \ 7, \ 12, \ 17, \ ...\\ C&: \ \ 3, \ 8, \ 13, \ 18, \ ... \\ D&: \ \ 4, \ 9, \ 14, \ 19, \ ... \\ E&: \ \ 5, 10, \ 15, \ 20, \ ... \end{align*} Write down an expression for the value of the general term in each of the five progressions. Hence prove that the sum of any term in \(B\) and any term in \(C\) is a term in \(E\). Prove also that the square of every term in \(B\) is a term in \(D\). State and prove a similar claim about the square of every term in \(C\).
Let \(k\) be an integer satisfying \(0\le k \le 9\,\). Show that \(0\le 10k-k^2\le 25\) and that \(k(k-1)(k+1)\) is divisible by \(3\,\). For each \(3\)-digit number \(N\), where \(N\ge100\), let \(S\) be the sum of the hundreds digit, the square of the tens digit and the cube of the units digit. Find the numbers \(N\) such that \(S=N\). [Hint: write \(N=100a+10b+c\,\) where \(a\,\), \(b\,\) and \(c\) are the digits of \(N\,\).]
Solution: First note that \(10k - k^2 = 25 - (5-k)^2\) which is clearly bounded above by \(25\). The smallest it can be is when \(|5-k|\) is as large as possible, ie when \(k =0\) and we get a lower bound of \(0\). For \((k-1)k(k+1)\) notice this is the product of \(3\) consecutive integers, and therefore must be divisible by \(3\). (In fact, it's divisible by six, since \(\binom{k+1}{3}\) is the number of ways to choose \(3\) objects from \(k+1\). Let \(N = 100a + 10b + c\) where \(0 \leq a,b,c < 10\) and \(1 \leq a\). \(S = a + b^2 + c^3\) we want to find \begin{align*} && 100a +10b + c &= a + b^2 + c^3 \\ \Rightarrow && 0 &= \underbrace{99a}_{3 \mid 99 } + 10b - b^2 -\underbrace{c(c+1)(c-1)}_{3 \mid c(c+1)(c-1)} \\ \end{align*} Therefore \(3 \mid 10b - b^2 = b(10-b)\). Therefore \(3 \mid b\) or \(3 \mid 10-b\) so \(b = 0, 3, 6, 1, 4, 7\) We also have \(99a \geq 99\) and \(10b-b^2 \in [0, 25]\) so we need \(c^3-c \geq 99\), so \(c \geq 5\) Case \(c = 5\), Then \(c^3-c = 120\) so \(a = 1\) and \(10b-b^2 = 21\) so \(b= 3, 7\) \(N = 135, 175\) Case \(c = 6\), so \(c^3 - c = 210\) so \(a = 2\) and \(25-(5-k)^2 = 12\) so no solutions. Case \(c = 7\), so \(7^3 - 7 = 336\) so \(a = 3\) and \(25-(5-k)^2 = 39\) so no solutions. Case \(c = 8\) so \(8^3-8 = 504\) so \(a = 5\) and \(25-(5-k)^2 = 9\), so \(b = 1, 9\) and \(N = 518, 598\) Case \(c = 9\) so \(9^3 - 9 = 720\), so \(a = 7\) and \(25-(5-k)^2 = 27\) so no solutions. Therefore all the solutions are \(N = 135, 175, 518, 598\)
The \(n\)th Fermat number, \(F_n\), is defined by \[ F_n = 2^{2^n} +1\, , \ \ \ \ \ \ \ n=0, \ 1, \ 2, \ \ldots \ , \] where \(\ds 2^{2^n}\) means \(2\) raised to the power \(2^n\,\). Calculate \(F_0\), \(F_1\), \(F_2\) and \(F_3\,\). Show that, for \(k=1\), \(k=2\) and \(k=3\,\), $$ F_0F_1 \ldots F_{k-1} = F_k-2 \;. \tag{*} $$ Prove, by induction, or otherwise, that \((*)\) holds for all \(k\ge1\). Deduce that no two Fermat numbers have a common factor greater than \(1\). Hence show that there are infinitely many prime numbers.
Solution: \begin{align*} && F_0 &= 2^{2^0}+1 \\ &&&= 2^1+1 = 3\\ && F_1 &= 2^{2^1}+1 \\ &&&= 2^2+1 = 5 \\ && F_2 &= 2^{2^2}+1 \\ &&&= 2^4+1 \\ &&&= 17 \\ &&F_3 &= 2^{2^3}+1 \\ &&&= 2^8+1 \\ &&&= 257 \\ \\ && \text{empty product} &= 1\\ && F_1 - 2 &= 3-2 = 1\\ \Rightarrow&& 1 &= F_1-2\\ && F_0 &=3 \\ && F_2-2 &= 3 \\ \Rightarrow && F_0 &= F_2 - 2\\ && F_0F_1 &= 3 \cdot 5 = 15 \\ && F_3-2 &= 17-2 = 15 \\ \Rightarrow && F_0F_1 &= F_3-2 \end{align*} \begin{align*} && F_0 F_1 \cdots F_{k-1} &= \prod_{i=0}^{k-1} \left ( 2^{2^{i}}+1\right) \\ &&&= \sum_{l = \text{sum of }2^i} 2^l \\ &&&= \sum_{l=0}^{2^{k}-1}2^l \\ &&&= 2^{2^k}-1 \\ &&&= F_k-2 \end{align*} Suppose \(p \mid F_a, F_b\) with \(b > a\), then \(p \mid 2=F_b - F_0\cdots F_a \cdots F_{b-1}\) therefore \(p = 1, 2\), but \(2 \nmid F_a\) for any \(a\). Therefore any number dividing two Fermat numbers is \(1\), ie they are all coprime. Consider the smallest prime dividing \(F_n\) for each \(n\). Clearly these are all different since each \(F_n\) is coprime from all the others. Clearly there are infinitely many of time (since there are infinitely many \(F_n\)). Therefore there are infinitely many primes.
Show that if \(x\) and \(y\) are positive and \(x^3 + x^2 = y^3 - y^2\) then \(x < y\,\). Show further that if \(0 < x \le y - 1\), then \(x^3 + x^2 < y^3 - y^2\). Prove that there does not exist a pair of {\sl positive} integers such that the difference of their cubes is equal to the sum of their squares. Find all the pairs of integers such that the difference of their cubes is equal to the sum of their squares.
A number of the form \(1/N\), where \(N\) is an integer greater than 1, is called a unit fraction. Noting that \[ \frac1 2 =\frac13 + \frac16\\\ \mbox{ and } \frac13 = \frac14 + \frac1{12}, \] guess a general result of the form $$ \frac1N =\frac1a +\frac1b \tag{*} $$ and hence prove that any unit fraction can be expressed as the sum of two distinct unit fractions. By writing \((*)\) in the form \[ (a-N)(b-N)=N^2 \] and by considering the factors of \(N^2\), show that if \(N\) is prime, then there is only one way of expressing \(1/N\) as the sum of two distinct unit fractions. Prove similarly that any fraction of the form \(2/N\), where \(N\) is prime number greater than 2, can be expressed uniquely as the sum of two distinct unit fractions.
Solution: Notice that \(\frac{1}{N} = \frac{1}{N+1} + \frac{1}{N(N+1)}\), so any unit fraction can be expressed as the sum of two distinct unit fractions. \begin{align*} && \frac{1}N &= \frac1a + \frac1b \\ \Leftrightarrow && ab&= Nb+Na \\ \Leftrightarrow && 0 &= (a-N)(b-N)-N^2 \\ \Leftrightarrow && N^2 &= (a-N)(b-N) \end{align*} If \(N\) is prime then the only factors of \(N^2\) are \(1,N\) and \(N^2\). if \(a-N = b-N = N\) then \(a=b\) and we don't have distinct fractions. Therefore \(a-N = 1\) and \(b-N = N^2\) and we obtain the decomposition earlier (and it must be the only solution). \begin{align*} && \frac2N &= \frac1a+\frac1b \\ \Leftrightarrow && 2ab &= Nb+Na \\ \Leftrightarrow && 4ab &= 2Na+2Nb \\ \Leftrightarrow && N^2 &= (2a-N)(2b-N) \end{align*} Therefore for \(a,b\) to be distinct we must have \(2a = N+1\) and \(2b = N+N^2\) as the only possible factorisation. Both of the right hand sides are even so we can write \[ \frac{1}{N} = \frac{1}{\frac{N+1}{2}} + \frac{1}{\frac{N(N+1)}{2}} \] and this is unique
How many integers greater than or equal to zero and less than a million are not divisible by 2 or 5? What is the average value of these integers? How many integers greater than or equal to zero and less than 4179 are not divisible by 3 or 7? What is the average value of these integers?
Solution: There are \(1\,000\,000\) numbers between 1 and a million (inclusive). \(500\,000\) are divisible by \(2\), \(200\,000\) are divisible by \(5\) and \(100\,000\) are divisible by both. Therefore there are: \(1\,000\,000 - 500\,000-200\,000+100\,000 = 400\,000\). (Alternatively, the only numbers are those which are \(1,3,7,9 \pmod{10}\) so there are \(4\) every \(10\), or \(4 \cdot 100\,000\)). We can sum all these values similarly, \begin{align*} S &= \underbrace{\sum_{i=1}^{10^6} i}_{\text{all numbers}}-\underbrace{\sum_{i=1}^{5 \cdot 10^5} 2i}_{\text{all multiples of } 2}-\underbrace{\sum_{i=1}^{2 \cdot 10^5} 5i}_{\text{all multiples of } 5}+\underbrace{\sum_{i=1}^{10^5} 10i}_{\text{all multiples of } 5} \\ &= \frac{10^6 \cdot (10^6 + 1)}{2} - \frac{10^6 \cdot (5\cdot 10^5+1)}{2} - \frac{10^6 \cdot (2\cdot 10^5+1)}{2} + \frac{10^6 \cdot (10^5+1)}{2} \\ &= \frac{10^6 (10^5 \cdot (10-5-2+1))))}{2} \\ &= \frac{10^6 \cdot 10^5 \cdot 4}{2} \\ &= 2\cdot 10^{11} \end{align*} So the average value is \(\frac{2 \cdot 10^{11}}{4 \cdot 10^5} = \frac{10^6}{2} = 500\,000\). (Alternatively, each value can be paired off eg \(999\,999\) with \(1\) and so on, leaving averages of \(500\,000\)). Note that \(4197\) is divisible by \(3\) and \(7\). Using the same long we have: \(4179 - \frac{4179}{3} - \frac{4179}{7} + \frac{4179}{21} = 4179 - 1393 - 597 + 199 = 2388\). The sum will be: \begin{align*} S &= \underbrace{\sum_{i=1}^{4179}i }_{\text{all numbers}}- \underbrace{\sum_{i=1}^{1393}3i }_{\text{multiples of }3}- \underbrace{\sum_{i=1}^{597}7i }_{\text{multiples of }7}+ \underbrace{\sum_{i=1}^{199}21i }_{\text{mulitples of }21} \\ &= \frac{4179 \cdot 4180}{2} - \frac{4179 \cdot 1394}{2} - \frac{4179 \cdot 598}{2} +\frac{4179 \cdot 200}{2} \\ &= \frac{4179 \cdot 2388}{2} \end{align*} So the average value is \(\frac{4179}{2}\).
Show that, if \(n\) is an integer such that $$(n-3)^3+n^3=(n+3)^3,\quad \quad {(*)}$$ then \(n\) is even and \(n^2\) is a factor of \(54\). Deduce that there is no integer \(n\) which satisfies the equation \((*)\). Show that, if \(n\) is an integer such that $$(n-6)^3+n^3=(n+6)^3, \quad \quad{(**)}$$ then \(n\) is even. Deduce that there is no integer \(n\) which satisfies the equation \((**)\).
Solution: \begin{align*} && n^3 &= (n+3)^3 - (n-3)^3 \\ &&&= n^3 + 9n^2+27n + 27 - (n^3 - 9n^2+27n-27) \\ &&&= 18n^2+54 \end{align*} Therefore since \(2 \mid 2(9n^2 + 27)\), \(2 \mid n^3 \Rightarrow 2 \mid n\), so \(n\) is even. Since \(n^2 \mid n^3\), \(n^2 \mid 54 = 2 \cdot 3^3\), therefore \(n = 1\) or \(n = 3\). \((1-3)^3 + 1^3 < 0 < (1+3)^3\). So \(n = 1\) doesn't work. \((3 - 3)^3 + 3^3 < (3+3)^3\) so \(n = 3\) doesn't work. Therefore there are no solutions. \begin{align*} && n^3 &= (n+6)^3 - (n-6)^3 \\ &&&= n^3 + 18n^2 + 180n + 6^3 - (n^3 - 18n^2 + 180n - 6^3 ) \\ &&&= 36n^2+2 \cdot 6^3 \end{align*} Therefore \(n^2 \mid 2 \cdot 6^3 = 2^4 \cdot 3^3\), therefore \(n = 1, 2, 3, 4, 6, 12\). \(n = 1\), \(1^3 <36+2\cdot 6^3\) \(n = 2\), \(2^3 <36 \cdot 4 + 2 \cdot 6^3\) \(n = 3\), \(3^3 <36 \cdot 9 + 2 \cdot 6^3\) \(n = 4\), \(4^3 < 36 \cdot 16 + 2 \cdot 6^3\) \(n = 6\), \(6^3 < 36\cdot 6^2+ 2 \cdot 6^3\) \(n = 12\), \(12^3 < 36 \cdot 12^2 + 2 \cdot 6^3\) Therefore there are no solutions \(n\) to the equation. These are both special cases of Fermat's Last Theorem, when \(n = 3\)
Let \(n\) be a positive integer.
Solution: