Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
keithalewis
12 days ago
|
parent
|
context
|
favorite
| on:
A binary tree of all Pythagorean triples
There are Pythagorean triples (a, b, c) for which there do not exist integers m, n with a = m^2 - n^2, b = 2mn, c = m^2 + n^2.
tromp
12 days ago
|
next
[–]
But all such triples are non-primitive. I.e. they are of the form (ka, kb, kc) with k>1. So all Pythagorean triples can be generated as a scaled primitive triple (a,b,c) that is generated by Euclid's formula from m,n.
reply
FredrikMeyer
12 days ago
|
prev
[–]
Learned something new today. For other interested:
https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_...
reply
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
