View source for Extreme principle/solutions

These are the solutions to the problems on the [[extreme principle]].

===1===
First, we note that it is impossible for a coin <math>\omega</math> to be tangent to six coins <math>\omega_1, \omega_2, \hdots, \omega_6</math> if each of the <math>\omega_i</math> is bigger than <math>\omega</math>.

Now consider the smallest coin. By the above observation, it is tangent to at most five of the others.

===2===

Assume that there is such a palindrome. It is required that <math>n>1=10^0</math>. Let <math>k</math> be the maximum positive integer, and <math>d</math> the maximum positive digit, such that <math>d\cdot10^k\leq n</math>. Then, the substring <math>d\underbrace{00\ldots0}_{k}</math> appears in the palindrome. This implies that its reverse, the substring <math>\underbrace{0\ldots00}_{k}d</math> also appears in the palindrome. The substring of <math>k</math> zeros in this, must be entirely part of the decimal representation of one the integers that get appended to form the palindrome. This is because decimal representations of positive integers do no begin with <math>0</math>. That integer must be smaller than <math>10^{k+1}</math>. Therefore it must be of the form <math>r\cdot10^k</math>, with <math>r\leq d</math>, and be followed in the palindrome by a digit <math>d</math>. It cannot be, that <math>r<d</math>, since after <math>r\underbrace{0\ldots00}_k</math> it should be appended <math>r\underbrace{0\ldots00}_{k-1}1</math>. It cannot be that <math>r=d</math>, in other words that the number <math>d\underbrace{00\ldots0}_k</math> is its own reverse inside the palindrome, since before it there should be <math>\underbrace{99\ldots9}_k</math> and after it <math>d\underbrace{00\ldots0}_{k-1}1</math>, which cannot turn into each other when the palindrome is reversed.