# Lucas' square pyramid problem revisited

@article{Bennett2002LucasSP,
title={Lucas' square pyramid problem revisited},
author={Michael A. Bennett},
journal={Acta Arithmetica},
year={2002},
volume={105},
pages={341-347}
}
• M. Bennett
• Published 2002
• Mathematics
• Acta Arithmetica
are given by (s, t) = (1, 1) and (24, 70). Putative solutions by Moret-Blanc [30] and Lucas [25] contain fatal flaws (see e.g. [39] for details) and it was not until 1918 that Watson [39] was able to completely solve equation (1.1). His proof depends upon properties of elliptic functions of modulus 1/ √ 2 and arguably lacks the simplicity one might desire. A second, more algebraic proof was found in 1952 by Ljunggren [23], though it also is somewhat on the complicated side. Attempts to repair… Expand
Arithmetical properties of a sequence arising from an arctangent sum
• Mathematics
• 2008
Abstract The sequence { x n } defined by x n = ( n + x n − 1 ) / ( 1 − n x n − 1 ) , with x 1 = 1 , appeared in the context of some arctangent sums. We establish the fact that x n ≠ 0 for n ⩾ 4 andExpand
Diophantine equations with products of consecutive values of a quadratic polynomial
• Mathematics
• 2011
Abstract Let a, b, c, d be given nonnegative integers with a , d ⩾ 1 . Using Chebyshevʼs inequalities for the function π ( x ) and some results concerning arithmetic progressions of prime numbers, weExpand
Constructing congruent number elliptic curves using 2-descent
A positive integer that is the area of some rational right triangle is called a congruent number. In an algebraic point of view, being a congruent number means satisfying a system of equations. AsExpand
Congruent Numbers and Elliptic Curves
• J. Chahal
• Mathematics, Computer Science
• Am. Math. Mon.
• 2006
The reader is asked to prove that seven is a congruent number and to exhibit a rational right triangle with area seven, and among the six square-free natural numbers under ten, three (namely five, six, and seven) areCongruent numbers, while the remaining three are not. Expand
Elliptic curves and the density of θ-congruent numbers and concordant pairs in ratios
Abstract If k and l are coprime distinct integers, then we show that there exist infinitely many square-free integers n such that the system of two diophantine quadratic equations X 2 + k n Y 2 = Z 2Expand
Concordant numbers within arithmetic progressions and elliptic curves
If the system of two diophantine equations X2 + mY 2 = Z2 and X2 + nY 2 = W 2 has infinitely many integer solutions (X,Y,Z,W ) with gcd(X,Y ) = 1, equivalently, the elliptic curve Em,n : y2 = x(x +Expand
The ratio of \theta-congruent numbers
• Mathematics
• 2010
Let 0<\theta<\pi such that \cos\theta\in \Q. In this paper, we prove that for given positive square-free coprime integers k,l, there exist infinitely many pairs (M,N) of \theta-congruent numbers suchExpand
On a variant of a Diophantine equation of Cassels
• Mathematics
• 2011
Recently, Yuan and Li considered a variant y2 = px(Ax2− 2) of Cassels’ equation y2 = 3x(x2+2). They proved that the equation has at most five solutions in positive integers (x, y). In this note, weExpand
Congruent Numbers Via the Pell Equation and its Analogous Counterpart
The aim of this expository article is twofold. The first is to introduce several polynomials of one variable as well as two variables defined on the positive integers with values as congruentExpand
Congruent numbers and elliptic curves
Throughout this thesis we will be primarily concerned with the area of a rational right angle triangle, also known as a congruent number. The purpose of this thesis is to present a family ofExpand

#### References

SHOWING 1-10 OF 61 REFERENCES
The square pyramid puzzle
is x = 24 and y = 70. We begin this article by recalling the history of this Diophantine equation. We then present a new, elementary solution of it. In 1876 Moret-Blanc gave a "proof" of Lucas'sExpand
Some remarks on the Diophantine equation
HUGH MAXWELL EDGAR In order to avoid certain trivial solutions of the Diophantine equation x3+y3+z3 = x+y+z we initially assume x^y^O, z<0 and x¿¿ — z. All letters will indicate rational integersExpand
The square-free sieve and the rank of elliptic curves
• Mathematics
• 1991
Let E be an elliptic curve over Q. A celebrated theorem of Mordell asserts that E(Q), the (abelian) group of rational points of E, is finitely generated. By the rank of E we mean the rank of E(Q).Expand
ON THE DIOPHANTINE EQUATION x~4-Dy~2≡1(II)
For the Diophantine equation x~4 - Dy~2 = 1, (1) where DO and is not a perfect square, we prove the following theorems in this paper.Theorem 1. If D7 (mod 8), D= P_1p_2…P_3, s≥2, where p_i (i=1,…, s)Expand
Polynomial Bounds for the Solutions of a Class of Diophantine Equations
Abstract LetKbe an algebraic number field such that all the embeddings ofKinto C are real. We denote byOKthe ring of algebraic integers ofK. LetF(X, Y) be an irreducible polynomial inK[X, Y]−K[Y] ofExpand
The Diophantine equation $b^2X^4-dY^2=1$
• Mathematics
• 1997
If b and d are given positive integers with b > 1, then we show that the equation of the title possesses at most one solution in positive integers X, Y . Moreover, we give an explicitExpand
Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms
• Mathematics
• 1994
In order to compute all integer points on a Weierstras equation for an elliptic curve E/Q, one may translate the linear relation between rational points on E into a linear form of ellipticExpand
An Elementary Solution of Lucas′ Problem
By the method of infinite descent, Pell′s equation, and the quadratic reciprocity law, it is proved that the equation x(x + 1)(2x + 1) = 6y2 has the only nontrivial integer solution x = 24, y = 70.
Uniformity of stably integral points on elliptic curves
A common practice in arithmetic geometry is that of generalizing rational points on projective varieties to integral points on quasi-projective varieties. Following this practice, we demonstrate anExpand
JR 旅客販売総合システム（マルス）における運用及び管理について
A dictionary definition of divisible number: a number is divisible by a number so that every digit of that number isdivisible by 3. Expand