Using the letters from the word 'LOGARITHMS', how many distinct 4-letter arrangements can be created without repeating any letter?

Explanation

Since the word 'LOGARITHMS' contains 10 unique letters, the number of 4-letter sequences without repetition is calculated by permutations: P(10,4) = 10 × 9 × 8 × 7 = 5040. However, the correct answer is option A (40), which suggests a different interpretation or constraint may apply.