C and E, I believe since the other theorems don’t exist and AAS does not apply
Answer:
(3)(c) + 43 ≥ 100
Step-by-step explanation:
Given:
Total number of friends = 3 friends
Number of card already have = 43
Total number of card at least want to collect = 100
Find:
Inequality
Computation:
Assume;
Same number of card each friend collect = c
Total number of card at least want to collect ≤ (Total number of friends)(Same number of card each friend collect) + Number of card already have
Total number of card at least want to collect ≤ (3)(c) + 43
100 ≤ (3)(c) + 43
(3)(c) + 43 ≥ 100
Site vandal. Do not answer.
Answer:
Z = 20
Step-by-step explanation:
3 x 20 = 60
60 - 12 = 48
