How many ways are there to choose a three-element subset from the set such that the three elements share no positive factors (other than )?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let's consider all possible three-element subsets: ( 3 2 5 ) We will now eliminate all the triplets with a common factor. We'll only consider the triplets with a prime common factor since all triplets with a composite common factor are also triplets with a prime common factor. Let's consider the case in which the common factor is 2, we have to find the number of triplets made only by even numbers. Since there are only 12 even numbers between 1 and 25, the number of even triplets is ( 3 1 2 ) . Now let's find the number of triplets with the common factor three. Since there are 8 numbers divisible by 3 between 1 and 25, the number of those triplets is ( 3 8 ) . There's only one problem, some triplets with the common factor 3 are already included in the even triplets, these triplets would have a common factor of 6, so by removing them from ( 3 8 ) , we get ( 3 8 ) - ( 3 4 ) . Great, now, applying the same reasoning to triplets with common factor 5 we get ( 3 5 ) , and for triplets, with common factor 7, we get ( 3 3 ) . There aren't any triplets with common factor 11, since there are only 2 multiples of 11 between 1 and 25, same goes for bigger primes.
Let's now combine all of our previous results:
( 3 2 5 ) − ( 3 1 2 ) − ( ( 3 8 ) − ( 3 4 ) ) − ( 3 5 ) − ( 3 3 ) = 2 0 1 7
And that is the answer. I'm sorry if this was hard to read, I'm not English and I'm not good at writing down my thoughts.