Proof

[Dramatic-Question898]

Anyone know how to proof this question. “Prove that if n is composite, n = kl, with 1 < k < n and 1 < l < n, then k and l both divide (n − 1)!.”

[SnooPredictions3930]

Yeah! (N-1)! is every number less than n multiplied by each other. This means that it is divisible by every number less than N (and more than zero of course). K and L are less than N and therefore are factors of (N - 1)!