"prime numbers formula" crankery - Page 2

Jens K Andersen · 2009-03-04, 14:57

A useless but more elegant formula with % being the modulo operator:
2*(m-1)!%m+2 = m, if m is prime
= 2, otherwise

Mr. P-1 · 2009-03-04, 16:51

Quote:

Originally Posted by CRGreathouse

His claim that generating a formula for the prime is a "2300-years old unsolvable problem" is a little wacky. It's been solved... over and over and over.

In particular, Hardy and Wright give essentially the same formula in the appendix of their book "An introduction to the theory of numbers".

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!"	wildrabbitt	Miscellaneous Math	11	2015-03-06 08:17
Looking for PrimeKit from "Prime Numbers A Computational Perspective"	gszpetkowski	Factoring	13	2014-08-05 11:57
factorization of "almost" prime numbers	Ryan	Computer Science & Computational Number Theory	23	2012-06-03 20:50
Would Minimizing "iterations between results file" may reveal "is not prime" earlier?	nitai1999	Software	7	2004-08-26 18:12

2009-03-04, 14:57	#12
Jens K Andersen Feb 2006 Denmark 346₈ Posts	A useless but more elegant formula with % being the modulo operator: 2*(m-1)!%m+2 = m, if m is prime = 2, otherwise