Displaying 81 – 100 of 148

Showing per page

The Mordell-Weil bases for the elliptic curve y 2 = x 3 - m 2 x + m 2

Sudhansu Sekhar Rout, Abhishek Juyal (2021)

Czechoslovak Mathematical Journal

Let D m be an elliptic curve over of the form y 2 = x 3 - m 2 x + m 2 , where m is an integer. In this paper we prove that the two points P - 1 = ( - m , m ) and P 0 = ( 0 , m ) on D m can be extended to a basis for D m ( ) under certain conditions described explicitly.

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.

The p -part of Tate-Shafarevich groups of elliptic curves can be arbitrarily large

Remke Kloosterman (2005)

Journal de Théorie des Nombres de Bordeaux

In this paper we show that for every prime p 5 the dimension of the p -torsion in the Tate-Shafarevich group of E / K can be arbitrarily large, where E is an elliptic curve defined over a number field K , with [ K : ] bounded by a constant depending only on p . From this we deduce that the dimension of the p -torsion in the Tate-Shafarevich group of A / can be arbitrarily large, where A is an abelian variety, with dim A bounded by a constant depending only on p .

The postage stamp problem and arithmetic in base r

Amitabha Tripathi (2008)

Czechoslovak Mathematical Journal

Let h , k be fixed positive integers, and let A be any set of positive integers. Let h A : = { a 1 + a 2 + + a r : a i A , r h } denote the set of all integers representable as a sum of no more than h elements of A , and let n ( h , A ) denote the largest integer n such that { 1 , 2 , ... , n } h A . Let n ( h , k ) : = max A : n ( h , A ) , where the maximum is taken over all sets A with k elements. We determine n ( h , A ) when the elements of A are in geometric progression. In particular, this results in the evaluation of n ( h , 2 ) and yields surprisingly sharp lower bounds for n ( h , k ) , particularly for k = 3 .

Currently displaying 81 – 100 of 148