Recall that a positive integer p is called prime provided that it is greater than 1 and has no positive integer divisors other than 1 and p. Using this definition, show that every prime number p is relatively prime to the integers 1 through p – 1.
Added by Dean H.
Close
Step 1
A positive integer \( p \) is called prime if it is greater than 1 and has no positive integer divisors other than 1 and \( p \). Show more…
Show all steps
Your feedback will help us improve your experience
Vincenzo Zaccaro and 73 other Calculus 3 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
If $m, n, n^{\prime} \in \mathbb{Z}$ are such that $m$ and $n$ are relatively prime and $m \mid n n^{\prime}$, then show that $m \mid n^{\prime}$. Deduce that if $p$ is a prime (which means that $p$ is an integer $>1$ and the only positive integers that divide $p$ are 1 and $p$ ) and if $p$ divides a product of two integers, then it divides one of them. (Hint: Exercise 38.)
Use the lemma below to show if p is a prime a is integer with p | a^2, then p |a. Lemma: if a, b, and c are positive integers with (a,b)=1 and a | bc, then a | c.
Liliane M.
Show that if $p$ is a prime and $k$ is an integer such that $1 \leq k \leq p-1,$ then $p$ divides $\left(\begin{array}{l}{p} \\ {k}\end{array}\right)$
Counting
Binomial Coefficients and Identities
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD