Question

What is the smallest three digit palindrome divisible by 18?

Answer 1

if it is not a prime then.. is it 252?

Answer 2

whats meant by a palindrome?

Answer 3

@fazna http://en.wikipedia.org/wiki/Palindrome

Answer 4

thnx arctic fox

Answer 5

I don't suppose 090 counts? ;) Otherwise Callisto is right.

Answer 6

i dont think it does =))) seems callisto really is

Answer 7

Meh. I'm always thinking outside the box.

Answer 8

I am late, but what is the way to find numbers like those?

Answer 9

i do not know...honestly =)) i was using trial and error hahaha...callisto might know and jag

Answer 10

lol i used my calculator too...

Answer 11

That was my next question. Is there a way to find the answer to this question without consulting a mult. table? There must be, but it's beyond me.

Answer 12

Oh ok, so brute force it is!

Answer 13

I'm going to ponder this for a bit.

Answer 14

i think the answer is 108.am i wrong?

Answer 15

It aint a palindrome.

Answer 16

yes you are 108 isn't palindrome

Answer 17

Palindromes read the same backward and forward

Answer 18

im confused with palindrome.

Answer 19

181 is a palindrome but not 108

Answer 20

171
12321
8539358

Answer 21

Methinks C++ can solve this question, using recursion maybe o.O

Answer 22

thnx a lot 4 all

Answer 23

Probably @arcticf0x but unless you figure out how to do on paper you will still be using brute force.
@Callisto There are no prime palindromes of 18 because all multiples of 18 are divisible by 2.

Answer 24

\(\mathsf {{\color{red}{\text{Did you mean:}} \color{blue}{\underline{\textit{recursion}}}}}\)

https://www.google.co.in/#hl=en&output=search&sclient=psy-ab&q=recursion&oq=recursion&aq=f&aqi=g10&aql=&gs_l=hp.3..0l10.461l2386l1l2672l9l9l0l2l2l0l183l1102l0j7l7l0.frgbld.&bav=on.2,or.r_gc.r_pw.r_qf.,cf.osb&fp=deb680bdb708ad7&biw=1366&bih=643

Answer 25

yup.. after trial and error, i discovered this truth and thought that i've mentioned something wrong :S

Answer 26

I believe this is true for any doubled prime.

Answer 27

2x9
2x7
2x11 . . .

Answer 28

We can consider about 100 so multiples of the inputted number and test the condition, stop when its met. Yes, its brute force only.

Answer 29

Ther is a very fast way to generate the "Next Palindrome" and it can be tweaked to work here :)

Answer 30

Algorithm is described here: http://www.algorithmist.com/index.php/SPOJ_PALIN