Timeline for An inequality for the Euler totient function
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2017 at 20:05 | comment | added | Kevin Buzzard | I think by $x$ he means $x$ (and $k$ depends on $x$ and $n$ depends on $k$). I don't think the same ideas work for the linked question because the condition about being the biggest prime can't be incorporated. | |
| Jan 6, 2017 at 18:22 | comment | added | T. Amdeberhan | @OfirGorodetsky: By $x$ you mean $n$. Anyways, you might be able to use your idea to the problem here: mathoverflow.net/questions/258852/… | |
| Jan 6, 2017 at 16:38 | comment | added | Kevin Buzzard | This is a much better approach than mine as it involves 0 computation, although of course I get better bounds ;-) ($p=73,89,...$) | |
| Jan 6, 2017 at 16:29 | history | edited | Ofir Gorodetsky | CC BY-SA 3.0 |
edited body
|
| Jan 6, 2017 at 16:24 | history | answered | Ofir Gorodetsky | CC BY-SA 3.0 |