Math  /  Math Statement

QuestionProve that n7n n^{7}-n is divisible by 42 for all positive integers n n and p>3 p>3 prime, p21(mod24) p^{2} \equiv 1(\bmod 24) .

Studdy Solution
We can see that both36n^2 and12n are divisible by24. The remaining value is, therefore p2(mod24)p^{2} \equiv (mod\,24).
End of Solution. (a) The given expression is divisible by42 for every positive integer. (b) Every prime number not equal to2 or5 divides infinitely many of the numbers 10n+10^n +.
2. If p>3 is a prime number, then p2(mod24)p^{2} \equiv (mod\,24).

View Full Solution - Free
Was this helpful?

Studdy solves anything!

banner

Start learning now

Download Studdy AI Tutor now. Learn with ease and get all help you need to be successful at school.

ParentsInfluencer programContactPolicyTerms
TwitterInstagramFacebookTikTokDiscord