SOLUTION: For each of the following sets, indicate if the Well-Ordering Principle guarantees a
smallest member. Find the smallest member of each of the given sets if you can.
(a) All posit
Algebra ->
Probability-and-statistics
-> SOLUTION: For each of the following sets, indicate if the Well-Ordering Principle guarantees a
smallest member. Find the smallest member of each of the given sets if you can.
(a) All posit
Log On
Question 847249: For each of the following sets, indicate if the Well-Ordering Principle guarantees a
smallest member. Find the smallest member of each of the given sets if you can.
(a) All positive integers that can be written in the form 397x + 541y, where x and
y can be any integers. Answer by richard1234(7193) (Show Source):
You can put this solution on YOUR website! The set of positive integers is well-ordered, so any subset of the positive integers is also well-ordered.
gcd(397, 541) = 1, so 1 is the smallest positive integer of the form 397x + 541y.
