For how many ordered triples of positive integers ( a , b , c ) , with 2 ≤ a , b , c ≤ 1 0 0 , does the following equality hold:
a lo g b c = c lo g b a
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.
a lo g b c = c lo g b a ⟹ a lo g b c × lo g a b 1 = c ⟹ a lo g b c × lo g a b = c
⟹ a lo g a c = c
Let, lo g a c = p then a p = c which is from above equation.From last equation c = a p Putting p in the second equation weget the identity:
a lo g a c = c .
So,this is valid for any ( a , b , c ) So number of solutions are 9 9 × 9 9 × 9 9 = 9 9 3 = 9 7 0 2 9 9
This equality is, indeed, an Identity (Try to prove it). That means, this equality is true for every a , b and c as long as a , b , c ∈ R + − { 1 } .
So, there will be 9 9 × 9 9 × 9 9 = 9 7 0 2 9 9 ordered triples of positive integers ( a , b , c ) , where 9 9 = 1 0 0 − 2 + 1 .
It looks like the other answers have you covered, but note we usually try to not leave any things in these solutions "to the reader" -- in general someone is looking at these solutions because they want to know what the process is to solve it, so we don't want to leave gaps.
Log in to reply
Okay, I'll avoid doing so in future. Thanks!
Problem Loading...
Note Loading...
Set Loading...
Taking log to the base b, we get ( lo g b a ) ( lo g b c ) = ( lo g b c ) ( lo g b a )
So this is true for all a,b,c satisfying the given restraints. So the answer is 9 9 3 = 9 7 0 2 9 9