Sherry is excited to learn about the distributive law, and thinks that it applies to every possible operation. As such, she 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.
I fully agree with your calculation, as I do with those of the others. However, I have a question about terminology for all of you, which is why I answered 21 instead of 41.
They ask about ordered pairs. When we count those with a = 0 we get:
( 0 , − 1 0 ) , … , ( 0 , − 1 ) , ( 0 , 0 ) , ( 0 , 1 ) , … , ( 0 , 1 0 )
which as ordered pairs become:
( − 1 0 , 0 ) , … , ( − 1 , 0 ) , ( 0 , 0 ) , ( 0 , 1 ) , … , ( 0 , 1 0 )
Of course counting now all pairs with b = 0 would duplicate all of those above. Because they ask about ordered pairs.
But perhaps I simply have a totally messed up definition of ordered pair, heheh ;)
Log in to reply
The definition of an ordered pair is a pair of mathematical objects in which order is significant. Thus, reaaranging the order of the objects makes an entirely different ordered pair.
Log in to reply
Thank you, Ben.
Nice and basic point...
oh god, i forget to exclude the last case.
How we can find number of possible ordered pairs, I mean if we substitute b = 0 then how we are going to get 21 solution, I am a little novice in this ? Please Help.
Log in to reply
Hello, Syed. Hope this still helps since you asked this question 3 months ago, but here it goes: if we substitute b = 0, we have exactly 21 possibilities, presented below:
(a,b)=(-10,0),(-9,0),(-8,0),(-7,0),(-6,0),(-5,0),(-4,0),(-3,0),(-2,0),(-1,0),(0,0),(1,0),(2,0),(3,0),(4,0),(5,0),(6,0),(7,0),(8,0),(9,0),(10,0). If you count all ordered pairs you'll find you have 21 of them.
Another way to count it easier, in your mind, would be thinking of the possibilities in this way: if b=0, "a" can range anywhere from -10 to 10, right? So, from 1 to 10 you have 10 possibilities. Similarly, from -1 to -10 you have another new 10 possibilities, but don't forget "a" can also be 0, therefore you have 10+10+1 possibilities.
For the case that a=0 it's pretty much the exact same thing, but you just gotta be aware not to count the pair (0,0) twice.
Hope this helps.
DANG! I put 21, and didn't think of it the other way round!
i^2 = -1 is right??? sqrt (-1)^2 = sqrt ((-1)(-1)) = (sqrt (-1))*(sqrt (-1)) This is right??? So, if all statements is true sqrt (-1)^2 = -1 right??? So, whether you're the first statement is true???
Log in to reply
sqrt(a b)=sqrt(a) sqrt(b) <----> a,b>=0 (non negative number). P.S: u can search in wiki about fallacy in math for more information
Keeping a=0 leaves us 20 options on b which are -10 to -1 and 1 to 10; similarly, making b=0 gives us 20 options for a. 20+20 is 40. The answer must be 40.
I just forgot to subtract 1. So I made it wrong.
Good solution...
A poem:
Start by squaring this equation
On both sides; the same expression
Sans a term which is an exception
It's 2ab, such the rejection!
Subtract a^2 + b^2 on both sides
Getting 2ab as zero, quite nice
To make these two values equalize
a or b is zero, a surprise!
We count the ordered pairs, this manner:
We set a as zero, then count 'er:
We get 21 pairs, substituting b there
-10 to 10, 21 pairs!
Then we do the same for b
A value of zero, let it be
Then quite obviously we can see
21 pairs, such that values agree
Then we add the both cases together
We get 42, altogether
Counted (0, 0) twice, however:
Finally, 41, subtracting 1 there.
We get the final answer, 41 .
Incredible
They told me to write a solution like I wrote poetry. Here you go.
Log in to reply
This solution is really beautiful. I couldn't resist myself from upvoting it. :) With that being said, let me quote a few people from the past to demonstrate an obvious point, well known to many.
It is impossible to be a mathematician without being a poet in soul.
− Sophia Kovalevskaya.
"A mathematician who is not also something of a poet will never be a complete mathematician."
− Karl Weierstrass.
You, my friend, have a bright future ahead of you. :)
@Carl Joshua Quines , You're going places, Buddy. This is Just Beautiful. Well done. +1 From Me! :D
This is absolutely beautiful !!!!
Squaring both sides of the equation we get that a 2 + b 2 = a 2 + 2 a 2 b 2 + b 2 Simplifying the equation we get that 2 a b = 0 (technically it should be |ab|, but in this case it is not important) From the we see that either a or b is 0; We have 21 possible values for b if a is 0, and we have 21 possible values for a if b is 0, but the pair (0;0) is included in both answer sets, hence the answer is 2 1 + 2 1 − 1 = 4 1
By squaring both sides of the equation, we get: a 2 + b 2 = a 2 + 2 a 2 b 2 + b 2 . If we subtract a 2 + b 2 from both sides, we get 0 = 2 a 2 b 2 . When we divide 2, we get: 0 = a 2 b 2 . That means that either a or b has to be 0, or both. If only a is 0, then b can be and integer between − 1 0 and 1 0 excluding 0, meaning there are 2 0 pairs. The same is true if only b is 0. If both a and b are 0, then we have 1 more pair. That means that there are a total of 2 0 + 2 0 + 1 = 4 1 different pairs that satisfy the above conditions.
Square both sides: a 2 + b 2 = a 2 + 2 a 2 b 2 + b 2 0 = 2 a 2 b 2 a b = 0 Now, we count when at least one of ( a , b ) is 0. We could count this normally, or we could use complementary counting. If neither is 0, there are 2 0 2 = 4 0 0 possibilities. The total number is 2 1 2 = 4 4 1 . The answer is 4 4 1 − 4 0 0 = 4 1 .
Good solution, with a counting part for lazy guys :)
i cannot understand why 441-400
Log in to reply
The total number of pairs is 441. The number of pairs that have no 0's is 400. Thus, the number of pairs with at least one 0 is 41.
Desenvolvendo,
a 2 + b 2 = a 2 + b 2 a 2 + b 2 = a + b ( a 2 + b 2 ) 2 = ( a + b ) 2 a 2 + b 2 = a 2 + 2 a b + b 2 0 = 2 a b a b = 0
Isto é, devemos encontrar a quantidade de pares ordenados cujo produto entre a abscissa e a ordenada é nulo.
São eles: S = { ( − 1 0 , 0 ) , ( − 9 , 0 ) , . . . , ( 9 , 0 ) , ( 1 0 , 0 ) , ( 0 , 0 ) , ( 0 , − 1 0 ) , ( 0 , − 9 ) , . . . , ( 0 , 9 ) , ( 0 , 1 0 ) }
Totalizando a quantidade de 4 1 pares ordenados
mine is exactly as yours.
Either a or b must be zero for this equation to hold.
When any one of them is zero, the other one can have any value in [-10,10].
So total no. of pairs are 2*21=42.
But in this we have counted (0,0) twice.
So, the final answer is 41.
Lucky me, I didn't forgot about the double (0,0) :D
well, i just did not consider the double counting of (0,0) and got 42.
i got 42 and that's incorrect. huaaah i forgot that (0,0) are twice :"(
Squaring both sides gives a 2 + b 2 = a 2 + b 2 + 2 a b or 2 a b = 0 . Thus, at least one of a and b is 0 . We consider 3 cases:
Case 1 : a = b = 0
This gives one solution.
Case 2 : a = 0 , b = 0
There are 2 0 possible values of b . Thus, this gives 2 0 solutions.
Case 3 : a = 0 , b = 0
Similarily, this also gives 2 0 solutions.
Now, we just note that all solutions described above satisfies the original equation. So, there are 4 1 solutions.
We can think about the problem as a geometric problem in cartesian plane:
a and b are catheti of a right triangle so we have to find how many ordered pairs of catheti satisfy the condition that the sum of their lengths is equivalent to the length of the hypotenuse.
Thus, the triangle must be degenerate and we have to count all the pairs ( a , 0 ) and ( 0 , b ) without counting ( 0 , 0 ) two times.
So, the answer is 4 1
Brilliant interpretation.
Squaring both sides of the given equation yields a 2 + b 2 = a 2 + b 2 + 2 ( a 2 ) ( b 2 ) 0 = 2 ( a 2 b 2 ) 0 = ∣ a b ∣
This can only happen when either a = 0 or b = 0 (or both). So let us split this up by cases.
Case 1 : a = 0 There are exactly 21 possibilities for b.
Case 2 : b = 0 There are exactly 21 possibilities for a.
We might be tempted to think the final answer is 42. But we have counted ( a , b ) = ( 0 , 0 ) twice, so the answer is actually 4 1 .
possible only if a^2+b^2 is a perfect squre. that happens only when we take the pairs that contain atleast 1 (0). so...(0,0)(0,1)(0,-1)............(0,10)(0,-10)
:)
Sherry claims that a 2 + b 2 = a 2 + b 2 , but we know that a 2 + b 2 = a + b = a 2 + 2 a b + b 2 . Therefore, if both hold true, then a 2 + b 2 = a 2 + 2 a b + b 2 . After squaring both sides and further simplification, we find that 2 a b = 0 . This is only possible if: 1. a is equal to 0 2. b is equal to 0
Let us take the first case. Since a (which is equal to 0 ) will always make 2 a b equal to 0 , b can be any integer that satisfies − 1 0 ≤ b ≤ 1 0 . There are 2 1 possibilities for the first case. Similarly, there are 2 1 possibilities for the second case, when b is equal to 0 . However, we are over-counting the situation when both a and b are equal to 0 , so we must subtract 1 . Therefore, our answer is 2 1 + 2 1 − 1 = 4 1 .
We manipulate the equation by squaring both sides and simplifying: a 2 + b 2 a 2 + b 2 a b = = = a 2 + b 2 a 2 + b 2 + 2 a b 0 . So, we want at least one of a and b to be 0 . We use complementary counting. There are 2 1 choices for a and 2 1 choices for b , so 2 1 2 = 4 4 1 possible ordered pairs ( a , b ) .
The number of these ordered pairs for which neither a nor b is 0 is 2 0 2 = 4 0 0 . Thus, our answer is 4 4 1 − 4 0 0 = 4 1 .
Hm, I seem to be the only one to use complementary counting for the number of pairs.
Log in to reply
How about me?
Hi, Ahaan. I didn't get this problem in my problem set, but solved it because I saw it in many people's profile solving it. So I just wanted to know that which topic and level does it belong to?
Log in to reply
For me, it was Problem 2 this week in Algebra, Level 4. It was worth 125 points and the problem rating was 1909.
This reminds me very strongly of the triangle inequality, and I feel like there should be some relationship here to either the triangle inequality or the Cauchy-Schwarz inequality if we consider a and b as vectors in R with norms ∣ a ∣ and ∣ b ∣ . But for equality to hold in either of those cases the vectors must be scalar multiples of each other, whereas here the solution requires orthogonal vectors.
Maybe someone more familiar with the topic can shed some wisdom and develop an abstract argument involving orthogonality for why at least one of a or b must be zero? Am I looking for a connection where none exists?
The inequality that you refer to becomes an equality exactly when a or b = 0, or both. So this gives the ordered pairs where the equation is satisfied: (0,b), (a,0), and (0,0).
a 2 + b 2 = a 2 + b 2
a 2 + b 2 = a 2 + a 2 b 2 + b 2
0 = a 2 b 2
0 = a b
On − 1 0 ≤ a ≤ 1 0 , and b = 0 , there are 21 solutions, and there also 21 on − 1 0 ≤ b ≤ 1 0 and a = 0 . Total, subtracting the one solution that appears twice, there are 4 1 solutions.
Be careful Ben; you are missing a coefficient of 2 in the middle term of your expansion in the second row.
\sqrt{a^2+b^2}=\sqrt{a^2} + \sqrt{b^2} = a + b Squaring both the sides, one sees this is possible only if either a = 0 or b = 0 or both are zeros.
Note that to satisfy the above relation at least one of a and b must be 0 and a 2 + b 2 must be a perfect square .The first ordered pair is ( 0 , 0 ) .
Taking at least one of a and b 0 maximum value of a 2 + b 2 is 100 and minimum is 0.There are 10 squares in this range and each square can be obtained in four ways.For example 25 can be obtained by ( 5 , 0 ) , ( 0 , 5 ) , ( − 5 , 0 ) , ( 0 , − 5 ) .
This gives us 1 0 × 4 = 4 0 ordered pairs.Total ordered pairs = 4 0 + 1 = 4 1
Simplifying the equation and squaring both sides, a 2 + b 2 = a 2 + 2 a b + b 2 .
Therefore, 2 a b = 0 . For this to occur, at least 1 of ( a , b ) must be equals to 0 .
When a = 0 , there are 2 1 choices for b , since − 1 0 ≤ b ≤ 1 0 and b is an integer. This applies to the case when b = 0 as well. However, we have doubled counted the case when a = 0 and b = 0 . Thus, the total number of cases is 2 1 × 2 − 1 = 4 1 .
a 2 + b 2 = a + b a 2 + b 2 = a 2 + 2 a b + b 2 0 = 2 a b ⇒ a b = 0 .
If a = 0 , we have 1 0 − − 1 0 + 1 = 2 1 possibilities (including (0,0)). So, with b = 0 , we get 2 1 − 1 = 2 0 possibilities. Finally, the answer is 2 1 + 2 0 = 4 1 .
The bad typing is because i was on a mobile phone. Sorry!
Log in to reply
Your solution looks good, and I wouldn't have guessed that you typed on a mobile phone.
Do you have any suggestions of how we can make typing on a mobile phone easier?
Log in to reply
Well, I was typing it on a smart phone. It wasn't hard at all, but a suggestion I've had for some days in my mind is about the Latex (I don't know if that's the name of what we write by codes). When I sign in from my phone and try to read some solutions, the Latex doesn't appears completely, but just the inferior part of what is written (at least that's what is happening to me). So, maybe, us can try to edit the measures of those Latex codes so that if someone enters from a phone, that user could have the opportunity of reading it without inconveniences. Or, creating an alternate system of codes specifically for mobile phones. I don't know a lot about this systems... It's just some suggestions! :)
Log in to reply
@Diego E. Nazario Ojeda – What do you mean by the "inferior part"?
Log in to reply
@Silas Hundt – I mean that i cant see what is written on LaTeX clearly. It doesn't appears complete.
Log in to reply
@Diego E. Nazario Ojeda – Could you take a screenshot of a problem that doesn't look right with your phone and send it to me: silas@brilliant.org?
Log in to reply
@Silas Hundt – Of course. I will do it as soon as i can
What if you had a visual equation editor? I agree LaTeX looks nice but its not the best option when quite a few people don't know how to use it. It could help these people make their solutions more readable, as well as make the equation writing more accessible by phones.
If
√(a^2+b^2 )=√(a^2 )+√(b^2 )
Then
√(a^2+b^2 )=a+b
〖√(a^2+b^2 )〗^2=(a+b)^2
a^2+b^2=a^2+2ab+b^2
The squared terms cancel on both sides so we have
2ab=0
This is only possible when either a or b is 0.
For -10≤a≤10 and -10≤b≤10 we count 21 ordered pairs for each giving us 42, but because the ordered pair (0,0) duplicates in each set we have 41 possible pairs.
Let a 2 + b 2 = c 2
Then a 2 + b 2 = ∣ c ∣
Also a 2 + b 2 = ∣ a ∣ + ∣ b ∣
So a 2 + b 2 = a 2 + b 2
Is equivalent to ∣ c ∣ = ∣ a ∣ + ∣ b ∣
This is analogous to the triangle inequality , c ≤ a + b .
Where a , b , c are the sides of a triangle with a < c and b < c .
The triangle inequality becomes the equality c = a + b exactly when the triangle with sides a , b , c has 0 area, or in other words when a = 0 or b = 0 or both.
Therefore, the original equation will be satisfied by any ordered pair in the set { ( 0 , b ) , ( a , 0 ) , ( 0 , 0 ) } with a and b in the set { ± 1 , ± 2 , ± 3 , … , ± 9 , ± 1 0 } .
So the amount of possibilities for a is 20, the amount of possibilities for b is 20, and there is the case that both a = 0 and b = 0
Number of solutions, n = 2 0 + 2 0 + 1 = 4 1
Consider the problem geometrically. The LHS is the Euclidean distance of a point to the origin, and the RHS is the Manhattan Distance. These two distances are equal only on the axes. So there is the origin (1point) and 10 points on both axes on either side. So the total number of points is 41.
Haha, I was thinking of ( 0 , b ) , ( a , 0 ) and ( 0 , 0 ) and thus 3...
a 2 + b 2 = a 2 + b 2 = ∣ a ∣ + ∣ b ∣
Squaring both sides;
a 2 + b 2 = ∣ a ∣ 2 + ∣ b ∣ 2 + 2 ∣ a ∣ ∣ b ∣ = a 2 + b 2 + 2 ∣ a ∣ ∣ b ∣
2 ∣ a ∣ ∣ b ∣ = 0
∣ a ∣ = 0 or ∣ b ∣ = 0
Assume a = 0 and b is non-zero we have 1 0 + 1 0 = 2 0 solutions.
For a to be non-zero and b = 0 we have another 2 0 solutions.
Not forgetting a = 0 and b = 0 , we have 2 0 + 2 0 + 1 = 4 1 solutions in all.
Squaring and simplifying gave ab=0. So either both equal to zero or one of them. So I got 21. To start with the problem I had in mind that except 0, all the rest in the domain will be -tive or +tive. I forgot it for the first answer. Corrected for the second remembering well to have (0,0) only once..
The only possibility that the above equation holds true is when either of them is '0' or both of them are 0.. Case 1:Both a and b are zeros. (0,0) ---> 1 possiblity Case 2:If a = 0 , then b can take any values between -10 to 10 (leaving 0 cause it is already taken care in case 1) ----> 20 possibities Case 3: if b = 0 , then it is again another 20 possibilities.. therefore total 41 ways
a 2 + b 2 = a 2 + b 2 = a + b
Squaring both sides, we get...
( a 2 + b 2 ) 2 = ( a + b ) 2
⟹ a 2 + b 2 = a 2 + b 2 + 2 a b
⟹ 2 a b = 0
⟹ a b = 0
Thus, either a or b or both of them are zero...
Fixing a = 0 , we get − 1 0 ≤ b ≤ 1 0 , hence 2 1 values of b ...
Fixing b = 0 , we get − 1 0 ≤ a ≤ 1 0 , hence 2 1 values of a ...
Note that the pair ( a , b ) = ( 0 , 0 ) occurs in both cases, hence twice...
Therefore, the required result is: 2 1 + 2 1 − 1 = 4 1 ...
from given relation,after simplifying we get 2ab=0,now take a or b as 0,and consider the cases
Square both sides and cancel equal terms. Then we have 2ab=0. So, if a=0, there are 21 options for b. The same happens when b=0. This totals 42 ordered pairs. However, the case a=b=0 was counted twice, so the answer is 41.
a 2 + b 2 = ∣ a ∣ 2 + ∣ b ∣ 2 , and a 2 + b 2 = |a|+|b|Substitute into the equation given in the question, we get
∣ a ∣ 2 + ∣ b ∣ 2 =|a|+|b|
Squaring both side of the equation, we get ∣ a ∣ 2 + ∣ b ∣ 2 = ∣ a ∣ 2 +2|a||b|+ ∣ b ∣ 2 . Therefore 2|a||b|=0.
Consider either a or b is 0. If a =0, b =-10,-9,...,9,10, but b not equal to 0. We have 20 choices for b (from -10 to -1, and from 1 to 10). Similarly,If b =0, a also have 20 choices.There is also a pair which both a and b are 0. So total is 20+20+1= 4 1
a 2 + b 2
⟹ a 2 + b 2 + 2 a b [Let 2 a b = 0 ]
⟹ ( a + b ) 2
⟹ ( a + b )
And a 2 + b 2
⟹ ( a + b )
So, it is only possible when 2 a b = 0
⟹ 2 a b = 0
⟹ a b = 0
We can put value of b = − 1 0 t o 1 0 and a = 0
And a = − 1 0 t o 1 0 and b = 0
There is 21 integers from -10 to 10
So, there is total ( 2 1 × 2 ) − 1 ordered pairs of integers.
We counted 0 , 0 twice so there is -1
And the answer is 4 1
Problem Loading...
Note Loading...
Set Loading...
First of all, remember that a 2 = ∣ a ∣ and not a 2 = a
And also ∣ a ∣ 2 = a 2
Therefore, a 2 + b 2 = ∣ a ∣ + ∣ b ∣
Squaring both sides gives -
a 2 + b 2 = ∣ a ∣ 2 + ∣ b ∣ 2 + 2 ∣ a b ∣ ⇒ ∣ a b ∣ = 0
Keeping a = 0 , we have 21 possibilities for b
Then keeping b = 0 , we have 21 possibilities for a
But, now we have considered the case (0,0) twice so we need to exclude it.
Hence total solutions = 2 1 + 2 1 − 1 = 4 1