Prime number proof
Not what you're looking for? Search our solutions OR ask your own Custom question.
This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!
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 May 24, 2023, 1:14 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.