Generalization of Fermat's Little Theorem!
in [Math]
|
Prev: "the wronging of Mr. Devlin" by Hardy/Woodgold/Davis in Mathematical Intelligencer and convoluted math writing #4.03 Correcting Math
Next: Convexity of matrix operation
From: Sebastian Garth on 21 Jul 2010 16:44 Briefly stated: IFF gcd( s( N, N - 1 ) mod s( N, 1 ), N ) = 1 then N is either a prime or a Carmichael number, where s( N, E ) denotes the sum of powers function (eg: 1^E + 2^E ... + N^E).
From: Gerry on 21 Jul 2010 19:59
On Jul 22, 6:44 am, Sebastian Garth <sebastianga...(a)gmail.com> wrote: > Briefly stated: IFF gcd( s( N, N - 1 ) mod s( N, 1 ), N ) = 1 then N > is either a prime or a Carmichael number, where s( N, E ) denotes the > sum of powers function (eg: 1^E + 2^E ... + N^E). Are you familiar with Giuga's conjecture? -- GM |