Testing for prime - Revision history

Andr3w: /* Primes per Thousand Again */

2021-09-27T09:43:13Z

Primes per Thousand Again

2021-09-27T09:42:52Z

Primes per Thousand Again

@@ Line 161: / Line 161: @@
 * 1000000 (10<sup>6</sup>),10000000,100000000, ... 1000000000000 (10<sup>12</sup>)
 <pre class='usr'>
 </pre>
 <pre class='ans'>
@@ Line 177: / Line 200: @@
 //raise n to the power e, modulo m
 function pow(n,e,m){
    if (e<=0) return 1n;

2021-09-27T09:40:35Z

Primes per Thousand

@@ Line 143: / Line 143: @@
+}
 document.body.innerHTML = `${pc}`
 //raise n to the power e, modulo m

2021-09-27T08:39:57Z

Prime Googol

@@ Line 116: / Line 116: @@
+}
 document.body.innerHTML = `${b}`
 //raise n to the power e, modulo m

2021-09-26T21:07:18Z

← Older revision		Revision as of 21:07, 26 September 2021
Line 6:		Line 6:
	The converse is that if		The converse is that if
	x<sup>p</sup> mod p ≠ x		x<sup>p</sup> mod p ≠ x
	then p is not prime. If the equality holds for some value of x then p is <i>probably</i> a prime. If the equality holds for two values of x then it is even more probable that p is prime. For these questions you can ~~ignore~~ that ~~probability~~.		then p is not prime. If the equality holds for some value of x then p is <i>probably</i> a prime. If the equality holds for two values of x then it is even more probable that p is prime. For these questions you can assume that if <code>2<sup>p</sup> mod p =2</code> then p is prime.

	==Probable primes==		==Probable primes==

2021-09-26T21:04:37Z

Prime Googol

2021-09-26T21:04:05Z

Prime Billion

@@ Line 62: / Line 62: @@
 <div class='qu' data-width=300>
 Find the first prime bigger than 1 billion
 <pre class='usr'>
 let b = 1000000000n;

2021-09-26T21:00:24Z

Prime Billion

2021-09-26T20:59:39Z

Prime Billion

2021-09-26T20:58:08Z

Probable primes

@@ Line 49: / Line 49: @@
    })
 );
 //raise n to the power e, modulo m