The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the ternary Goldbach problem with primes in arithmetic progressions having a common modulus”

Approximation of values of hypergeometric functions by restricted rationals

Carsten Elsner, Takao Komatsu, Iekata Shiokawa (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We compute upper and lower bounds for the approximation of hyperbolic functions at points 1 / s ( s = 1 , 2 , ⋯ ) by rationals x / y , such that x , y satisfy a quadratic equation. For instance, all positive integers x , y with y ≡ 0 ( mod 2 ) solving the Pythagorean equation x 2 + y 2 = z 2 satisfy | y sinh ( 1 / s ) - x | ≫ log log y log y . Conversely, for every s = 1 , 2 , ⋯ there are infinitely many coprime integers x , y , such that | y sinh ( 1 / s ) - x | ≪ log log y log y and x 2 + y 2 = z 2 hold simultaneously for some integer z . A generalization to the approximation of h ( e 1 / s ) for rational...

On the counting function for the generalized Niven numbers

Ryan Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño (2009)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Given an integer base q ≥ 2 and a completely q -additive arithmetic function f taking integer values, we deduce an asymptotic expression for the counting function N f ( x ) = # 0 ≤ n < x | f ( n ) ∣ n under a mild restriction on the values of f . When f = s q , the base q sum of digits function, the integers counted by N f are the so-called base q Niven numbers, and our result provides a generalization of the asymptotic known in that case.

A constant in pluripotential theory

Zbigniew Błocki (1992)

Annales Polonici Mathematici

Similarity:

We compute the constant sup ( 1 / d e g P ) ( m a x S l o g | P | - ∫ S l o g | P | d σ ) : P a polynomial in ℂ n , where S denotes the euclidean unit sphere in ℂ n and σ its unitary surface measure.

Landau’s function for one million billions

Marc Deléglise, Jean-Louis Nicolas, Paul Zimmermann (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let 𝔖 n denote the symmetric group with n letters, and g ( n ) the maximal order of an element of 𝔖 n . If the standard factorization of M into primes is M = q 1 α 1 q 2 α 2 ... q k α k , we define ℓ ( M ) to be q 1 α 1 + q 2 α 2 + ... + q k α k ; one century ago, E. Landau proved that g ( n ) = max ℓ ( M ) ≤ n M and that, when n goes to infinity, log g ( n ) ∼ n log ( n ) . There exists a basic algorithm to compute g ( n ) for 1 ≤ n ≤ N ; its running time is 𝒪 N 3 / 2 / log N and the needed memory is 𝒪 ( N ) ; it allows computing g ( n ) up to, say, one million. We describe an algorithm to calculate g ( n ) for n up to 10 15 . The main idea is to use the...