Let $m$ be a fixed integer. I want to count number of prime triplet $(p,q,r)$ such that $p < q < r < 2p$ with $m$ divides $p-1, q-1$ but not $r-1$ and the product $pqr$ is an $l$ digit integer.
Counting the number of prime triplet
user15864
- 191
- 5