Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu)

DOI10.1080/09720529.2019.1662580zbMath1487.05023OpenAlexW3005749284MaRDI QIDQ5865691

Yaotsu Chang, Tian-Xiao He, Peter Jau-Shyong Shiue

Publication date: 9 June 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1662580

zbMATH Keywords

Fermat's little theoremsquarefree numberspseudoprimes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Special sequences and polynomials (11B83) Matrices of integers (15B36) Linear equations (linear algebraic aspects) (15A06) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• A matrix method for solving the postage stamps problem
• Lucas Pseudoprimes
• Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
• On the Converse of Fermat's Theorem II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu)