A common mistake made by students is to claim that
a 2 + b 2 = a 2 + b 2 .
How many ordered triples of integers ( a , b , c ) are there, such that each of a , b , c are integers from 0 to 9 inclusive, and
a 2 + b 2 − a 2 + c 2 = b 2 − c 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.
First of all since b , c > 0 we get b 2 = b , c 2 = c , Hence a 2 + b 2 − a 2 + c 2 = b 2 − c 2 ⇕ a 2 + b 2 − a 2 + c 2 = b − c ⇓ 2 a 2 + b 2 + c 2 − 2 ( a 2 + b 2 ) ( a 2 + c 2 ) = b 2 + c 2 − 2 b c ⇕ a 2 + b c = ( a 2 + b 2 ) ( a 2 + c 2 ) ⇕ ( a 2 + b c ) 2 = ( a 2 + b 2 ) ( a 2 + c 2 ) ⇕ 2 a 2 b c − a 2 b 2 − a 2 c 2 = 0 Now it is important that one step was mere implication, hence we need to also check our solutions, now if a = 0 , then b , c ∈ { 0 , 1 , 2 , … , 9 } . If a = 0 , then 2 b c − b 2 − c 2 = 0 ⇔ ( b − c ) 2 = 0 ⇔ b = c Hence if a ∈ { 1 , 2 , … , 9 } , then ( b , c ) ∈ { ( 0 , 0 ) , ( 1 , 1 ) , … , ( 9 , 9 ) } Also obviously the original equation holds if b = c or a = 0 , hence by combinatorial rule of product there are 1 0 ⋅ 1 0 + 1 0 ⋅ 9 = 1 9 0 solutions.
Great clear explanation of the double-sided implications, and why those are important.
great
let a 2 + b 2 − a 2 + c 2 = b 2 − c 2
if a = 0 then:
a 2 + b 2 − a 2 + c 2 = b 2 − c 2
0 2 + b 2 − 0 2 + c 2 = b 2 − c 2
b 2 − c 2 = b 2 − c 2
and we've number of ordered triples ( 0 , b , c ) is 1 0 × 1 0 = 1 0 0
if a > 0 then must b = c so number of ordered triples ( a , b , b ) = ( a , c , c ) = ( a , b ) = ( a , c ) is 1 0 × 1 0 = 1 0 0
but the triples ( 0 , b , c ) is repeated twice, when a = 0 and b = c so we subtract 1 0 :
( 0 , 0 , 0 ) ( 0 , 1 , 1 ) ( 0 , 2 , 2 ) ... ( 0 , 9 , 9 )
then number of ordered triples is 1 0 0 + 1 0 0 − 1 0 = 1 9 0
i've some miss, big one, when a > 0 this mean we have just 9 possibilities for a , and the triples ( a , b , c ) has b = c , so it's 9 × 1 0 = 9 0 so the total is 1 0 0 + 9 0 = 1 9 0
Log in to reply
You need to explain why "If a > 0 , then must b = c ." That is not obvious.
a 2 + b 2 − a 2 + c 2 2 a 2 + b 2 + c 2 − 2 ( a 2 + b 2 ) ( a 2 + c 2 ) 2 ( a 2 + b 2 ) ( a 2 + c 2 ) 4 ( a 2 + b 2 ) ( a 2 + c 2 ) ( a 2 + b 2 ) ( a 2 + c 2 ) a 4 + a 2 b 2 + a 2 c 2 + b 2 c 2 a 2 ( b 2 + c 2 ) = b 2 − c 2 = b − c = b 2 + c 2 − 2 b c = 2 ( a 2 + 2 b c ) = 4 ( a 2 + 2 b c ) 2 = ( a 2 + 2 b c ) 2 = a 4 + b 2 c 2 + 2 a 2 b c = a 2 ( 2 b c )
So a 2 = 0 ⟹ a = 0 or b 2 + c 2 = 2 b c ⟹ b = c (by AM-GM).
Hence, by the inclusion-exclusion principle, the number of ordered triples satisfying the constraints is
1 0 0 + 1 0 0 − 1 0 = 1 9 0 .
This is basically correct, but one has to make sure that all your solutions actually work, or that all your transformations are reversible.
Log in to reply
Right, I should have done that. I felt like a = 0 and b = c were the trivial solutions (it's probably the first thing that comes to mind), and by using algebra I showed that at least there's no more solutions than that.
to make this equation valid, a must be equal to zero or b must be equal to c.
There are 100 situations where a=0 and 100 situations where b=c. There are 10 situations that overlap so there 100+100-10=190 possible solutions.
So there are 190 triples of integers that satisfy the equation.
Remember that your solution should justify the answer, and not simply be "I had a lucky guess".
Exactly what I did. Now that we've got the answer, it seems fine to say that our assumption was valid (a = 0 or b = c is the only possibility). However, I don't think we can simply state it and get away.
Simplifying the given equation, we get 2 a 2 b c = a 2 b 2 + a 2 c 2 So, either a = 0 , or ( b − c ) 2 = 0 = > b = c When a=0, we get 10 possible values of b and c each. So total possible (a,b,c) combinations are 1 ∗ 1 0 ∗ 1 0 = 1 0 0 When b=c, we get 9 possible values of a (1 through 9) and 10 possible values of (b,c) (0 through 10). So total possible (a,b,c) combinations are 9 ∗ 1 0 ∗ 1 = 9 0 Sum total = 100+90=190
This is correct, but more explanation is needed on how the simplification worked. In particular, were all you algebraic transformations reversible?
The statement will be true if b=c or if a=0.
There are 100 cases where b=c and 100 cases where a=0.
And 10 cases are overlapping, therefore are counted twice.
Therefore the number of cases is 100+100-10=190.
The reasons for there being 100 cases where b=c and 100 cases where a=0 are left to the reader as an exercise.
Squaring on both sides and then arranging gives us - 2 a 2 + 2 b 2 c 2 = 2 ( a 2 + b 2 ) ( a 2 + c 2 ) Now again square on both sides and arranging gives us - 2 b 2 c 2 = b 2 + c 2 We know that ∣ x ∣ = x 2 So, 2 ∣ b c ∣ = b 2 + c 2 ⇒ 2 ∣ b c ∣ − 2 b c = ( b − c ) 2
Since bc is always positive (because questions says a,b,c are integers from (0 - 9) So, 2 ∣ b c ∣ − 2 b c = 0 = ( b − c ) 2 ⇒ b = c
Case 1 : when b = c , and a ranges from 1-9, we have 1 0 × 9 = 9 0 possiblities
Case 2 : now taking a = 0 , the equality becomes 0 + b 2 − 0 + c 2 = b 2 − c 2 , which is true for all b and c . Hence total of 1 0 × 1 0 = 1 0 0 possibilities.
Therefore, we get total 1 9 0 ordered triples of integers ( a , b , c ) which satisfy the above condition
GREAT JOB
Problem Loading...
Note Loading...
Set Loading...
a 2 + b 2 − a 2 + c 2 = b 2 − c 2
Since we know a , b , c > = 0 we can simplify the RHS to:
a 2 + b 2 − a 2 + c 2 = b − c
Squaring on both sides,
a 2 + b 2 − 2 ( a 2 + b 2 ) ( a 2 + c 2 ) + a 2 + c 2 = b 2 − 2 b c + c 2
Collecting like terms,
2 a 2 − 2 ( a 2 + b 2 ) ( a 2 + c 2 ) = − 2 b c
Isolating the square root,
− a 2 + ( a 2 + b 2 ) ( a 2 + c 2 ) = b c
( a 2 + b 2 ) ( a 2 + c 2 ) = a 2 + b c
Squaring on both sides again and expanding the product of polynomials,
a 4 + a 2 b 2 + a 2 c 2 + b 2 c 2 = a 4 + 2 a 2 b c + b 2 c 2
a 2 b 2 + a 2 c 2 = 2 a 2 b c
a 2 ( b 2 + c 2 − 2 b c ) = 0
Factoring the polynomial,
a 2 ( b − c ) 2 = 0
So either a = 0 , giving us 1 0 0 possible solutions, or a = 0 and b = c , giving us 9 × 1 0 = 9 0 more solutions.
So, 190.