All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 12

Displaying 221 – 239 of 239

Showing per page

The number of solutions to the generalized Pillai equation ± r a x ± s b y = c .

Reese Scott, Robert Styer (2013)

Journal de Théorie des Nombres de Bordeaux

We consider N , the number of solutions ( x , y , u , v ) to the equation ( - 1 ) u r a x + ( - 1 ) v s b y = c in nonnegative integers x , y and integers u , v ∈ { 0 , 1 } , for given integers a > 1 , b > 1 , c > 0 , r > 0 and s > 0 . When gcd ( r a , s b ) = 1 , we show that N ≤ 3 except for a finite number of cases all of which satisfy max ( a , b , r , s , x , y ) < 2 · 10 15 for each solution; when gcd ( a , b ) > 1 , we show that N ≤ 3 except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving N = 3 solutions.

Two exponential diophantine equations

Dominik J. Leitner (2011)

Journal de Théorie des Nombres de Bordeaux

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

Currently displaying 221 – 239 of 239

Previous Page 12