Problems

Filters
Clear Filters

2 problems found

2014 Paper 1 Q1
D: 1500.0 B: 1500.0
proof number theory difference of two squares parity factorisation odd and even prime numbers counting arguments

All numbers referred to in this question are non-negative integers.

  1. Express each of the numbers 3, 5, 8, 12 and 16 as the difference of two non-zero squares.
  2. Prove that any odd number can be written as the difference of two squares.
  3. Prove that all numbers of the form \(4k\), where \(k\) is a non-negative integer, can be written as the difference of two squares.
  4. Prove that no number of the form \(4k+2\), where \(k\) is a non-negative integer, can be written as the difference of two squares.
  5. Prove that any number of the form \(pq\), where \(p\) and \(q\) are prime numbers greater than 2, can be written as the difference of two squares in exactly two distinct ways. Does this result hold if \(p\) is a prime greater than 2 and \(q=2\)?
  6. Determine the number of distinct ways in which 675 can be written as the difference of two squares.

Solution:

  1. \(\,\) \begin{align*} && 3 &= 2^2 - 1^2 \\ && 5 &= 3^2 - 2^2 \\ && 8 &= 3^2 - 1^2 \\ && 16 &= 5^2 - 3^2 \end{align*}
  2. Suppose \(n = 2k+1\), then \(n = (k+1)^2 - k^2\)
  3. Suppose \(n = 4k\) then \(n = (2k+1)^2 - (2k-1)^2\)
  4. All squares leave a remainder of \(0\) or \(1\) on division by \(4\). Therefore the difference can leave a remainder of \(0\), \(1\), \(-1 \equiv 3\), none of which are \(2\).
  5. Suppose \(n = pq = a^2 - b^2\) with \(a > b\) ie \((a-b)(a+b) = pq\). Since \(p\) is prime, \(p \mid (a-b)\) or \(p \mid (a+b)\). Similarly for \(q\). Suppose also (wlog) that \(p > q\) Since the factors of \(pq\) are \(1, p, q, pq\) then \(a-b = 1, p\) (which are two possibilities) and \(a+b = pq, q\), ie \(a = \frac{1+pq}{2}, \frac{p+q}{2}\) and \(b = \frac{pq-1}{2}, \frac{p-q}{2}\) \begin{align*} && pq &= \left ( \frac{1+pq}{2} \right)^2- \left ( \frac{1-pq}{2} \right)^2 \\ &&&= \left ( \frac{p+q}{2} \right)^2- \left ( \frac{p-q}{2} \right)^2 \\ \end{align*} Where everything is an integer since \(p\) and \(q\) are odd. If we have \(p > 2\) and \(q = 2\) then \(p\) is odd and the number has the form \(4k+2\) which cannot be expressed as the difference of two squares.
  6. \(675 = 3^3 \cdot 5^2\), each factor pair of \(675\) will lead to a different solution of \(675 = a^2-b^2\), since we will have an equation \(a-b = X, a+b = Y\) where \(X, Y\) are both odd. Therefore there are as many solution as (half) the number of factors, ie \(4 \times 3 = 12\)

View
1998 Paper 2 Q1
D: 1600.0 B: 1500.0
proof proof by contradiction number theory divisibility parity cubic equations integer solutions Diophantine equation

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\)

View