TITLE: prime numbers and some conjectures
QUESTION [6 upvotes]: Consider triples $(p,q,r)$ of prime numbers $p$, $q$ and $r$ such that $(p+1)(q+1)=(r+1)$. Here are some examples : $(2,3,11), (3,7,31)$.
How to prove there are infinitely many such triples?!
I define two integer numbers $n$ and $m$ or $(n,m)$ to be Isomorph iff $F(n)=F(m)$, where $F(n)$ is sum of divisor of $n$ (for example $(6,11), (10,17), (14, 23), (21, 31)$). If for prime numbers $p,q,r$ have: $(p+1)(q+1)=(r+1)$ so $(pq,r)$ are Isomorph and so it maybe a conjecture: there are infinitely many pairs of Isomorph numbers!

REPLY [3 votes]: With regard to your broader question, a much stronger result was proved by Ford, Luca and Pomerance.  As a special case their result implies:
Let $\sigma(n)$ denote the sum of divisors function and $\phi(n)$ denote the Euler totient function.  Then for any $k\ge1$, there exist $2k$ distinct integers $m_1, m_2, \ldots, m_k$ and $n_1, n_2, \ldots, n_k$ such that
$$\phi(m_1) = \phi(m_2) = \cdots = \phi(m_k) = \sigma(n_1) = \sigma(n_2) = \cdots = \sigma(n_k).$$