From the idea of Combinatorial sieve we know $$\sum_{\substack{d|(m,P_z) \ d \in D^{-}}} \mu(d) \leq \sum_{d|(m, P_z)} \mu(d)$$ and $$\sum_{\substack{d|(m+2,P_z) \ d \in D^{+}}} \mu(d) \geq \sum_{d|(m+2, P_z)} \mu(d)$$ my question is sum $$\sum_{m \in A} \left( \sum_{\substack{d|(m,P_z) \ d \in D^{-}}} \mu(d)\right) \left( \sum_{\substack{d|(m+2,P_z) \ d \in D^{+}}} \mu(d)\right) $$ can be a lower bound for numbers of elements $m \in A$ such that $m, m+2$ are both co-prime to $P_z$?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
0
|
||||
|
