On the pseudo-randomness of subsets related to primitive roots

DOI10.1007/s00493-010-2534-yzbMath1259.11072MaRDI QIDQ1945263

András Sárközy, Cécile Dartyge, Mihály Szalay

Publication date: 5 April 2013

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-010-2534-y

zbMATH Keywords

primitive roots; pseudo-random; index properties

Mathematics Subject Classification ID

11A07: Congruences; primitive roots; residue systems

11L40: Estimates on character sums

11K45: Pseudo-random numbers; Monte Carlo methods

Related Items

On the complexity of families of pseudo-random subsets, On multi-dimensional pseudorandom subsets

Cites Work

• Unnamed Item
• Unnamed Item
• On large families of subsets of the set of the integers not exceeding \(N\)
• On pseudo-random subsets of \({\mathbb{Z}}_n\)
• On the distribution of the primitive roots of a prime
• Equations over finite fields. An elementary approach
• Additive patterns in a multiplicative group in a finite field
• On a pseudorandom property of binary sequences
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• A note on the distribution of the primitive roots of a prime
• On a family of pseudorandom binary sequences
• Character sums and primitive roots in finite fields
• On Character Sums and Primitive Roots^†
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On the distribution of primitive roots mod p
• A finite pseudorandom binary sequence
• Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
• Pairs of Consecutive Primitive Roots Modulo a Prime
• Primitive roots modulo a prime as consecutive terms of an arithmetic progression.
• On the distribution of powers in finite fields.
• Construction of large families of pseudorandom binary sequences