A long time ago one of my classmates claimed he discovered a formula for prime numbers and he became so famous among students and our teacher.
If we have two digits twin prime numbers (primes which differ by two) by adding $40$ to larger number we can generate a prime number.
For example consider $(11,13)$ then $53$ is also prime or for $(71,73)$, $113$ is also a prime number.
Amazingly it works for all two digits numbers! However its weakness is that it only works for two digit numbers.
So I wonder was it a known formula and my classmate found it somewhere or he really did discovered it?
Also is it possible to prove this works without checking for all two digits twins ?
This is partly because in many cases the larger one of the $2$-digit twin-prime numbers is of the form $n(n+1)+1$. So adding $40$ gives a prime. This is a consequence of the well-known prime generating formula $f(n)=n^2+n+41$. First contradiction occurs at $n=41$, which gives a 3-digit composite number. There are only $2$ exceptions, $(17,19)$, and $(59,61)$, these are coincidental.