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

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

Displaying similar documents to “Decomposition of an integer as a sum of two cubes to a fixed modulus”

Two exponential diophantine equations

Dominik J. Leitner (2011)

Journal de Théorie des Nombres de Bordeaux

Similarity:

The equation 3 a + 5 b - 7 c = 1 , to be solved in non-negative rational integers a , b , c , has been mentioned by Masser as an example for which there is still no algorithm to solve completely. Despite this, we find here all the solutions. The equation y 2 = 3 a + 2 b + 1 , to be solved in non-negative rational integers a , b and a rational integer y , has been mentioned by Corvaja and Zannier as an example for which the number of solutions is not yet known even to be finite. But we find here all the solutions too; there are in fact...

Lagrange’s Four-Square Theorem

Yasushige Watase (2014)

Formalized Mathematics

Similarity:

This article provides a formalized proof of the so-called “the four-square theorem”, namely any natural number can be expressed by a sum of four squares, which was proved by Lagrange in 1770. An informal proof of the theorem can be found in the number theory literature, e.g. in [14], [1] or [23]. This theorem is item #19 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/.

A note on a conjecture of Jeśmanowicz

Moujie Deng, G. Cohen (2000)

Colloquium Mathematicae

Similarity:

Let a, b, c be relatively prime positive integers such that a 2 + b 2 = c 2 . Jeśmanowicz conjectured in 1956 that for any given positive integer n the only solution of ( a n ) x + ( b n ) y = ( c n ) z in positive integers is x=y=z=2. If n=1, then, equivalently, the equation ( u 2 - v 2 ) x + ( 2 u v ) y = ( u 2 + v 2 ) z , for integers u>v>0, has only the solution x=y=z=2. We prove that this is the case when one of u, v has no prime factor of the form 4l+1 and certain congruence and inequality conditions on u, v are satisfied.

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

J. Browkin, A. Schinzel (1995)

Colloquium Mathematicae

Similarity:

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