Question

Prove that for every prime number `p>3 ` the following holds: `p^2-1` is divisible by `6`.

Difficulty level (1 very easy - 10 very hard): 2

Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Algebra -> Algebraic Techniques -> Short Multiplication Formulas / Algebraic Identities Number Theory -> Division -> Parity (Even/Odd) Proof and Example Number Theory -> Prime Numbers -> Prime Factorization

There are no comments yet.

Authentication required

You must log in to post a comment.