On Lucas Pseudoprimes of the Form ax 2 + bxy + cy 2

A. Rotkiewicz

A chapter in Applications of Fibonacci Numbers, 1996, pp 409-421 from Springer

Abstract: Abstract A composite number n is called a pseudoprime if n | 2 n − 2. In 1963 I proved [6] that every arithmetic progression ax + b(x = 0,1,2,···), where (a,b) = l, contains infinitely many pseudoprimes. In 1964 in a joint paper with A. Schinzel [9] we proved some theorems on pseudoprimes of the form ax 2 + bxy + cy 2. Here we shall give a generalization of the results from the above paper for Lucas pseudoprimes.

Keywords: Quadratic Form; Arithmetical Progression; Rational Integer; Lucas Number; Large Prime Factor (search for similar items in EconPapers)
Date: 1996
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-009-0223-7_34

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

DOI: 10.1007/978-94-009-0223-7_34

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 ().