Let \(n\) be a positive integer. Show that \(1+3+3^2+...+3^{n-1}+3^n=\frac{3^{n+1}-1}{2}\).
Show that all integers greater than or equal to \(8\) can be written as a sum of some \(3\)s and \(5\)s. e.g. \(11=3+3+5\). Note that there’s no way to write \(7\) in such a way.
Show that \(R(4,3)\le9\). That is, no matter how you colour the edge of \(K_9\), there must be a red \(K_4\) or a blue \(K_3\).
Show that \(R(4,4)\le18\) - that is, no matter how you colour the edges of \(K_{18}\), there must be a monochromatic \(K_4\).
By considering \(k-1\) copies of \(K_{k-1}\), show that \(R(k,k)\ge(k-1)^2\).
Let \(s>2\) and \(t>2\) be integers. Show that \(R(s,t)\le R(s-1,t)+R(s,t-1)\).
The sum of digits of a positive integer \(n\) is the same as the number of digits of \(n\). What are the possible products of the digits of \(n\)?
Find, with proof, all integer solutions of \(a^3+b^3=9\).
Long before meeting Snow White, the seven dwarves lived in seven different mines. There is an underground tunnel connecting any two mines. All tunnels were separate, so you could not start in one tunnel and somehow end up in another. Is it possible to walk through every tunnel exactly once without retracing your path?
Find the mistake in the sequence of equalities: \(-1=(-1)^{\frac{2}{2}}=((-1)^2)^{\frac{1}{2}}=1^{\frac{1}{2}}=1\).