Open Access
2007 PSEUDOPRIMES IN CERTAIN LINEAR RECURRENCES
Florian Luca, Igor E. Shparlinski
Author Affiliations +
Albanian J. Math. 1(3): 125-131 (2007). DOI: 10.51286/albjm/1189355988
Abstract

Let b>1 be a fixed positive integer. We study the distribution of pseudoprimes to base b in certain linear recurrence sequences. We prove, in effective form, that most terms of these sequences are not pseudoprimes to base b.

References

1.

[1] J.-P. Bézivin, A. Pethö and A. J. van der Poorten, ‘A full characterisation of divisibility sequences’, Amer. J. Math. 112 (1990), no. 6, 985–1001.[1] J.-P. Bézivin, A. Pethö and A. J. van der Poorten, ‘A full characterisation of divisibility sequences’, Amer. J. Math. 112 (1990), no. 6, 985–1001.

2.

[2] A. C. Cojocaru, F. Luca and I. E. Shparlinski, ‘Pseudoprime reductions of elliptic curves’, Preprint, 2007.[2] A. C. Cojocaru, F. Luca and I. E. Shparlinski, ‘Pseudoprime reductions of elliptic curves’, Preprint, 2007.

3.

[3] P. Corvaja and U. Zannier, ‘Finiteness of integral values for the ratio of two linear recurrences’, Invent. Math. 149 (2002), no. 2, 431–451.[3] P. Corvaja and U. Zannier, ‘Finiteness of integral values for the ratio of two linear recurrences’, Invent. Math. 149 (2002), no. 2, 431–451.

4.

[4] G. Everest, A. van der Poorten, I. E. Shparlinski and T. Ward, Recurrence sequences, Mathematical Surveys and Monographs, 104, American Mathematical Society, Providence, RI, 2003.[4] G. Everest, A. van der Poorten, I. E. Shparlinski and T. Ward, Recurrence sequences, Mathematical Surveys and Monographs, 104, American Mathematical Society, Providence, RI, 2003.

5.

[5] H. Halberstam and H.-E. Richert, Sieve methods, Academic Press, London, 1974.[5] H. Halberstam and H.-E. Richert, Sieve methods, Academic Press, London, 1974.

6.

[6] F. Luca and I. E. Shparlinski, ‘On the exponent of the group of points on elliptic curves in extension fields’, Int. Math. Res. Not. 2005, no. 23, 1391–1409.[6] F. Luca and I. E. Shparlinski, ‘On the exponent of the group of points on elliptic curves in extension fields’, Int. Math. Res. Not. 2005, no. 23, 1391–1409.

7.

[7] F. Luca and I. E. Shparlinski, ‘Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function’, Indag. Math. 17 (2006), 611–625.[7] F. Luca and I. E. Shparlinski, ‘Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function’, Indag. Math. 17 (2006), 611–625.

8.

[8] F. Luca and I. E. Shparlinski, ‘Pseudoprime Cullen and Woodall numbers’, Colloq. Math. 107 (2007), 35–43.[8] F. Luca and I. E. Shparlinski, ‘Pseudoprime Cullen and Woodall numbers’, Colloq. Math. 107 (2007), 35–43.

9.

[9] A. J. van der Poorten and A. Rotkiewicz, ‘On strong pseudoprimes in arithmetic progressions’, J. Austral. Math. Soc. Ser. A 29 (1980), no. 3, 316–321.[9] A. J. van der Poorten and A. Rotkiewicz, ‘On strong pseudoprimes in arithmetic progressions’, J. Austral. Math. Soc. Ser. A 29 (1980), no. 3, 316–321.

10.

[10] H. P. Schlickewei and W. M. Schmidt, ‘The number of solutions of polynomial-exponential equations’, Compositio Math. 120 (2000), no. 2, 193–225.[10] H. P. Schlickewei and W. M. Schmidt, ‘The number of solutions of polynomial-exponential equations’, Compositio Math. 120 (2000), no. 2, 193–225.

11.

[11] I. E. Shparlinski, ‘The number of different prime divisors of recurrence sequences’, Matem. Zametki 42 (1987), 494–507 (in Russian).[11] I. E. Shparlinski, ‘The number of different prime divisors of recurrence sequences’, Matem. Zametki 42 (1987), 494–507 (in Russian).

12.

[12] A. I. Vinogradov, ‘On the remainder in Mertens’s formula,’ Dokl. Akad. Nauk SSSR 148 (1963), 262–263 (in Russian).[12] A. I. Vinogradov, ‘On the remainder in Mertens’s formula,’ Dokl. Akad. Nauk SSSR 148 (1963), 262–263 (in Russian).
Copyright © 2007 Research Institute of Science and Technology (RISAT)
Florian Luca and Igor E. Shparlinski "PSEUDOPRIMES IN CERTAIN LINEAR RECURRENCES," Albanian Journal of Mathematics 1(3), 125-131, (2007). https://doi.org/10.51286/albjm/1189355988
Received: 13 June 2007; Published: 2007
Vol.1 • No. 3 • 2007
Back to Top