Question
Let $p$ be a prime divisor of a positive integer $n$. Prove that $p$ is irreducible in $Z_{n}$ if and only if $p^{2}$ divides $n$. (See Exercise 28).
Step 1
An element \( a \in \mathbb{Z}_n \) is irreducible if it cannot be expressed as a product of two non-unit elements in \( \mathbb{Z}_n \). Show more…
Show all steps
Your feedback will help us improve your experience
Sriparna Bhattacharjee and 94 other Calculus 2 / BC educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let $p$ be a prime and $m$ a positive integer. By mathematical induction on $m$, or otherwise, prove that whenever $r$ is an integer such that $p$ does not divide $r, p$ divides ${ }^{m p} C_{r}$,
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD