Displaying similar documents to “Primitive substitutive numbers are closed under rational multiplication”

The Josephus problem

Lorenz Halbeisen, Norbert Hungerbühler (1997)

Journal de théorie des nombres de Bordeaux

Similarity:

We give explicit non-recursive formulas to compute the Josephus-numbers j ( n , 2 , i ) and j ( n , 3 , i ) and explicit upper and lower bounds for j ( n , k , i ) (where k ≥ 4 ) which differ by 2 k - 2 (for k = 4 the bounds are even better). Furthermore we present a new fast algorithm to calculate j ( n , k , i ) which is based upon the mentioned bounds.

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 ∈ ℕ ³ : 1 ≤ b j ≤ r , ( b j , r ) = 1 a n d b ₁ + b ₂ + b ₃ ≡ N ( m o d r ) . It is known that    ( N , r ) = r ² ∏ p | r p | N ( ( p - 1 ) ( p - 2 ) / p ² ) ∏ 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 ≡ b j ( m o d r ) , j = 1,2,3, ⎩ with prime variables is solvable whenever b ∈ (N,r), where A > 0 is arbitrary.

Two problems related to the non-vanishing of L ( 1 , χ )

Paolo Codecà, Roberto Dvornicich, Umberto Zannier (1998)

Journal de théorie des nombres de Bordeaux

Similarity:

We study two rather different problems, one arising from Diophantine geometry and one arising from Fourier analysis, which lead to very similar questions, namely to the study of the ranks of matrices with entries either zero or ( ( x y / q ) ) , ( 0 ≤ x , y < q ) , where ( ( u ) ) = u - [ u ] - 1 / 2 denotes the “centered” fractional part of x . These ranks, in turn, are closely connected with the non-vanishing of the Dirichlet L -functions at s = 1 .