10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

176 Chapter 4 PRIMALITY PROVING<br />

smaller than F . From the uniqueness of the base-F representation of a number<br />

it follows that c2 = ab and c1 = a + b as claimed.<br />

Now suppose, conversely, that c 2 1 − 4c2 is a square, say u 2 .Then<br />

<br />

c1 + u c1 − u<br />

n = F +1 F +1 .<br />

2 2<br />

The two fractions are both integers, since c1 ≡ u (mod 2). It remains to note<br />

that this factorization is nontrivial, since c2 > 0 implies |u|

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!