Let $A=\{i: 1 \leq i \leq n\} \subset \mathbb{N} $ and $B \subset A$, $|B|=k$ ($k < n$). What's the probability that $\gcd(B)>1$?
EDIT: $n$ and $k$ are given. I think this can be solved with inclusion-exclusion principle?
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
||||
|
