Lyndon chose this as one of his favourite problems. It is accessible but needs some careful analysis of what is included and what is not. A systematic approach is really helpful.

Prove that k.k! = (k+1)! - k! and sum the series 1.1! + 2.2! + 3.3! +...+n.n!

Compares the size of functions f(n) for large values of n.

The harmonic triangle is built from fractions with unit numerators using a rule very similar to Pascal's triangle.

6! = 6 x 5 x 4 x 3 x 2 x 1. The highest power of 2 that divides exactly into 6! is 4 since (6!) / (2^4 ) = 45. What is the highest power of two that divides exactly into 100!?

Find the highest power of 11 that will divide into 1000! exactly.

How many zeros are there at the end of the number which is the product of first hundred positive integers?

I have forgotten the number of the combination of the lock on my briefcase. I did have a method for remembering it...

Prove that k.k! = (k+1)! - k! and sum the series 1.1! + 2.2! + 3.3! +...+n.n!

Which is larger: (a) 1.000001^{1000000} or 2? (b) 100^{300} or 300! (i.e.factorial 300)