Take a decimal r belonging to R.

Es. 13.77,

Ok now raise the square and to do so using a linear combination:

(13.77) ^ 2 = 13 ^ 2 + 13 * 0.77 + 13.77 * 0.77 / / this and how to

write only 13.77 * 13.77.

But now explain the algorithm.

So is the square of one decimal place in linear combination:

(X.y) ^ 2 = x ^ 2 + x * 0.y + xy * 0.y

But for an algorithm change one small thing ...

(X.y) ^ 2 = x ^ 2 + x * y + xy * 0.y

The algorithm begins with x> 1

For the second step does not do 13 * 0.77 but 13 * 77

Es. X = 13 y = 77, r = 13.77

169 + 1001 + 9.8329 ... Ok, I write 9.8329 as a whole without dot 98329

And do 169 + 1001 + 98329 = 99499 ...

Another example:

r = 5.2

(5.2) ^ 2 = 25 + 5 * 2 + 5.2 * 0.2 = 35 + 1.04 as I write 35 + 104 = 139

Another example still

r = 64.202

(64.202) ^ 2 = 4096 + 64 * 202 + 12.968804 = 4096 + 12928 + 12.968804 ...

Ok do 4096 + 1001 + 12968804 = 13010771 ...

Another example

r = 1.002

(1.002) ^ 2 = 1 + 1 * 2 + 1.002 * 0.002 =

1 + 2 + 0.002004 = 3 + 2004 = 2007

r = 1.1

1 + 1 * 1 + 1.1 * 0.1 = 1 + 1 + 11 = 13

-REFLECTION

If the algorithm work:

But the cardinality of R > N, and then if all r return with the

algorithm a prime

We would have an infinite of primes, that are much more then these

naturals, and nature of this is absurd.

reguards Alby7e7