I started with c, but you could’ve started with any box.
So I took the numbers in the c box (the black box in my picture) and divided to see which were multiples of two. They all were.
Then I went to a. All of a’s numbers were divisible by 7.
Then b. Two of them are divisible by 2, so that’s not the answer. None of them were divisible by 7, so there’s your answer!
Then d. Two are divisible by 7, so your rules is divisible by 2.
I hope this helps!
Answer:
40320 different ways
Step-by-step explanation:
That problem is a permutation one
We have eight people to occupy one position in a team, without any constraint at all
So
Total number of events = P(8)
P (8) = 8!
P (8) = 8*7*6*5*4*3*2*1
P (8) = 40320 different ways
Answer:
$4416.6
Step-by-step explanation:
If i understand you question correctly than this is the answer. Hope this helps!! But if not Sorry!!! :):):)
Seca(1-sina)(seca+tana)=1
Left hand side
=(1-sina) (seca +tana) / cosa
=seca +tana - sinaseca - sinatan / cosa
=seca + tana -tana -(sin^2a/cosa) / cosa
=(1/cosa - sin^2a/cosa) / cosa
= (1-sin^2a / cosa) / cosa
= (1-sin^2a)/ (cos^2a)
=1 (verified)