Let S ( n ) be the number of subsets { a , b } of the set { 1 , 2 , 3 , . . . . , 1 0 0 0 } such that n ∣ a b .
Find S ( 1 3 ) − 2 ∗ S ( 3 1 ) .
Notes:
The elements a and b must be distinct.
By " n ∣ a b " I mean that n divides a b .
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.
Log in to reply
x = ⌊ p 1 0 0 0 ⌋ indicates the number of (positive) multiples of p less than or equal to 1 0 0 0 . So if p = 1 3 we have x = ⌊ 1 3 1 0 0 0 ⌋ = 7 6 since 7 6 ∗ 1 3 = 9 8 8 is the greatest multiple of 1 3 that is ≤ 1 0 0 0 .
Note that the ⌊ . . . ⌋ symbols indicate the floor function, which returns the greatest integer less than or equal to the enclosed value.
Problem Loading...
Note Loading...
Set Loading...
If n = p a prime then if p ∣ a b then either p ∣ a or p ∣ b , (or both).
Say p divides only one of the elements. Without loss of generality let this element be a . There are then x = ⌊ p 1 0 0 0 ⌋ numbers to choose from for a and 1 0 0 0 − x numbers to choose from for b . This gives us x ( 1 0 0 0 − x ) subsets.
If p divides both a and b then we have ( 2 x ) subsets to add to the total.
Thus for n = p prime, we have S ( p ) = x ( 1 0 0 0 − x ) + ( 2 x ) , where x = ⌊ p 1 0 0 0 ⌋ .
For p = 1 3 we have x = 7 6 and S ( 1 3 ) = 7 6 ∗ 9 2 4 + ( 2 7 6 ) = 7 3 0 7 4 .
For p = 3 1 we have x = 3 2 and S ( 3 1 ) = 3 2 ∗ 9 6 8 + ( 2 3 2 ) = 3 1 4 7 2 .
Thus S ( 1 3 ) − 2 ∗ S ( 3 1 ) = 7 3 0 7 4 − 2 ∗ 3 1 4 7 2 = 1 0 1 3 0 .