There are only four possible three terms AP exist, which are < 1, 2,3 >, < 2, 3,4 >, < 3, 4, 5> and < 1,
3,5>ConsiderthesetsA= < 1,2,3>
arepresentinthesequenceB= < 2,3,4>
arepresentinthesequenceC= < 3,4,5>
arepresentinthesequenceD= < 1,3,5>
arepresentinthesequence∵n(A)=n(B)=n(C)=n(D)=5C3⋅2⋅2=40n(A∩B)=n(B∩C)=5C4⋅2=10n(A∩C)=1+6×2=13n(A∩D)=5C4⋅2=n(C∩D)=10n(B∩D)=4⋅∣2∣2=16n(A∩B∩C)=2n(B∩C∩D)=4n(A∩C∩D)=2n(A∩B∩D)=4 and n(A∩B∩C∩D)=2 Now n(A∪B∪C∪D)=4(40)−69+12−2=101 So number of flawless 5-tuples =5−101=19$