Problem #WSP-000160

Problems Number Theory Divisibility Division with remainders. Arithmetic of remainders Division with remainder

Problem

Prove that if \(n\) is a composite number, then \(n\) is divisible by some natural number \(x\) such that \(1 < x\leq \sqrt{n}\).