Talk:AKS test for primes

From Rosetta Code
Revision as of 19:34, 7 February 2014 by rosettacode>Paddy3118 (→‎Lower Limit: Yea, 1!)

Combinations

There is a link between the coefficients of the expansion of and nCr. --Paddy3118 (talk) 20:56, 6 February 2014 (UTC)

Lower Limit

Again... 1 appears as an "is it prime, isn't it prime" candidate.

is prime if all the coefficients of the polynomial expansion of: are divisible by . All the coefficients is the empty set. 1 is divisible by absolutely everything in the empty set. Is there a better wording out there? (That doesn't include the phrases "any number not 1" or "any number > 1") Tim-brown

It could also be worded that there isn't any number in the empty set that is divisible by . I think 1 should simply be ignored Denommus

If you can "sweep it under the carpet" then why not? It is a small part of the task. --Paddy3118 (talk) 19:34, 7 February 2014 (UTC)