Primality

An algorithm for testing primality.

by jpsierens

JavaScript

// a^(p − 1) − 1
// a “factorless” test for determining whether a number N is prime

let primality = (N) => {
	let a = N-1;
  let power = Math.pow(a, a);
  
  console.log(power);
  
  return (power - 1) % N === 0;
}

console.log(primality(6))