Use the well-ordering principle for the integers to prove Theorem 4.3.4: Every integer
Chapter 5, Problem 20(choose chapter or problem)
Use the well-ordering principle for the integers to prove Theorem 4.3.4: Every integer greater than 1 is divisible by a prime number
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer