Skip to main content
added top-level tag; http://meta.mathoverflow.net/questions/1457/why-are-mo-tags-formatted-as-they-are
Link
Edited OP's clarification from the comments into the actual question
Source Link
Benjamin Dickman
  • 7.8k
  • 2
  • 47
  • 89

Given $j \geq 5$, is there a formula for the number of Pythagorean triplets $(a, b, c)$ satisfying the constraint that $a, b, c \leq j$?

There exists at least one Pythagorean triplet for j=5. The$j\geq5$; the question is how to find the exact number of Pythagorean triplets for large j$j$.

There exists at least one Pythagorean triplet for j=5. The question is how to find the exact number of Pythagorean triplets for large j.

Given $j \geq 5$, is there a formula for the number of Pythagorean triplets $(a, b, c)$ satisfying the constraint that $a, b, c \leq j$?

There exists at least one Pythagorean triplet for $j\geq5$; the question is how to find the exact number of Pythagorean triplets for large $j$.

Post Reopened by Igor Rivin, András Bátkai, Daniel Moskovich, Jan-Christoph Schlage-Puchta, Stefan Kohl
Post Closed as "Needs details or clarity" by Steven Landsburg, Wolfgang, Jeremy Rickard, Chris Godsil, Franz Lemmermeyer
Source Link

Is there any formula to find number of Pythagorean triplets between two integers 2 and j, j>2?

There exists at least one Pythagorean triplet for j=5. The question is how to find the exact number of Pythagorean triplets for large j.