Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Pseudoprimes and Fermat numbers

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

MaRDI QIDQ6542781

Samuel S. jun. Wagstaff

Publication date: 23 May 2024

Published in: Integers (Search for Journal in Brave)




zbMATH Keywords

factorizationFermat numberprimality testpseudoprimestrong pseudoprime


Mathematics Subject Classification ID

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


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The generation of random numbers that are probably prime
  • Probabilistic algorithm for testing primality
  • Evaluation and comparison of two efficient probabilistic primality testing algorithms
  • There are infinitely many Carmichael numbers
  • On the partition of positive integers in four classes according to the minimal number of squares needed to their additive composition
  • The Pseudoprimes to 25 ⋅10 9
  • Lucas Pseudoprimes
  • New Primality Criteria and Factorizations of 2 m ± 1







This page was built for publication: Pseudoprimes and Fermat numbers

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6542781&oldid=40071802"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki