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 ?© BrainMass Inc. brainmass.com March 4, 2021, 5:50 pm ad1c9bdddf
Please see the attachment.
For any prime , we have . So we can assume . Now for any continuous integers , we also have
Let's come back to the problem. ...
This solution shows a prime number proof. The results generalized to a result are analyzed.