Share
Explore BrainMass

Prime number proof

Prove that if p is a prime number, then p divides

, for all n≥p.

Here [r] denotes the greatest integer ≤ r , for any real number r.

Does this result generalize to a result about instead of p ?

Attachments

Solution Summary

This shows a prime number proof

$2.19