Use Euclid’s Ladder (or a factor tree) to write the prime factorization.
2 answers:
You might be interested in
Answer:
Step-by-step explanation:
From the given information.
suppose a multiple choice test consists of 5 questions, each with 4 possible answers of which 1 is correct.:
So, we can now suggest that a person can answer each question in 4 different ways given that there are 5 different questions.
Thus, the students can check off one answer to each question in
= 4 × 34 × 4 × 4 × 4
= 1024 different ways.
From the 4 possible answers, since 1 will be correct, definitely 3 other answers will be incorrect.
Thus, the number of ways a student can check off one answer to each question and get all the answers wrong is = 3⁵
= 3 × 3 × 3 × 3 × 3
= 243 ways