history of mathematics - National STEM Centre
history of mathematics - National STEM Centre
history of mathematics - National STEM Centre
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Activity 3.7, page 38<br />
1 A point is that which has no part. A line is breadthless<br />
length.<br />
3 It is not clear what 'lying evenly' means.<br />
4 A circle is a closed curve. It contains a point O inside<br />
it such that for all points X on the circle the lengths OX<br />
are equal to each other. O is called the centre <strong>of</strong> the<br />
circle. A diameter <strong>of</strong> the circle is any line through the<br />
centre which has its ends on the circle. The diameter also<br />
bisects the circle.<br />
Activity 3.8, page 39<br />
1 Postulate 3 says that if you are given the centre <strong>of</strong> a<br />
circle and its radius, you can draw the circle. Postulate 4<br />
says that any right angle is equal to any other right angle.<br />
2 If a = b , then<br />
a- x = b — x.<br />
= b + x.Ifa = b, then<br />
3 Postulate 5 gives a condition for two lines to meet,<br />
and where they should meet. But what happens if the<br />
'angles are two right angles'?<br />
Activity 4.1, page 42<br />
1 A P R B<br />
D Q S C<br />
2 ADx(AP + PR + RB) =<br />
3 a(b<br />
4<br />
AD x AP + AD x PR + AD x RB<br />
ab<br />
ab<br />
(a + b) 2 =a 2 +b 2 +2ab<br />
Activity 4.2, page 43<br />
l<br />
Euclid<br />
Input A,B<br />
{A, E positive integers}<br />
14 Answers<br />
repeat<br />
while A > B<br />
A-B-+A<br />
endwhile<br />
if A = B<br />
then<br />
if 5 = 1<br />
then<br />
print "A, B co-prime"<br />
else<br />
print "A, B not co-prime"<br />
stop<br />
endif<br />
else<br />
endif<br />
until 0*0<br />
Output The highest common factor <strong>of</strong> A, B.<br />
3 The 'greatest common measure' is the highest<br />
common factor.<br />
4 In the algorithm in question 1, replace the lines<br />
following if A = B by<br />
then<br />
display B<br />
stop<br />
and the output is the highest common factor <strong>of</strong> A and B.<br />
Activity 4.3, page 43<br />
1 Suppose that the number <strong>of</strong> prime numbers is finite,<br />
and can be written a, b, ... , c where c is the largest. Now<br />
consider the number / = ab . . . c + 1 . Either/ is prime or<br />
it is not.<br />
Suppose first that/is prime. Then an additional prime/,<br />
bigger than c has been found.<br />
Suppose now that/is not prime. Then it is divisible by a<br />
prime number g. But g is not any <strong>of</strong> the primes<br />
a, b, ... ,c, for, if it is, it divides the product ab ... c , and<br />
also ab ...c + l, and hence it must also divide 1 , which is<br />
nonsense. Therefore g is not one <strong>of</strong> a, b, . . . , c, but it is<br />
prime. So an additional prime has been found.<br />
Therefore the primes can be written a,b,...,c,g, which<br />
is more than were originally supposed.<br />
Activity 4.4, page 45<br />
1 Two lengths are commensurable if there is a unit such<br />
that each length is an exact multiple <strong>of</strong> that unit. If no<br />
such unit exists, the lengths are incommensurable.<br />
167