A palindrome problem!

What is the number of palindromes which have 2 x 2x digits,where x > 0 x>0 . If the answer is of the form, A × B x C {A \times B^{x-C}} ,where A , B , C A,B,C are positive integers and A A is as small as it can be,then what is the value of A + B + C A+B+C ?


The answer is 20.

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.

1 solution

Adarsh Kumar
Jul 20, 2015

From the above image we have that the total number of palindromes of 2 x 2x digits = 9 × 1 0 x 1 =9\times 10^{x-1} ,hence A = 9 , B = 10 , C = 1 A + B + C = 20 A=9,B=10,C=1\Longrightarrow A+B+C=20 .And done!

Moderator note:

Are those values of A , B , C A, B, C uniquely determined? Why can't there be other such triplets?

Nice diagram ! Upvoted :).

Venkata Karthik Bandaru - 5 years, 10 months ago

Log in to reply

Thanx a lot!

Adarsh Kumar - 5 years, 10 months ago

I am really sorry sir,I have made the required corrections.

Adarsh Kumar - 5 years, 10 months ago

If F ( x ) = A × B x C = 9 × 1 0 x 1 F(x)=A\times B^{x-C}=9\times 10^{x-1} , then F ( 1 ) F ( 0 ) = B = 10 \frac{F(1)}{F(0)}=B=10 And F ( 0 ) = A × 1 0 C = 9 × 1 0 1 F(0)=A\times 10^{-C}=9\times 10^{-1} A = 9 × 1 0 C 1 A=9\times 10^{C-1} The smallest integer value for A A is A = 9 , C = 1 A=9, C=1

Joan Palacios Beltran - 5 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...