ALMOST ALL PRIMES HAVE A MULTIPLE OF SMALL HAMMING WEIGHT

CHRISTIAN ELSHOLTZ*

*Korrespondierende/r Autor/in für diese Arbeit

Publikation: Beitrag in einer FachzeitschriftArtikel

Abstract

We improve recent results of Bourgain and Shparlinski to show that, for almost all primes (Formula presented.), there is a multiple (Formula presented.) that can be written in binary as (Formula presented.) with (Formula presented.) (corresponding to Hamming weight seven). We also prove that there are infinitely many primes (Formula presented.) with a multiplicative subgroup (Formula presented.), for some (Formula presented.), of size (Formula presented.), where the sum–product set (Formula presented.) does not cover (Formula presented.) completely.

Originalspracheenglisch
Seiten (von - bis)224-235
Seitenumfang12
FachzeitschriftBulletin of the Australian Mathematical Society
Jahrgang94
Ausgabenummer2
DOIs
PublikationsstatusVeröffentlicht - 23 Mai 2016

ASJC Scopus subject areas

  • !!Mathematics(all)

Fields of Expertise

  • Information, Communication & Computing

Fingerprint Untersuchen Sie die Forschungsthemen von „ALMOST ALL PRIMES HAVE A MULTIPLE OF SMALL HAMMING WEIGHT“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren