Displaying 121 – 140 of 375

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...

On integers not of the form n - φ (n)

J. Browkin, A. Schinzel (1995)

Colloquium Mathematicae

W. Sierpiński asked in 1959 (see [4], pp. 200-201, cf. [2]) whether there exist infinitely many positive integers not of the form n - φ(n), where φ is the Euler function. We answer this question in the affirmative by proving Theorem. None of the numbers 2 k · 509203 (k = 1, 2,...) is of the form n - φ(n).

On iteration digraph and zero-divisor graph of the ring n

Tengxia Ju, Meiyun Wu (2014)

Czechoslovak Mathematical Journal

In the first part, we assign to each positive integer n a digraph Γ ( n , 5 ) , whose set of vertices consists of elements of the ring n = { 0 , 1 , , n - 1 } with the addition and the multiplication operations modulo n , and for which there is a directed edge from a to b if and only if a 5 b ( mod n ) . Associated with Γ ( n , 5 ) are two disjoint subdigraphs: Γ 1 ( n , 5 ) and Γ 2 ( n , 5 ) whose union is Γ ( n , 5 ) . The vertices of Γ 1 ( n , 5 ) are coprime to n , and the vertices of Γ 2 ( n , 5 ) are not coprime to n . In this part, we study the structure of Γ ( n , 5 ) in detail. In the second part, we investigate the zero-divisor...

Currently displaying 121 – 140 of 375