This is a combination in which you choose 4 from 10.
The formula is
combinations = 10! / 4! * (10-4)!
combinations = 10! / 4! * 6!
combinations = 10 * 9 * 8 * 7 * 6! / 4! * 6!
combinations = 10 * 9 * 8 * 7 / 4 * 3 * 2
combinations = 10 * 3 * 7
combinations = 210
Source:
http://www.1728.org/combinat.htm
Answer:
True
Step-by-step explanation:
In Prime factorization, we are expected to obtain factors that are prime numbers that can multiply themselves to give the original number. So long as the first factor can divide the number without a remainder, other remaining factors can be multiplied together to give the original number.
Prime factorization of the number, 15 goes thus;
15/3=5
5/5=1
3*5=15
So, all the factors multiply to give the original number.
Answer:
2. 92 ounces of Sprite
3. 1/6 do not want mustard on their ham sandwiches
4. 6 hours playing volleyball
5. 32 portions
Step-by-step explanation:
2. Sam has 8 cans of Sprite. Each can is 11 2/4 ounces
We can simplify 2/4 to 1/2
Multiply the number of cans by the ounces per can
8 * 11 1/2
8 * 11.5
92 ounces
3. 1/2 of the students want ham. 1/3 of those do not want mustard
We multiply 1/2*1/3 = 1/6
1/6 of the students do not want mustard on their ham sandwiches
4. 8 hours at the beach. 3/4 of the time was spent playing volleyball
Multiply this together
8*3/4 = 8/4*3 = 2*3 = 6 hours
5. We have 4 lbs of wings. We divide it into 1/8 lbs parts
4 ÷ 1/8
Copy dot flip
4 * 8/1
32 portions
Answer:
Step-by-step explanation:
q is TFTF
~q use negation, not q so is the opposite of q : FTFT
p↔~q use biconditional ,and will be True only is both statements are T or both are F
p values are TTFF ↔~q values are FTFT : FTTF
(p↔~q )∧~q use conjunction, that is True only if both statements are T
(p↔~q ) values are FTTF ∧~q values are FTFT : FTFF
(p↔~q )∧~q → p use a conditional statement, where only True False will give a F
(p↔~q )∧~q values are FTFF → p values are TTFF : TTTT
