Solved and Unsolved Problems on Pseudoprime Numbers and Their Generalizations

Andrzej Rotkiewicz

A chapter in Applications of Fibonacci Numbers, 1999, pp 293-306 from Springer

Abstract: Abstract Following recent papers [1], [5], [22], [23] a composite n is called a pseudoprime to base $$b if {{b}^{{n - 1}}} \equiv 1 \bmod n. $$

Keywords: 11A07; 11B39 (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-011-4271-7_28

Ordering information: This item can be ordered from
http://www.springer.com/9789401142717

DOI: 10.1007/978-94-011-4271-7_28

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().