What a Coincidence!

Level pending

Let s ( n ) s(n) denote the number of positive integers k k less than or equal to n n such that for all positive integers d d satisfying 1 < d < k 1 < d < k , we have d 2 ∤ k d^2 \not| k . Let t ( n ) t(n) denote the number of positive integers k k less than or equal to n n such that gcd ( k , n ) = 1 \gcd(k, n) = 1 . Find the least positive integer a a such that 20 s ( a ) t ( 20.13 a ) = 0 20s(a) - t(20.13a) = 0


The answer is 100.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...