Sam is excited to learn about the distributive law, and thinks that it applies to every possible operation. As such, he claims that a 2 + b 2 = a 2 + b 2
How many ordered pairs of integers ( a , b ) are there, such that − 1 0 ≤ a ≤ 1 0 , − 1 0 ≤ b ≤ 1 0 and a 2 + b 2 = a 2 + b 2 ?
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.
Problem Loading...
Note Loading...
Set Loading...
Squaring the equation on both sides, we get a 2 + b 2 = a 2 + b 2 +2|ab|.
After cancelling a 2 + b 2 on both sides, we get 2|ab|=0, which is true only when one of the numbers i.e either 'a' or 'b' is 0. Therefore the ordered pairs would be
(0,0), (0,1), (0,2), (0,3),..........(0,10), (0,-1), (0,-2), (0,-3),......(0,-10), (1,0), (2,0), (3,0),...........(10,0), ( -1,0),(-2,0), (-3,0),......(-10,0). That gives us 41 ordered pairs.