A256418 -id:A256418 - cp's OEIS frontend

A003273 Congruent numbers: positive integers k for which there exists a right triangle having area k and rational sides.

5, 6, 7, 13, 14, 15, 20, 21, 22, 23, 24, 28, 29, 30, 31, 34, 37, 38, 39, 41, 45, 46, 47, 52, 53, 54, 55, 56, 60, 61, 62, 63, 65, 69, 70, 71, 77, 78, 79, 80, 84, 85, 86, 87, 88, 92, 93, 94, 95, 96, 101, 102, 103, 109, 110, 111, 112, 116, 117, 118, 119, 120, 124, 125, 126

Offset: 1

N. J. A. Sloane

Positive integers k such that x^2 + k*y^2 = z^2 and x^2 - k*y^2 = t^2 have simultaneous integer solutions. In other words, k is the difference of an arithmetic progression of three rational squares: (t/y)^2, (x/y)^2, (z/y)^2. Values of k corresponding to y=1 (i.e., an arithmetic progression of three integer squares) form A256418.
Tunnell shows that if a number is squarefree and congruent, then the ratio of the number of solutions of a pair of equations is 2. If the Birch and Swinnerton-Dyer conjecture is assumed, then determining whether a squarefree number k is congruent requires counting the solutions to a pair of equations. For odd k, see A072068 and A072069; for even k see A072070 and A072071.
If a number k is congruent, there are an infinite number of right triangles having rational sides and area k. All congruent numbers can be obtained by multiplying a primitive congruent number A006991 by a positive square number A000290.
Conjectured asymptotics (based on random matrix theory) on p. 453 of Cohen's book. - Steven Finch, Apr 23 2009

			24 is congruent because 24 is the area of the right triangle with sides 6,8,10.
5 is congruent because 5 is the area of the right triangle with sides 3/2, 20/3, 41/6 (although not of any right triangle with integer sides -- see A073120). - _Jonathan Sondow_, Oct 04 2013

Alter, Ronald; Curtz, Thaddeus B.; Kubota, K. K. Remarks and results on congruent numbers. Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1972), pp. 27-35. Florida Atlantic Univ., Boca Raton, Fla., 1972. MR0349554 (50 #2047)
H. Cohen, Number Theory. I, Tools and Diophantine Equations, Springer-Verlag, 2007, p. 454. [From Steven Finch, Apr 23 2009]
R. Cuculière, "Mille ans de chasse aux nombres congruents", in Pour la Science (French edition of 'Scientific American'), No. 7, 1987, pp. 14-18.
L. E. Dickson, History of the Theory of Numbers, Vol. 2, pp. 459-472, AMS Chelsea Pub. Providence RI 1999.
R. K. Guy, Unsolved Problems in Number Theory, D27.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Congruent numbers up to 10000; table of n, a(n) for n = 1..5742
R. Alter, Letter to N. J. A. Sloane, Sep 1975
R. Alter, The congruent number problem, Amer. Math. Monthly, 87 (1980), 43-45.
R. Alter and T. B. Curtz, A note on congruent numbers, Math. Comp., 28 (1974), 303-305 and 30 (1976), 198.
A. Alvarado and E. H. Goins, Arithmetic progressions on conic sections, arXiv:1210.6612 [math.NT], 2012. [From _Jonathan Sondow_, Oct 25 2012]
Estelle Basor and Bill Hart, A trillion triangles, American Institute of Mathematics,
E. Brown, Three Fermat Trails to Elliptic Curves, 5. Congruent Numbers and Elliptic Curves (pp 8-11/17)
Graeme Brown, The Congruent Number Problem, 2014.
Jasbir S. Chahal, Some remarks on rational right triangles, Expos. Math. (2024).
B. Cipra, Tallying the class of congruent numbers, ScienceNOW, Sep 23 2009.
Clay Mathematics Institute, The Birch and Swinnerton-Dyer Conjecture
Raiza Corpuz, Constructing congruent number elliptic curves using 2-descent, arXiv:2006.08113 [math.NT], 2020.
R. Cuculière, Mille ans de chasse aux nombres congruents, Séminaire de Philosophie et Mathématiques, 2, 1988, p. 1-17.
Department of Pure Maths., Univ. Sheffield, Pythagorean triples and the congruent number problem [Cached copy]
A. Dujella, A. S.Janfeda, and S. Salami, A Search for High Rank Congruent Number Elliptic Curves, JIS 12 (2009) 09.5.8.
E. V. Eikenberg, The Congruent Number Problem
David Goldberg, Triangle Sides for Congruent Numbers less than 10000, arXiv:2106.07373 [math.NT], 2021.
Lorenz Halbeisen and Norbert Hungerbühler, Congruent number elliptic curves with rank at least two, arXiv:1809.02037 [math.NT], 2018.
Lorenz Halbeisen and Norbert Hungerbühler, Congruent Number Elliptic Curves Related to Integral Solutions of m^2 = n^2 + nl + n^2, J. Int. Seq., Vol. 22 (2019), Article 19.3.1.
Alvaro Lozano-Robledo, My #MegaFavNumber: 224,403,517,704,336,969,924,557,513,090,674,863,160,948,472,041, video (2020) [discusses congruent numbers and a(157)]
W. F. Hammond, A Reading of Karl Rubin's SUMO Slides on Rational Right Triangles and Elliptic Curves
Bill Hart, A Trillion Triangles, American Institute of Mathematics.
T. Komatsu, Congruent numbers and continued fractions, Fib. Quart., 50 (2012), 222-226. - From _N. J. A. Sloane_, Mar 04 2013
S. Komoto, T. Watanabe and H. Wada, 42553 is a congruent number.
G. Kramarz, All congruent numbers less than 2000, Math. Annalen, 273 (1986), 337-340.
G. Kramarz, All congruent numbers less than 2000, Math. Annalen, 273 (1986), 337-340. [Annotated, corrected, scanned copy]
Allan J. MacLeod, The congruent number descent of Komotu, Watanabe and Wada, arXiv:2005.02615 [math.NT], 2020.
MathDL, Five Mathematicians Capture Record Number of Congruent Numbers
Fidel Ronquillo Nemenzo, All congruent numbers less than 40000, Proc. Japan Acad. Ser. A Math. Sci., Volume 74, Number 1 (1998), 29-31.
Karl Rubin, Right triangles and elliptic curves
W. A. Stein, Introduction to the Congruent Number Problem
W. A. Stein, The Congruent Number Problem
Ye Tian, Congruent Numbers and Heegner Points, arXiv:1210.8231 [math.NT], 2012.
J. B. Tunnell, A classical Diophantine problem and modular forms of weight 3/2, Invent. Math., 72 (1983), 323-334.
D. J. Wright, The Congruent Number Problem

Cf. A006991, A072068, A072069, A072070, A072071, A073120, A165564, A182429, A256418, A259680-A259687.

(* The following Mathematica code assumes the truth of the Birch and Swinnerton-Dyer conjecture and uses the list of primitive congruent numbers produced by the Mathematica code in A006991: *)
For[cLst={}; i=1, i<=Length[lst], i++, n=lst[[i]]; j=1; While[n j^2<=maxN, cLst=Union[cLst, {n j^2}]; j++ ]]; cLst

Guy gives a table up to 1000.
Edited by T. D. Noe, Jun 14 2002
Comments revised by Max Alekseyev, Nov 15 2008
Comment corrected by Jonathan Sondow, Oct 10 2013

A009112 Areas of Pythagorean triangles: numbers which can be the area of a right triangle with integer sides.

Original entry on oeis.org

6, 24, 30, 54, 60, 84, 96, 120, 150, 180, 210, 216, 240, 270, 294, 330, 336, 384, 480, 486, 504, 540, 546, 600, 630, 720, 726, 750, 756, 840, 864, 924, 960, 990, 1014, 1080, 1176, 1224, 1320, 1344, 1350, 1386, 1470, 1500, 1536, 1560, 1620, 1710, 1716, 1734, 1890

Offset: 1

David W. Wilson

Number of terms < 10^k for increasing values of k: 1, 7, 34, 150, 636, 2536, 9757, 35987, 125350, 407538, ..., .
All terms are divisible by 6.
Also positive integers m with four (or more) different divisors (p, q, r, s) such that m = p*q = r*s and s = p+q+r. - Jose Aranda, Jun 28 2023

			30 belongs to the sequence as the area of the triangle (5,12,13) is 30.
6 is in the sequence because it is the area of the 3-4-5 triangle.

Robert Israel, Table of n, a(n) for n = 1..10000
Ron Knott, Pythagorean Triangles
B. Miller, Nasty Numbers, The Mathematics Teacher 73 (1980), page 649.
Supriya Mohanty and S. P. Mohanty, Pythagorean Numbers, Fibonacci Quarterly 28 (1990), 31-42.

Union of A009111, A009127, A024365, A177021.
A073120 is a subsequence.
See A256418 for the numbers 4*a(n).

N:= 10^4: # to get all entries <= N
A:= {}:
for t from 1 to floor(sqrt(2*N)) do
   F:= select(f -> f[2]::odd,ifactors(2*t)[2]);
   d:= mul(f[1],f=F);
   for e from ceil(sqrt(t/d)) do
     s:= d*e^2;
     r:= sqrt(2*t*s);
     a:= (r+s)*(r+t)/2;
     if a > N then break fi;
     A:= A union {a};
   od
od:
A;
# if using Maple 11 or earlier, uncomment the next line
# sort(convert(A,list)); # Robert Israel, Apr 06 2015

lst = {}; Do[ If[ IntegerQ[c = Sqrt[a^2 + b^2]], AppendTo[lst, a*b/2]; lst = Union@ lst], {a, 4, 180}, {b, a - 1, Floor[ Sqrt[a]], -1}]; Take[lst, 51] (* Vladimir Joseph Stephan Orlovsky, Nov 23 2010 *)
g@A_ := With[{div = Divisors@(2*A)}, AnyTrue[Sqrt@(Plus@@({#, 2*A/#}^2))& /@Take[div, Floor[(Length@div)/2]],IntegerQ]];
Select[Range@5000, g@# &] (* Hans Rudolf Widmer, Sep 25 2023 *)

is_A009112(n)={ my(N=1+#n=divisors(2*n)); for( i=1, N\2, issquare(n[i]^2+n[N-i]^2) & return(1)) } \\ M. F. Hasler, Dec 09 2010

is_A009112 = lambda n: any(is_square(a**2+(2*n/a)**2) for a in divisors(2*n)) # D. S. McNeil, Dec 09 2010

A024406 Ordered areas of primitive Pythagorean triangles.

Original entry on oeis.org

6, 30, 60, 84, 180, 210, 210, 330, 504, 546, 630, 840, 924, 990, 1224, 1320, 1386, 1560, 1710, 1716, 2310, 2340, 2574, 2730, 2730, 3036, 3570, 3900, 4080, 4290, 4620, 4914, 5016, 5610, 5814, 6090, 6630, 7140, 7440, 7854, 7956, 7980, 7980, 8970, 8976, 9690

Offset: 1

David W. Wilson

This sequence also gives Fibonacci's congruous numbers (or congrua) divided by 4 with multiplicities, not regarding leg exchange in the underlying primitive Pythagorean triangle. See A258150 and the example. - Wolfdieter Lang, Jun 14 2015

The squarefree part of an entry which is not squarefree is a primitive congruent number from A006991 belonging to a Pythagorean triangle with rational (not all integer) side lengths (and its companion obtained by exchanging the legs). See the W. Lang link. - Wolfdieter Lang, Oct 25 2016

			a(6) = a(7) = 210 corresponds to the area (in some squared length unit) of the primitive Pythagorean triangles (21, 20, 29) and (35, 12, 37). Fibonacci's congruum C = 840 = 210*4 belongs to the two triples [x, y, z] = [29, 41, 1] and [37, 47, 23], solving x^2 + C = y^2 and x^2 - C = z^2. - _Wolfdieter Lang_, Jun 14 2015
a(5) = 180 = 6^2*5 lead to the primitive congruent number A006991(1) = 5 from the primitive Pythagorean triangle [9, 40, 41] after division by 6: [3/2, 20/3, 41/6]. See the link for the other nonsquarefree a(n) numbers. - _Wolfdieter Lang_, Oct 25 2016

Giovanni Resta, Table of n, a(n) for n = 1..10000
Ron Knott, Pythagorean Triples and Online Calculators
Wolfdieter Lang, Non-squarefree entries, their congruent numbers and rational Pythagorean triangles
Eric Weisstein's World of Mathematics, Congruum Problem

Cf. A009112, A024365, A094182, A094183, A256418 (congrua), A258150.

a(n) = 6*A020885(n). - Lekraj Beedassy, Apr 30 2004

a(n) = A121728(n)*A121729(n)/2. - M. F. Hasler, Apr 16 2020

A057102 a(n) = 4 * A073120(n).

Original entry on oeis.org

24, 96, 120, 240, 336, 384, 480, 720, 840, 960, 1320, 1344, 1536, 1920, 1944, 2016, 2184, 2520, 2880, 3360, 3696, 3840, 3960, 4896, 5280, 5376, 5544, 6144, 6240, 6840, 6864, 7680, 7776, 8064, 8736, 9240, 9360, 9720, 10080, 10296, 10920, 11520, 12144

Offset: 1

Henry Bottomley, Aug 02 2000

This sequence was originally described as the list of "congrua". But that name more properly refers to A256418.

Numbers of the form 4*(x^3*y-x*y^3) (where x,y are integers and x>=y). Squares of these numbers are of the form N^4-K^2 (where N belongs to A135786 and K to A135789 or A135790). Proof uses identity: (4(x^3y-xy^3))^2=(x^2+y^2)^4-(x^4 - 6x^2 y^2 + y^4)^2. - Artur Jasinski, Nov 29 2007, Nov 14 2008

Cf. A073120, A256418.

N:= 10^5: # to get all terms <= N
select(`<=`,{seq(seq(4*(x^3*y-x*y^3),y=1..x-1),x=1..floor(sqrt(N/4+1)))},N);
# If using Maple 11 or earlier, uncomment the following line
# sort(convert(%, list)); # Robert Israel, Apr 06 2015

a = {}; Do[Do[w = 4x^3y - 4x y^3; If[w > 0 && w < 10000, AppendTo[a, w]], {x, y, 1000}], {y, 1, 1000}]; Union[a] (* Artur Jasinski, Nov 29 2007 *)

Edited by N. J. A. Sloane, Apr 06 2015 at the suggestion of Robert Israel, Apr 03 2015

A135789 Positive numbers of the form x^4 - 6 * x^2 * y^2 + y^4 (where x,y are integers).

Original entry on oeis.org

28, 41, 161, 448, 476, 656, 721, 956, 1081, 1241, 1393, 2108, 2268, 2576, 3281, 3321, 3713, 3836, 4633, 4681, 5593, 6076, 7168, 7616, 8188, 9401, 9641, 10496, 11536, 11753, 12121, 12593, 13041, 13916, 15296, 16828, 17296, 17500, 19516, 19856

Offset: 1

Artur Jasinski, Nov 29 2007, Nov 14 2008

nonn

Squares of these numbers are of the form N^4 - M^2 (where N belongs to A135786 and M to A057102). Proof is based on the identity (x^4 - 6x^2 * y^2 + y^4)^2 = (x^2 + y^2)^4 - (4(x^3y - xy^3))^2.
Since x^4 - 6x^2 * y^2 + y^4 = d*d' where d = x^2 - y^2 + 2xy and d' = x^2 - y^2 - 2xy, and d - d' = 4xy, the computational technique is to consider the divisors d|n, d'=n/d, to check that the difference is a multiple of 4, and to check x in the range 1..d/3. - R. J. Mathar, Sep 18 2009
Refers to A057102, which had an incorrect description and has been replaced by A256418. As a result the present sequence should be re-checked. - N. J. A. Sloane, Apr 06 2015

Cf. A000404, A050803, A057102, A135784, A060803, A135786, A135787.

isA135789 := proc(n) for d in numtheory[divisors](n) do dprime := n/d ; if abs(d-dprime) mod 4 = 0 then for x from 1 to d/3 do y := (d-dprime)/4/x ; if type(y,'integer') and y< x and y> 0 then if n = (x^2-y^2+2*x*y)*(x^2-y^2-2*x*y) then RETURN(true); fi; fi; od: fi: od: RETURN(false) ; end: for n from 1 do if isA135789(n) then printf("%d,\n",n) ; fi; od: # R. J. Mathar, Sep 18 2009

a = {}; Do[Do[w = x^4 - 6x^2 y^2 + y^4; If[w > 0&&w<10000, AppendTo[a, w]], {x, y, 2000}], {y, 1, 2000}]; Union[a]

More terms from R. J. Mathar, Sep 18 2009

A135790 Positive numbers of the form -x^4+6x^2 y^2-y^4 (where x,y are integers).

Original entry on oeis.org

4, 7, 64, 112, 119, 164, 239, 324, 527, 567, 644, 959, 1024, 1519, 1792, 1904, 2047, 2500, 2624, 2884, 3479, 3824, 4207, 4324, 4375, 4879, 4964, 5184, 5572, 6647, 6887, 7327, 8119, 8432, 9072, 9604, 9639

Offset: 1

Artur Jasinski, Nov 29 2007

nonn

Squares of these numbers are of the form N^4-M^2 (where N belongs to A135786 and M to A057102). Proof uses: (x^4 - 6x^2 y^2 + y^4)^2=(x^2+y^2)^4-(4(x^3y-xy^2))^2.

Refers to A057102, which had an incorrect description and has been replaced by A256418. As a result the present sequence should be re-checked. - N. J. A. Sloane, Apr 06 2015

Cf. A000404, A050803, A057102, A135784, A060803, A135786, A135787, A135789.

a = {}; Do[Do[w = -x^4 + 6x^2 y^2 - y^4; If[w > 0&&w<10000, AppendTo[a, w]], {x, y, 2000}], {y, 1, 2000}]; Union[a]

A135791 Positive numbers of the form x^5-10x^3y^2+5xy^4 (where x,y are integers and x>y).

Original entry on oeis.org

404, 1900, 3647, 5646, 12928, 13412, 14050, 27688, 30609, 36413, 45716, 51804, 60800, 74576, 90050, 98172

Offset: 1

Artur Jasinski, Nov 29 2007

nonn

See A135792, union A135791 and A135792 see A135793. Squares of these numbers are of the form N^5-M^2 (where N belongs to A135787 and M to A057102) Proof uses: (x^5-10x^3 y^2+5xy^4)^2=(x^2+y^2)^5-(5x^4y-10x^2y^3+y^5)^2. [This line needs editing! - N. J. A. Sloane, Dec 04 2007]

Refers to A057102, which had an incorrect description and has been replaced by A256418. As a result the present sequence should be re-checked. - N. J. A. Sloane, Apr 06 2015

Cf. A000404, A050803, A057102, A135784, A060803, A135786, A135787, A135789, A135790, A135792, A135793.

a = {}; Do[Do[w = x^5 - 10x^3 y^2 + 5x y^4; If[w > 0 && w < 100000, AppendTo[a, w]], {x, y, 1000}], {y, 1, 1000}]; Union[a]

A135792 Positive numbers of the form x^5-10x^3y^2+5xy^4 (where x,y are integers and y>x).

Original entry on oeis.org

41, 122, 316, 1121, 1312, 1900, 2868, 2876, 3904, 4282, 6121, 9963, 10112, 11516, 17684, 19841, 20122, 23028, 23807, 25525, 29646, 31996, 35872, 41984, 44403, 49001, 59162, 60800, 65900, 71996, 76453, 76788, 80404, 91776, 92032

Offset: 1

Artur Jasinski, Nov 29 2007

nonn

Refers to A057102, which had an incorrect description and has been replaced by A256418. As a result the present sequence should be re-checked. - N. J. A. Sloane, Apr 06 2015

Cf. A000404, A050803, A057102, A135784, A060803, A135786, A135787, A135789, A135790, A135791, A135793.

a = {}; Do[Do[w = x^5 - 10x^3 y^2 + 5x y^4; If[w > 0 && w < 100000, AppendTo[a, w]], {y, x, 1000}], {x, 1, 1000}]; Union[a]

A135793 Numbers of the form x^5-10x^3y^2+5xy^4 (where x,y are integers).

Original entry on oeis.org

41, 122, 316, 404, 1121, 1312, 1900, 2868, 2876, 3647, 3904, 4282, 5646, 6121, 9963, 10112, 11516, 12928, 13412, 14050, 17684, 19841, 20122, 23028, 23807, 25525, 27688, 29646, 30609, 31996, 35872, 36413, 41984, 44403, 45716, 49001, 51804

Offset: 1

Artur Jasinski, Nov 29 2007

nonn

Refers to A057102, which had an incorrect description and has been replaced by A256418. As a result the present sequence should be re-checked. - N. J. A. Sloane, Apr 06 2015

Cf. A000404, A050803, A057102, A135784, A060803, A135786, A135787, A135789, A135790, A135791, A135792.

A057103 Triangle of congrua: T(n,k) = 4nk(n^2-k^2) with n>k>0 and starting at T(2,1) = 24. A055096(n)^2 + a(n) is a square, as is A055096(n)^2 - a(n).

Original entry on oeis.org

24, 96, 120, 240, 384, 336, 480, 840, 960, 720, 840, 1536, 1944, 1920, 1320, 1344, 2520, 3360, 3696, 3360, 2184, 2016, 3840, 5280, 6144, 6240, 5376, 3360, 2880, 5544, 7776, 9360, 10080, 9720, 8064, 4896, 3960, 7680, 10920, 13440, 15000, 15360, 14280, 11520, 6840

Offset: 2

Henry Bottomley, Aug 02 2000

Refers to A057102, which had an incorrect description and has been replaced by A256418. As a result the present sequence should be re-checked. - N. J. A. Sloane, Apr 06 2015

			T(2,1) = 4*2*1*(4-1) = 5^2-1^2 = 7^2-5^2 = 24.
Triangle begins:
   24;
   96,  120;
  240,  384,  336;
  480,  840,  960,  720;
  840, 1536, 1944, 1920, 1320;
  ...

Eric Weisstein's World of Mathematics, Congruum Problem.

Cf. possible congrua A057102. See also A055096.

T[n_, k_] := 4 n k (n^2 - k^2);
Table[T[n, k], {n, 2, 10}, {k, 1, n - 1}] // Flatten (* Jean-François Alcover, Feb 25 2019 *)

Offset corrected by Alois P. Heinz, Feb 25 2019

cp's OEIS Frontend

A003273 Congruent numbers: positive integers k for which there exists a right triangle having area k and rational sides.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Extensions

A009112 Areas of Pythagorean triangles: numbers which can be the area of a right triangle with integer sides.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

A024406 Ordered areas of primitive Pythagorean triangles.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A057102 a(n) = 4 * A073120(n).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

Extensions

A135789 Positive numbers of the form x^4 - 6 * x^2 * y^2 + y^4 (where x,y are integers).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

Extensions

A135790 Positive numbers of the form -x^4+6x^2 y^2-y^4 (where x,y are integers).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A135791 Positive numbers of the form x^5-10x^3*y^2+5x*y^4 (where x,y are integers and x>y).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A135792 Positive numbers of the form x^5-10x^3*y^2+5x*y^4 (where x,y are integers and y>x).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A135793 Numbers of the form x^5-10x^3*y^2+5x*y^4 (where x,y are integers).

A135791 Positive numbers of the form x^5-10x^3y^2+5xy^4 (where x,y are integers and x>y).

A135792 Positive numbers of the form x^5-10x^3y^2+5xy^4 (where x,y are integers and y>x).

A135793 Numbers of the form x^5-10x^3y^2+5xy^4 (where x,y are integers).

A057103 Triangle of congrua: T(n,k) = 4nk(n^2-k^2) with n>k>0 and starting at T(2,1) = 24. A055096(n)^2 + a(n) is a square, as is A055096(n)^2 - a(n).