Fundamental Principle of Multiplication:
Let us suppose there are two tasks \(\mathrm{A}\) and \(\mathrm{B}\) such that the task \(\mathrm{A}\) can be done in \(m\) different ways following which the second task \(\mathrm{B}\) can be done in \(\mathrm{n}\) different ways. Then the number of ways to complete the task \(\mathbf{A}\) and \(\mathrm{B}\) in succession respectively is given by: \(\mathrm{m} \times \mathrm{n}\) ways.
Fundamental Principle of Addition:
Let us suppose there are two tasks \(A\) and \(B\) such that the task \(A\) can be done in \(\mathrm{m}\) different ways and task \(B\) can be completed in \(n\) ways. Then the number of ways to complete either of the two tasks is given by: \((m+n)\) ways.
Here, we have to find how many 3 -digit numbers can be formed without using the digits \(0,2,3,4,5\) and 6 .
i.e we have to find how many 3 -digit numbers can be formed using the digits \(1,7,8,9\).
Clearly, repetition of digits is allowed.
The number of ways to fill unit's digit \(=4\)
The number of ways to fill ten's digit \(=4\)
The number of ways to fill hundred's digit \(=4\)
\(\therefore\) Total number of required numbers \(=4 \times 4 \times 4=64\)