Suppose that A is a totally ordered set. Use mathematical
Chapter 8, Problem 39E(choose chapter or problem)
Problem 39E
Suppose that A is a totally ordered set. Use mathematical induction to prove that for any integer n ≥ 1, every subset of A with n elements has both a least element and a greatest element.
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