Displaying 941 – 960 of 1340

Showing per page

The terms of the form 7kx² in the generalized Lucas sequence with parameters P and Q

Olcay Karaatlı (2016)

Acta Arithmetica

Let Vₙ(P,Q) denote the generalized Lucas sequence with parameters P and Q. For all odd relatively prime values of P and Q such that P² + 4Q > 0, we determine all indices n such that Vₙ(P,Q) = 7kx² when k|P. As an application, we determine all indices n such that the equation Vₙ = 21x² has solutions.

The ternary Goldbach problem.

David Rodney (Roger) Heath-Brown (1985)

Revista Matemática Iberoamericana

The object of this paper is to present new proofs of the classical ternary theorems of additive prime number theory. Of these the best known is Vinogradov's result on the representation of odd numbers as the sums of three primes; other results will be discussed later. Earlier treatments of these problems used the Hardy-Littlewood circle method, and are highly analytical. In contrast, the method we use here is a (technically) elementary deduction from the Siegel-Walfisz Prime Number Theory. It uses...

The ternary Goldbach problem in arithmetic progressions

Jianya Liu, Tao Zhan (1997)

Acta Arithmetica

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.

Currently displaying 941 – 960 of 1340