On the primality of 2h 3ⁿ+1

DOI10.1016/S0012-365X(01)00125-XzbMATH Open1037.11003OpenAlexW2121079026WikidataQ59620112 ScholiaQ59620112MaRDI QIDQ5951950FDOQ5951950

Authors: Christoph Kirfel, Øystein J. Rødseth 

Publication date: 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00125-x

Recommendations

• Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\)
• Primality tests for numbers of the form \(k\cdot 2^m\pm 1\)
• A note on primality tests for \(N=h\cdot 2^ n-1\)
• scientific article; zbMATH DE number 4208141
• Deterministic primality test for numbers of the form \(A^2. 3^n+1\), \(n \geq 3\) odd

zbMATH Keywords

primality testscubic reciprocity

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Cited In (7)

• A note on primality tests for \(N=h\cdot 2^ n-1\)
• Deterministic primality test for numbers of the form \(A^2. 3^n+1\), \(n \geq 3\) odd
• On the Primality of k! + 1 and 2 ∗ 3 ∗ 5 ∗ ⋯∗ p + 1
• Title not available (Why is that?)
• On the simplicity of \(\cdot 2\) and \(\cdot 3\)
• Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\)
• Bits of \(3^n\) in binary, Wieferich primes and a conjecture of Erdős

This page was built for publication: On the primality of \(2h\cdot 3^n+1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951950)