Displaying 901 – 920 of 1815

Showing per page

On fundamental solutions of binary quadratic form equations

Keith R. Matthews, John P. Robertson, Anitha Srinivasan (2015)

Acta Arithmetica

We show that, with suitable modification, the upper bound estimates of Stolt for the fundamental integer solutions of the Diophantine equation Au²+Buv+Cv²=N, where A>0, N≠0 and B²-4AC is positive and nonsquare, in fact characterize the fundamental solutions. As a corollary, we get a corresponding result for the equation u²-dv²=N, where d is positive and nonsquare, in which case the upper bound estimates were obtained by Nagell and Chebyshev.

On Gelfond’s conjecture about the sum of digits of prime numbers

Joël Rivat (2009)

Journal de Théorie des Nombres de Bordeaux

The goal of this paper is to outline the proof of a conjecture of Gelfond [6] (1968) in a recent work in collaboration with Christian Mauduit [11] concerning the sum of digits of prime numbers, reflecting the lecture given in Edinburgh at the Journées Arithmétiques 2007.

On Grosswald's conjecture on primitive roots

Stephen D. Cohen, Tomás Oliveira e Silva, Tim Trudgian (2016)

Acta Arithmetica

Grosswald’s conjecture is that g(p), the least primitive root modulo p, satisfies g(p) ≤ √p - 2 for all p > 409. We make progress towards this conjecture by proving that g(p) ≤ √p -2 for all 409 < p < 2 . 5 × 10 15 and for all p > 3 . 38 × 10 71 .

On Hong’s conjecture for power LCM matrices

Wei Cao (2007)

Czechoslovak Mathematical Journal

A set 𝒮 = { x 1 , ... , x n } of n distinct positive integers is said to be gcd-closed if ( x i , x j ) 𝒮 for all 1 i , j n . Shaofang Hong conjectured in 2002 that for a given positive integer t there is a positive integer k ( t ) depending only on t , such that if n k ( t ) , then the power LCM matrix ( [ x i , x j ] t ) defined on any gcd-closed set 𝒮 = { x 1 , ... , x n } is nonsingular, but for n k ( t ) + 1 , there exists a gcd-closed set 𝒮 = { x 1 , ... , x n } such that the power LCM matrix ( [ x i , x j ] t ) on 𝒮 is singular. In 1996, Hong proved k ( 1 ) = 7 and noted k ( t ) 7 for all t 2 . This paper develops Hong’s method and provides a new idea to calculate...

Currently displaying 901 – 920 of 1815