a , b , c , d , e , f , and g are all distinct, positive integers such that a 2 + b 2 = c 2 + d 2 = e 2 + f 2 = g .
What is the smallest possible value of g ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
OK so
that php site is way more powerful than ka cs
that or the last 2 variables make an exponential difference
see my comment on the persons solution for https://brilliant.org/problems/sum-of-squares-2-2/
my codes there
3 2 5 = 1 8 2 + 1 2 = 1 7 2 + 6 2 = 1 5 2 + 1 0 2 .
I leave the challenge to the solver to prove that this is the smallest :)
I tried g = ( 1 2 + 2 2 ) ( 1 2 + 2 2 ) ( 2 2 + 3 2 ) and worked!
that doesnt make sense
here you have a=1, b=2, c=1, d=2, e=2, f=3
OP said every letter is distinct, therefore this wouldnt fit
oh i see he said he tried 1 2 1 2 2 3 as a b c d e f respectively i thought he was just, spontaneously spamming some arbitrary mathematical syntax
Problem Loading...
Note Loading...
Set Loading...
I wrote some code to brute force it
Probably not the most elegant solution but it works