7 Proof

Ext7

Extension 1 a Show that a perfect square must leave a remainder of 0 or 1 when divided
Exercise 7 by 4.
b Hence show that if a 2 ‡ b2 ˆ c2 , for integers a, b and c, then a and b cannot
both be odd.
2 Given that a, b, c 2 Z‡ and that a, b and c are different, prove by exhaustion
that there is only one solution to
1 1 1
‡ ‡ ˆ1
a b c

3 Prove that there are five, and only five, Platonic solids.
4 a If P1 , P2 and P3 are unequal prime numbers, prove, by contradiction, that
1 1 1
‡ ‡
P1 P2 P3
cannot be an integer.
b If P1 , P2 , P3 . . . , Pn are unequal prime numbers, prove, by contradiction, that
1 1 1 1
‡ ‡ ‡


‡
P1 P2 P3 Pn
cannot be an integer.
5 Prove that there are infinitely many primes.
6 Find the error in this argument.
To prove: 1ˆ2
Suppose that a is a solution of the equation x ˆ 1 ‡ x 2 .
Hence a ˆ 1 ‡ a 2 1

Clearly, a 6ˆ 0, so dividing by a is permitted, giving

1
1ˆ ‡ a.
a
1
Therefore, substituting ‡ 1 for 1 in 1
a
 
1
aˆ ‡ a ‡ a2
a
1
aˆ ‡ a ‡ a2
a
1
‡ a2 ˆ 0
a
Multiplying by a gives
1 ‡ a3 ˆ 0
a3 ˆ 1
aˆ 1

A2 Core for Edexcel # Pearson Education Ltd. 2005 1

 7 Proof

Substituting a ˆ 1 in 1 gives
1 ˆ 1 ‡ ( 1)2 ˆ 2
Hence 1ˆ2
7 Try to prove Goldbach's conjecture (page 159).

So far, no one has been able to find a proof of Goldbach's conjecture - that any even
number can be expressed as the sum of two primes. A Russian mathematician,
Schnirelmann, proved in 1931 that every integer can be represented as the sum of not
more than 300 000 primes. Subsequently, Vinogradoff, another Russian mathematician,
reduced the number from 300 000 to 4 for `sufficiently large' integers. He proved that
there exists a number N such that any integer n > N could be expressed as the sum of
at most four primes. He knew that N existed but had no way of determining N. These,
and other results, may eventually lead to a proof of Goldbach's conjecture.

2 A2 Core for Edexcel # Pearson Education Ltd. 2005