Problem #PRU-60850

Problems Algorithm Theory Methods Examples and counterexamples. Constructive proofs Theory of algorithms (other) Pigeonhole principle Pigeonhole principle (other) Discrete Mathematics

Problem

Prove that there are infinitely many composite numbers among the numbers \(\lfloor 2^k \sqrt{2}\rfloor\) (\(k = 0, 1, \dots\)).