Answer:
Step-by-step explanation:
6-digit palindrome is the number n the form of:
This is divisible by 11 by default as the sum of the digits in odd placed is same as sum of the number in even places (remember the divisibility rule by 11):
Now, in order to be divisible by 99, the number must be divisible by 11 and 9.
According to divisibility rule by 9 the sum of all digits must be divisible by 9. You can see In our case we need to have (the minimum):
The smallest number we could get is when x is minimum, y is minimum, so:
The number we get is:
Proof:
Hello,
Let's assume n the palindrome
[tex]n=\overline{abccba}\\\\Since\ 99=9*11:\\\\the \ smallest\ \Longrightarrow \ a=1\\\\a+b+c+c+b+a=9*k\ ,\ k\in \mathbb{N}\\2*(a+b+c)=9*k\ \Longrightarrow \ k\in 2\mathbb{N} , \ : k=2\\\\1+b+c=9 \Longrightarrow \ b=0\ and\ c=8\\\\n=108801\\\\Proof:\\108801=9*12089 =11*9891\\Nota\ bene:(a+c+b)-(b+c+a)=11*p \Longrightarrow \ 0=11*p \Longrightarrow \ p=0[/tex]
