MathDB
Costa Rican Math Olympiad 2009 Problem 2

Source:

November 27, 2009
inductionnumber theory unsolvednumber theory

Problem Statement

Prove that for that for every positive integer n n, the smallest integer that is greater than (\sqrt {3} \plus{} 1)^{2n} is divisible by 2^{n \plus{} 1}.