497 research outputs found
Almost all primes have a multiple of small Hamming weight
Recent results of Bourgain and Shparlinski imply that for almost all primes
there is a multiple that can be written in binary as with or ,
respectively. We show that (corresponding to Hamming weight )
suffices.
We also prove there are infinitely many primes with a multiplicative
subgroup , for some
, of size , where the sum-product set
does not cover completely
On Some Dynamical Systems in Finite Fields and Residue Rings
We use character sums to confirm several recent conjectures of V. I. Arnold
on the uniformity of distribution properties of a certain dynamical system in a
finite field. On the other hand, we show that some conjectures are wrong. We
also analyze several other conjectures of V. I. Arnold related to the orbit
length of similar dynamical systems in residue rings and outline possible ways
to prove them. We also show that some of them require further tuning
- β¦