Finding a number of twin primes less than a certain number I was doing some problems on number theory, and I came across the following question: "How many twin primes less than 100 exist?" I was wondering if anyone could tell me what method would be used to solve this problem and others too.
Thanks!

HINT.Only I think to see Wilson's theorem and (because of primes less that $100$) looking for solutions of the two congruences
$$(p-1)!+1\equiv 0 \pmod p$$ $$(p+1)!+1\equiv 0 \pmod {p+2}$$
Paying some attention this could work, I guess. However for primes $p$ larger, verification in tables of primes or twin primes could be the only "method"
