Quote:
The letters A, D, R, O, I, and T can be used to form 6-letter strings as ADROIT or TDAROI. Using these letters, how many 6-letter strings can be formed which neither begin with T nor end in A?
A. 6,480
B. 720
C. 528
D. 504
E. 480
Remembering the 2-set overlapping formula helped me in solving this effectively.
Question asks for neither begin with T, nor end in A.
In 2-set overlap, Total items = (items in set A) + (items in set B) - (items in set A and B) + (items neither in Set A, nor in Set B)
Here, Total items = Number of possible 6-letter strings
Set A = strings that begin with T
Set B = strings that end in A
Items in Set A and B = strings that begin with T and end in A
Items neither in Set A, nor in Set B = what we have to find.
Rewriting it in shorthand, we get, T = A + B - AB + N
N = T - A - B + AB
T = Arranging 6 letters to make 6-letter strings = 6! = 720
A = strings that begin with T = T is fixed in the first spot, remaining 5 spots can be taken by remaining 5 letters in 5! ways = 120
B = strings that end in A = A is fixed in the last spot, remaining 5 spots can be taken by remaining 5 letters in 5! ways = 120
AB = strings that begin with T and end in A = T is fixed in the first spot, A is fixed in the last spot, remaining 4 spots can be taken by remaining 4 letters in 4! ways = 24
N = 720 - 120 - 120 + 24 = 504.
Answer D.