Answer:
we need at least 17 - card deck
Step-by-step explanation:
From the information given :
We can attempt to solve the question by using pigeonhole principle;
"The pigeonhole principle posits that if more than n pigeons are placed into n pigeonholes some pigeonhole must contain more than one pigeon"
Thus; the minimum number of pigeon; let say at least n pigeons sit on at least one same hole among m hole can be represented by the formula:
m( n - 1 ) + 1
where ;
pigeons are synonymous to card
pigeonholes are synonymous to suits
So; m = 4 ; n = 5
∴ 4 (5 -1 ) + 1 ⇒ 4 (4) + 1
= 16 + 1
= 17
Hence; we need at least 17 - card deck
Answer:
![Interval: [-10.10]](https://tex.z-dn.net/?f=Interval%3A%20%5B-10.10%5D)
Step-by-step explanation:
Given
Set: -10 to 10
Required
Write as interval notation
We start by writing the given parameter as an inequality
The direct representation of 
and 
in interval representation of sets is 
and ![]](https://tex.z-dn.net/?f=%5D)
, which shows that the beginning and end of the interval are inclusive;
So, the above inequality in interval notation is:
Answer:
Oh I find all my inspiration thinkin' about you
Step-by-step explanation:
D I think because I did the math
Answer: There are three rotational symmetries of an equilateral triangle: rotation by zero degrees (the identity operation), rotation by 120 degrees, and rotation by 240 degrees. This group of symmetry operations is isomorphic to the cyclic group of 3 elements: [math]C_3.[/math]
Step-by-step explanation:
