MathDB

6

Part of 2006 JBMO ShortLists

Problems(1)

Factorials and divisibility

Source: JBMO Shortlist 2006

11/10/2008
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.
factorialfloor functionnumber theory proposednumber theory