a , b , c , and d are distinct non-negative integers such that a 2 + b 2 = c 2 + d 2 = e 2 , where e is a non-negative integer.
For the minimum value of e 2 , what is the value of a + b + c + d + e ?
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.
I have amended the problem wording for you. We have to mention a , b , c , and d are distinct. If not there will be infinitely many solutions.
Log in to reply
Sir, how would there be infinite solutions?? And how did you amended problem? I had mentioned the assumption for this reason only.
Log in to reply
0 2 + 0 2 = 0 2 + 0 2 = 0 2 , 0 2 + 1 2 = 0 2 + 1 2 = 1 2 ,,, I noted you have mentioned "only two can be equal". But it is clearer to just say a , b , c , and d are distinct. You don't need to bring in e .
Log in to reply
@Chew-Seong Cheong – Ok,thank you sir. But how could you edit the question?
Log in to reply
@Mr. India – I am a moderator. If you are active in Brilliant you may be appointed as a moderator. I have added "where e is a non-negative integer."
Considering a 2 + b 2 = c 2 + d 2 = e 2 , to have the smallest e 2 , it is reasonable for us to assume one of the four distinct non-negative integers be the smallest 0. Let d = 0 . Then a 2 + b 2 = c 2 = e 2 , and c = e . It is obvious that ( a , b , c ) is the smallest set of Pythagorean triples ( 3 , 4 , 5 ) . Therefore, a + b + c + d + e = 3 + 4 + 5 + 0 + 5 = 1 7 .
Problem Loading...
Note Loading...
Set Loading...
2 5 = 5 2 = 5 2 + 0 2 = 3 2 + 4 2
a + b + c + d + e = 0 + 5 + 3 + 4 + 5 = 1 7
2 5 is minimum as it is the smallest perfect square which can be written as sum of 2 other perfect squares and also fulfilling the assumption