I can only give possible combination of the ages. Had the sum of the ages been given, then the 3 specific numbers would have been derived.
We need to do prime factorization of 72.
72 ÷ 2 = 36
36 ÷ 2= 18
18 ÷ 2 = 9
9 ÷ 3 = 3
3 ÷ 1 = 1
1 x 2 x 2 x 2 x 3 x 3 = 72
Possible combinations:
1 x 8 x 9 = 72 1 + 8 + 9 = 18
1 x 4 x 18 = 72 1 + 4 + 18 = 23
2 x 4 x 9 = 72 2 + 4 + 9 = 15
3 x 4 x 6 = 72 3 + 4 + 6 = 13
C. −6, is the best option
Answer:
Step-by-step explanation:
GIVEN: two two-letter passwords can be formed from the letters A, B, C, D, E, F, G and H.
TO FIND: How many different two two-letter passwords can be formed if no repetition of letters is allowed.
SOLUTION:
Total number of different letters 
for two two-letter passwords 
different are required.
Number of ways of selecting different letters from 
letters
Hence there are different two-letter passwords can be formed using letters.
The prove that the equation can be verified using the laws of exponents.
<h3>What is the proof of the equation given; 2^(2x+4)= 16 × 2^(2x)?</h3>
It follows from the task content that the equation given is; 2^(2x+4)= 16 • 2^(2x).
It follows from the laws of indices ; particularly, the product of same base numbers.
The evaluation is therefore as follows;
2^(2x+4)= 16 • 2^(2x)
2^(2x) • 2⁴ = 16 • 2^(2x)
2^(2x) • 16 = 16 • 2^(2x)
Hence, since LHS = RHS, it follows that the expression is mathematically correct.
Read more on laws of exponents;
brainly.com/question/847241
#SPJ1
Answer:
Step-by-step explanation:
