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.
Answer:
<h2>i) 3</h2><h2>ii) 5</h2>Step-by-step explanation:
Let H be the set of students who play Hokey
V be the set of students who play Volleyball
S be the set of students who play Soccer
======================================
card(volleyball only) = card(V) - [card(V∩H∩S) + card(V∩H only) + card(V∩S only)]
= 73 - [50 + (58-50) + (62-50)]
= 73 - [50 + 8 + 12]
= 73 - 70
= 3
………………………………………………
Card(Hokey only) = 100 - [3 + 8 + 50 + 10 + 12 + 12]
= 100 - 95
= 5
…………………
<u><em>Note</em></u> :
A Venn diagram might be helpful in such case.
