Use this data for question #14. The results for a survey of 120 students who were selected randomly are listed below:
1 answer:
You might be interested in
Proof by contadiction.
Let assume there exist such positive integers and
whose sum is a prime number
, that their greatest common divisor is greater than 1.
Since is a prime number and
, then
, but we assumed earlier that
, and there are no two positive integers that sum up to 1.
q.e.d.
<em>If the number you are rounding is followed by 5, 6, 7, 8, or 9, round the number up (+1).</em>
<em>If the number you are rounding is followed by 0, 1, 2, 3, or 4, round the number down (no change).</em>