This mystery number has 3 digits.Its digits are in the descending order. The hundreds' digit is two more than the ones' digit. If you add the 3 digit it gives you a dozen. Guess this mystery number?
If the digits are in strict descending order, then they must be [n+1]n[n-1], the sum of which is 12, i.e.
n+1 + n + n-1 = 12
Solve for n.
The hundred digit is two more than the ones.
If you add three it will be 12.
Which means the hundreds is 12-3=9
To find the ones 9 - 2=7
Now we found 9_7.
To finish for sure the decending means 8
So the answer is 987.
To solve this mystery number riddle, we need to analyze the given information and deduce the correct answer.
First, we know that the number has 3 digits and the digits are in descending order. Let's represent the mystery number as ABC, where A is the hundreds' digit, B is the tens' digit, and C is the ones' digit.
Next, we are told that the hundreds' digit is two more than the ones' digit. So, A = C + 2.
Additionally, we are given the clue that if we add the three digits together, it gives us a dozen, which means the sum is equal to 12: A + B + C = 12.
Now, let's use this information to find the mystery number.
Since the digits are in descending order, A > B > C.
We can start by considering the possible values of C, the ones' digit:
If C = 0, then A = 2 (since A = C + 2). However, if A = 2, B cannot be a digit between 0 and 2, which means this combination does not work.
If C = 1, then A = 3 (since A = C + 2). Now, using the equation A + B + C = 12, we can substitute the values: 3 + B + 1 = 12. By solving for B, we find B = 8. Therefore, the mystery number is 381.
If C = 2, then A = 4 (since A = C + 2). Similar to the previous step, we substitute the values: 4 + B + 2 = 12. By solving for B, we find B = 6. Hence, the mystery number is 462.
However, we are given that the hundreds' digit is two MORE than the ones' digit (A = C + 2). Therefore, the only valid solution is when C = 1. Thus, the mystery number is 381.
In summary, the mystery number that satisfies all the given conditions is 381.