I'm not sure but I'm guessing this would be a faster way to compute finding primes. I.e. using Euclid's algorithm.

See............https://en.wikipedia.org/wiki/Euclidean_algorithm

Primality Tests are usually done on numbers in the range of 2^1024 to 2^2048 (or much, much bigger numbers, when it's simply about "finding a prime", not crypto). Enumerating (and multiplying!) all the primes below those numbers is an insurmountable task.

If enumerating all primes was easy, RSA would be useless :-p

Edit: I just saw this thread is kinda old (still first page), I hope this doesn't count as necromancy

]]>For Diophantine equation.

You can record a parameterization.

]]>Incidentally, do not use the short form of this games name in your post or the server will bar you.

]]>I placed you link between the url tags so it would show. - bobbym

]]>let

Taking natural long on both sides yields

Then

If we could consider the "undefined" cancelling each other equal to zero.

Thus

We can argue like forever with this thing but this is how mathematics progresses Perhaps 0/0=An Apple:)

]]>@anon I guess, if you want to think about it that way...

]]>Do you wanna see conversion from higher scale to lower scale in an online calculator?

Here it is....

Check out this free online number conversion calculator helps you to convert between Million to Billion from https://www.millionbillion.online/

Enter the number in the million box and the calculator will automatically convert the number into billion for you. Also here, you can check the conversion chart from higher scale to lower scale and vice versa

]]>