The given digits are:
\[ \{2, 3, 4, 5, 7\}. \]
A number is divisible by 3 if the sum of its digits is divisible by 3. Identify all cases where the sum of three digits is divisible by 3.
The total number of 3-digit permutations is:
\[ P(5, 3) = 5 \cdot 4 \cdot 3 = 60. \]
Now exclude numbers that are divisible by 3. Compute sums of digits for all groups of three: For digits \( (2, 3, 4), (3, 5, 7) \), etc., find cases where sums like \(2 + 3 + 4 = 9\) (divisible by 3).
Count the total valid cases:
Divisible cases: \(6\) (from permutations of divisible groups).
The remaining numbers are:\[ 60 - 24 = 36. \]
The largest $ n \in \mathbb{N} $ such that $ 3^n $ divides 50! is:
A force \( \vec{f} = x^2 \hat{i} + y \hat{j} + y^2 \hat{k} \) acts on a particle in a plane \( x + y = 10 \). The work done by this force during a displacement from \( (0,0) \) to \( (4m, 2m) \) is Joules (round off to the nearest integer).