Displaying 921 – 940 of 1120

Showing per page

The spt-crank for overpartitions

Frank G. Garvan, Chris Jennings-Shaffer (2014)

Acta Arithmetica

Bringmann, Lovejoy, and Osburn (2009, 2010) showed that the generating functions of the spt-overpartition functions s p t ¯ ( n ) , s p t ¯ 1 ( n ) , s p t ¯ 2 ( n ) , and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews, Garvan, and Liang (2012) defined an spt-crank in terms of weighted vector partitions which combinatorially explain simple congruences modulo 5 and 7 for spt(n). Chen, Ji, and Zang (2013) were able to define this spt-crank in terms of ordinary partitions. In this...

The sum of divisors of a quadratic form

Lilu Zhao (2014)

Acta Arithmetica

We study the sum τ of divisors of the quadratic form m₁² + m₂² + m₃². Let S ( X ) = 1 m , m , m X τ ( m ² + m ² + m ² ) . We obtain the asymptotic formula S₃(X) = C₁X³logX + C₂X³ + O(X²log⁷X), where C₁,C₂ are two constants. This improves upon the error term O ε ( X 8 / 3 + ε ) obtained by Guo and Zhai (2012).

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.

The value of additive forms at prime arguments

Roger J. Cook (2001)

Journal de théorie des nombres de Bordeaux

Let f ( 𝐩 ) be an additive form of degree k with s prime variables p 1 , p 2 , , p s . Suppose that f has real coefficients λ i with at least one ratio λ i / λ j algebraic and irrational. If s is large enough then f takes values close to almost all members of any well-spaced sequence. This complements earlier work of Brüdern, Cook and Perelli (linear forms) and Cook and Fox (quadratic forms). The result is based on Hua’s Lemma and, for k 6 , Heath-Brown’s improvement on Hua’s Lemma.

Currently displaying 921 – 940 of 1120