• Publications
  • Influence
On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol by Christian Mauduit (Marseille) and András Sárközy (Budapest) 1. Introduction. In the last 60 yearsExpand
  • 219
  • 13
  • PDF
Unsolved problems in number theory
  • A. Sárközy
  • Mathematics, Computer Science
  • Period. Math. Hung.
  • 1 February 2001
TLDR
68 unsolved problems and conjectures in number theory are presented and brie y discussed. Expand
  • 401
  • 13
On difference sets of sequences of integers. III
  • 112
  • 11
On finite pseudorandom binary sequences VII: The measures of pseudorandomness
where the maximum is taken over all D = (d1, . . . , dk) and M such that M + dk ≤ N . 2000 Mathematics Subject Classification: Primary 11K45.
  • 115
  • 9
A complexity measure for families of binary sequences
TLDR
It is shown that the family of “good” pseudorandom binary sequences constructed earlier is also of high f-complexity. Expand
  • 40
  • 9
  • PDF
Construction of large families of pseudorandom binary sequences
Abstract In a series of papers Mauduit and Sarkozy (partly with coauthors) studied finite pseudorandom binary sequences. They showed that the Legendre symbol forms a “good” pseudorandom sequence, andExpand
  • 71
  • 6
  • PDF
On the Distribution in Residue Classes of Integers with a Fixed Sum of Digits
We give an asymptotic formula for the distribution of those integers n in a residue class, such that n has a fixed sum of base-g digits, with some uniformity over the choice of the modulus and g. WeExpand
  • 18
  • 6
  • PDF
On the number of prime factors of integers of the form ab + 1
If the sets A and B are dense sets of integers then estimates (1.1) and (1.2) may be strengthened. Let and δ be positive real numbers and let N The research of the first two authors was partiallyExpand
  • 31
  • 5
  • PDF
...
1
2
3
4
5
...