Timeline for g.c.d. and Euler's totient function
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 19, 2013 at 9:04 | vote | accept | Venkataramana | ||
| Feb 19, 2013 at 9:04 | |||||
| Dec 4, 2012 at 1:30 | history | made wiki | Post Made Community Wiki by Zack Wolske | ||
| Nov 20, 2012 at 2:30 | comment | added | Venkataramana | Yes, I do mean that $a_0{\mathbb Z}+\cdots+a_n{\mathbb Z}={\mathbb Z}$. In other words, the coefficients of $P$ do not have a common factor. | |
| Nov 19, 2012 at 21:33 | comment | added | Igor Rivin | Of course, it is not known whether there exists an infinite collection of Sophie Germain primes :( | |
| Nov 19, 2012 at 21:32 | comment | added | KConrad | Your observation is compatible with the possibility that the gcd of the $\varphi$-values is bounded by a constant depending only on the degree of the polynomial. | |
| Nov 19, 2012 at 20:02 | history | answered | Zack Wolske | CC BY-SA 3.0 |