Return to Revisions

2 of 2

added 2 characters in body

edited Feb 7, 2013 at 14:07

343
1
6

Inequality with Euler's totient function

Numerical analysis of the first several hundred n suggests the following inequality:

$\varphi(3^n-2) \ge 2\cdot3^{n-1}$

nt.number-theory

asked Feb 7, 2013 at 13:13

343
1
6