We Solve Problems
Problems
Categories
F.A.Q.
Sign In
Sign Up
Sign Up
Problem
#PRU-60850
Problems
Methods
Examples and counterexamples. Constructive proofs
Pigeonhole principle
Pigeonhole principle (other)
Set theory and logic
Theory of algotithms
Theory of algorithms (other)
13–16
4.0
Problem
Prove that there are infinitely many composite numbers among the numbers
⌊
2
k
2
⌋
(
k
=
0
,
1
,
…
).
To see the solution
register
and get verified.