Effectively computable bounds for the solutions of certain diophantine equations
A positive integer n is called E-symmetric if there exists a positive integer m such that |m-n| = (ϕ(m),ϕ(n)), and n is called E-asymmetric if it is not E-symmetric. We show that there are infinitely many E-symmetric and E-asymmetric primes.