Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\) (Q1198983): Difference between revisions

The well-known primality testing theorem of Proth states that if \(N\) is an integer of the form \(N=k\cdot 2^ n+1\), where \(k\) is odd and \(0<k<2^ n\), and if \(a\) is an integer such that \((a/N)=-1\) (where \((a/N)\) is the usual Jacobi symbol), then \(N\) is prime if, and only if \(a^{(N-1)/2}\equiv-1\bmod N\). In this paper an analogous theorem is proved for integers \(N\) of the form \(N=k\cdot 3^ n+1\), where \(k\) is even and not divisible by 3 and \(0<k<3^ n-2\). In the proof use is made of elementary facts about the arithmetic in \(\mathbb{Z}[\omega]\), where \(\omega\) is a primitive third root of unity. This theorem is combined with Proth's theorem to give a primality test for integers of the form \(N=k\cdot 2^ m 3^ n+1\). Like Proth's test, the tests given here are polynomial in \(\log N\). The tests are applied to two examples, viz., \(N=40\cdot 3^{543}+1\) and \(N=5\cdot 2^{54} 3^{57}+1\).