Throughout this paper, we use the following notations: we denote by Z (resp. N) the set of integers (resp. positive integers) and we write l 1 =log N, l 2 =log log N, l 3 =log log log N and e(:)=e 2i?: . If f(n)=O(g(n)), then we write f (n)< <g(n). We denote by |(n) the number of distinct prime fact
β¦ LIBER β¦
On the positive sum property and the computation of Graver test sets
β Scribed by Raymond Hemmecke
- Publisher
- Springer-Verlag
- Year
- 2003
- Tongue
- English
- Weight
- 244 KB
- Volume
- 96
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the Arithmetic Structure of Sets Char
β
Christian Mauduit; AndrΓ s SΓ‘rkΓΆzy
π
Article
π
1996
π
Elsevier Science
π
English
β 577 KB
On the computation of stable sets and st
β
Mathijs Jansen; Dries Vermeulen
π
Article
π
2001
π
Springer
π
English
β 147 KB
Computational procedures and properties
β
A Marzollo; A Pascoletti
π
Article
π
1976
π
Elsevier Science
π
English
β 687 KB
On a Theorem of PlΓΌnnecke Concerning the
β
J.L. Malouf
π
Article
π
1995
π
Elsevier Science
π
English
β 342 KB
On character sums and the exceptional se
β
M.Z. Garaev; A.A. Karatsuba
π
Article
π
2005
π
Elsevier Science
π
English
β 184 KB
We prove an estimate of character sums. This bound and the method of solving multiplicative ternary problems are used to obtain new results about the cardinality of an exceptional set of a congruence problem modulo a prime p. In particular, we show that "almost all" residue classes modulo p are repr
Boundedness on a set of positive measure
β
M. A. McKiernan
π
Article
π
1968
π
Springer
π
English
β 106 KB