MathDB
Factorials and divisibility

Source: JBMO Shortlist 2006

November 10, 2008
factorialfloor functionnumber theory proposednumber theory

Problem Statement

Prove that for every composite number n>4 n>4, numbers kn kn divides (n\minus{}1)! for every integer k k such that 1\le k\le \lfloor \sqrt{n\minus{}1} \rfloor.
Back to ProblemsView on AoPS