Let the 3-digit number be represented as \( abc \), where \( a, b, c \) are its digits.
We are given the condition:
\[ 2 < a \times b \times c < 7 \]
So the possible values of the product are:
\[ 3,\ 4,\ 5,\ 6 \]
Valid values for \( x \) are 3, 4, 5, and 6. That gives us 4 sets:
Each set can be arranged in 3 ways, so total = \( 4 \times 3 = 12 \) numbers
Digits = (2,2,1), which can be arranged in:
\[ \frac{3!}{2!} = 3 \text{ ways} \]
Digits = (1,2,3), all distinct. Number of permutations:
\[ 3! = 6 \text{ ways} \]
\[ 12 + 3 + 6 = \boxed{21} \]
21 valid numbers satisfy the condition \( 2 < a \times b \times c < 7 \).
The largest $ n \in \mathbb{N} $ such that $ 3^n $ divides 50! is:
When $10^{100}$ is divided by 7, the remainder is ?