Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1198983
Jump to:navigation, search

DOI10.1007/BF02074886zbMath0772.11002OpenAlexW2039239222MaRDI QIDQ1198983

Andreas Guthmann

Publication date: 16 January 1993

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02074886


zbMATH Keywords

primality testProth's theorem


Mathematics Subject Classification ID

Factorization; primality (11A51)


Related Items (5)

Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\). ⋮ Primality test for numbers of the form \(A p^n + w_n\) ⋮ Deterministic primality test for numbers of the form $A^2.3^n+1$, $n \ge 3$ odd ⋮ Gaussian Mersenne and Eisenstein Mersenne primes ⋮ A primality test for 𝐾𝑝ⁿ+1 numbers



Cites Work

  • The Converse of Fermat's Theorem
  • Some Prime Numbers of the Forms 2A3 n + 1 and 2A3 n - 1
  • Prime numbers and computer methods for factorization
  • Unnamed Item


This page was built for publication: Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1198983&oldid=13263635"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki