Re: Q:About primes?


Joseph Fagan wrote:

> >> Why does a certain large prime require much more
> >> processing time to verify its primality than one that
> >> is more than 60 times its size?

<snip>

> > What on earth are you gibbering on about?
> >
> > A 751-digit prime is roughly 1.0026 times the size of a 749-digit number.
> >
> > Phil
> Eh?
> 10^751 / 10^749 = 10^2
>
> Joe

Congratulations. You can do arithmetic. Please explain what your
arithmetic has to do with the subject under discussion.

May I suggest that before you shoot your mouth off again, that you
actually do a little READING about this subject. In particular, look
up "complexity theory: measuring time complexity as a function of
input
size".

The magnitude of a number is NOT the same as its size. The SIZE of a
number is the number of bits (or digits, they differ only by a
constant
factor) needed to represent a number.

Your first number is 751 digits. This is its SIZE.
The second number is 749 digits. 751/749 ~ 1.00267

What is it that compels people who have no understanding of even the
basic
definitions of a subject to show off their ignorance?

.