Skip to main content
Log in

On a problem of D.H. Lehmer and pseudorandom binary sequences

  • Published:
Bulletin of the Brazilian Mathematical Society, New Series Aims and scope Submit manuscript

Abstract

Let p be an odd prime, and f(x), g(x) ∈ \( \mathbb{F}_p \)[x]. Define

$$ e'_n = \left\{ \begin{gathered} + 1,if\overline {f(n)} \equiv R_p (g(n))(\bmod 2), \hfill \\ - 1,if\overline {f(n)} \not \equiv R_p (g(n))(\bmod 2), \hfill \\ \end{gathered} \right. $$

where \( \bar x \) is the inverse of x modulo p with \( \bar x \) ∈ {1, ..., p − 1}, and R p (x) denotes the unique r ∈ {0, 1, ..., p − 1} with xr(mod p). This paper shows that the sequences {e n } is a “good” pseudorandom binary sequences, and give a generalization on a problem of D.H. Lehmer.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. Alkan, F. Stan and A. Zaharescu. Lehmer k-tuples. Proceedings of the American Mathematical Society, 134 (2006), 2807–2815.

    Article  MATH  MathSciNet  Google Scholar 

  2. N. Alon, Y. Kohayakawa, C. Mauduit, C.G. Moreira and V. Rödl. Measures of pseudorandomness for finite sequences: minimal values. Combinatorics, Probability and Computing, 15 (2006), 1–29.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Alon, Y. Kohayakawa, C. Mauduit, C.G. Moreira and V. Rödl. Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, 95 (2007), 778–812.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Cassaigne, S. Ferenczi, C. Mauduit, J. Rivat and A. Sárközy. On finite pseudorandom binary sequences III: the Liouville function. I. Acta Arithmetica, 87 (1999), 367–390.

    MATH  Google Scholar 

  5. J. Cassaigne, S. Ferenczi, C. Mauduit, J. Rivat and A. Sárközy. On finite pseudorandom binary sequencs IV: the Liouville function. II. Acta Arithmetica, 95(2000), 343–359.

    MATH  Google Scholar 

  6. J. Cassaigne, C. Mauduit and A. Sárközy. On finite pseudorandom binary sequences VII: the measures of pseudorandomness. Acta Arithmetica, 103 (2002), 97–108.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Cobeli and A. Zaharescu. Generalization of a problem of Lehmer. Manuscripta Mathematica, 104 (2001), 301–307.

    Article  MATH  MathSciNet  Google Scholar 

  8. E. Fouvry, P. Michel, J. Rivat and A. Sárközy. On the pseudorandomness of the signs of Kloosterman sums. Journal of the Australian Mathematical Society, 77 (2004), 425–436.

    Article  MATH  MathSciNet  Google Scholar 

  9. L. Goubin, C. Mauduit and A. Särközy. Construction of large families of pseudorandom binary sequences. Journal of Number Theory, 106 (2004), 56–69.

    Article  MATH  MathSciNet  Google Scholar 

  10. R.K. Guy. Unsolved problems in number theory. Springer-Verlag, New York, (1981), 139–140.

    MATH  Google Scholar 

  11. K. Gyarmati. On a family of pseudorandom binary sequences. Periodica Mathematica Hungarica, 49 (2004), 45–63.

    Article  MATH  MathSciNet  Google Scholar 

  12. H. Liu. New pseudorandom sequences constructed by multiplicative inverse. Acta Arithmetica, 125 (2006), 11–19.

    Article  MATH  MathSciNet  Google Scholar 

  13. H. Liu. New pseudorandom sequences constructed by quadratic residues and Lehmer numbers. Proceedings of the American Mathematical Society, 135(2007), 1309–1318.

    Article  MATH  MathSciNet  Google Scholar 

  14. H. Liu. A family of pseudorandom binary sequences constructed by the multiplicative inverse. Acta Arithmetica, 130 (2007), 167–180.

    Article  MATH  MathSciNet  Google Scholar 

  15. S.R. Louboutin, J. Rivat and A. Sárközy. On a problem of D.H. Lehmer. Proceedings of the American Mathematical Society, 135 (2007), 969–975.

    Article  MATH  MathSciNet  Google Scholar 

  16. C. Mauduit, J. Rivat and A. Sárközy. Construction of pseudorandom binary sequences using additive characters. Monatshefte für Mathematik, 141 (2004), 197–208.

    Article  MATH  Google Scholar 

  17. C. Mauduit and A. Sárközy. On finite pseudorandom binary sequences I: measure of pseudorandomness, the Legendre symbol. Acta Arithmetica, 82 (1997), 365–377.

    MATH  MathSciNet  Google Scholar 

  18. C. Mauduit and A. Sárközy. On the measures of pseudorandomness of binary sequences. Discrete Mathematics, 271 (2003), 195–207.

    Article  MATH  MathSciNet  Google Scholar 

  19. C. Mauduit and A. Sárközy. Construction of pseudorandom binary sequences by using the multiplicative inverse. Acta Mathematica Hungarica, 108 (2005), 239–252.

    Article  MATH  MathSciNet  Google Scholar 

  20. C.J. Moreno and O. Moreno. Exponential sums and Goppa codes: I. Proceedings of the American Mathematical Society, 111 (1991), 523–531.

    Article  MATH  MathSciNet  Google Scholar 

  21. A. Sárközy. A finite pseudorandom binary sequence. Studia Scientiarum Mathematicarum Hungarica, 38 (2001), 377–384.

    Article  MATH  MathSciNet  Google Scholar 

  22. W. Zhang. A problem of D.H. Lehmer and its Generalization (I). Compositio Mathematica, 86 (1993), 307–316.

    MATH  MathSciNet  Google Scholar 

  23. W. Zhang. A problem of D.H. Lehmer and its Generalization (II). Compositio Mathematica, 91 (1994), 47–56.

    MATH  MathSciNet  Google Scholar 

  24. W. Zhang. On the difference between a D.H. Lehmer number and its inverse modulo q. Acta Arithmetica, 68 (1994), 255–263.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huaning Liu.

Additional information

Supported by the National Natural Science Foundation of China under Grant No. 60472068 and No. 10671155; Natural Science Foundation of Shaanxi province of China under Grant No. 2006A04; and the Natural Science Foundation of the Education Department of Shaanxi Province of China under Grant No. 06JK168.

About this article

Cite this article

Liu, H., Yang, C. On a problem of D.H. Lehmer and pseudorandom binary sequences. Bull Braz Math Soc, New Series 39, 387–399 (2008). https://doi.org/10.1007/s00574-008-0012-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00574-008-0012-6

Keywords

Mathematical subject classification

Navigation