A rather dull puzzle this week:
Show that, for any integer y, (√3-1)2y+(√3+1)2y is an integer multiple of a power of two.
I just have to apply Newton’s binomial theorem to obtain the result. What’s the point?!
Filed under: Books, Kids, R Tagged: Binomial theorem, Isaac Newton, Le Monde, mathematical puzzle