How many ways are there to pick three distinct numbers from the integer interval [1, . . . , 15] such that the sum of the numbers is divisible by three?
Answers
Answered by
0
Answer:
We can select 6, 9, 12, 15
so we have 4 numbers
therefore, total ways = 4!
= 4×3×2×1
= 24
THANK U ❣️
PLEASE FOLLOW AND MARK THIS ANSWER AS BRAINLIEST ❤️
Similar questions