false
OasisLMS
Catalog
Grades 9-10 Video Solutions 2014
Levels 9&10 Video Solutions 2014 problem21
Levels 9&10 Video Solutions 2014 problem21
Back to course
[Please upgrade your browser to play this video content]
Video Transcription
Video Summary
The problem involves the equation \( n \times u \times (m + b + e + r) = 33 \), where each letter represents a different digit from 0 to 9. Since 33 is 3 times 11, \( n \times u = 3 \) and \( m + b + e + r = 11 \). The digits for \( n \) and \( u \) must be 1 and 3. For \( m, b, e, \) and \( r \), the possible digits are 5, 4, 2, and 0, since larger digits don't fit the sum constraint. There are 24 permutations of 4 digits and 2 ways to assign \( n \) and \( u \), totaling 48 combinations. The solution is 48 ways.
Keywords
equation
digits
combinations
permutations
solution
×
Please select your language
1
English