scientific article

zbMath1207.11006MaRDI QIDQ3582591

Andrzej Rotkiewicz

Publication date: 2 September 2010

Full work available at URL: https://eudml.org/doc/35153

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pseudoprimesstrong pseudoprimeAurifeuillian pseudoprimescyclotomic pseudoprimesuperpseudoprimes

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The solution of W. Sierpinski's problem
• A new lower bound for the pseudoprime counting function
• Notes on János Bolyai's researches in number theory
• There are infinitely many Carmichael numbers
• Topologies related to arithmetical properties of integral domains
• Prime numbers and computer methods for factorization.
• On prime numbers \(p\) et \(q\) such that \(pq\mid 2^{pq}-2\)
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Factors of Fermat Numbers and Large Primes of the Form k ⋅2 n + 1
• The Pseudoprimes to 25 ⋅10 9
• Sur les formules donnant des nombres pseudopremiers
• A gap theorem for pseudoprimes in arithmetic progressions
• On Almost Primes

This page was built for publication: