Upper bounds for k-th coset representatives modulo n

Karl Norton

Displaying similar documents to “Upper bounds for k-th coset representatives modulo n”

On distribution of values of multiplicative functions in residue classes

W. Narkiewicz (1967)

Acta Arithmetica

Similarity:

The divisor function $d_{3} (n)$ in arithmetic progressions

D. Heath-Brown (1986)

Acta Arithmetica

Similarity:

L-functions and character sums for quadratic forms (I)

H Stark (1968)

Acta Arithmetica

Similarity:

The cyclotomic numbers of order fourteen

Joseph Muskat (1966)

Acta Arithmetica

Similarity:

The cyclotomic numbers of order twenty

Joseph Muskat, A. Whiteman (1970)

Acta Arithmetica

Similarity:

On the units of cyclotomic fields

K. Ramachandra (1966)

Acta Arithmetica

Similarity:

The ternary Goldbach problem in arithmetic progressions

Jianya Liu, Tao Zhan (1997)

Acta Arithmetica

Similarity:

For a large odd integer N and a positive integer r, define b = (b₁,b₂,b₃) and $(N, r) = b \in ℕ ³ : 1 \leq b_{j} \leq r, (b_{j}, r) = 1 a n d b ₁ + b ₂ + b ₃ \equiv N (m o d r) .$ It is known that $(N, r) = r ² \prod_{p | r} p | N ((p - 1) (p - 2) / p ²) \prod_{p | r} p ∤ N ((p ² - 3 p + 3) / p ²)$ . Let ε > 0 be arbitrary and $R = N^{1 / 8 - ε}$ . We prove that for all positive integers r ≤ R, with at most $O (R l o g^{- A} N)$ exceptions, the Diophantine equation ⎧N = p₁+p₂+p₃, ⎨ $p_{j} \equiv b_{j} (m o d r),$ j = 1,2,3,⎩ with prime variables is solvable whenever b ∈ (N,r), where A > 0 is arbitrary.

On the representation of the integer by positive quadratic forms with square-free variables

E. Podsypanin (1975)

Acta Arithmetica

Similarity:

On a generalization of the Lucas functions

H. Williams (1972)

Acta Arithmetica

Similarity: