Timeline for Estimate for products of integers that are relatively prime with $N$
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 2, 2012 at 12:41 | answer | added | vlk | timeline score: 2 | |
| May 21, 2012 at 10:40 | comment | added | vlk | Many thanks for the formula. I am trying to understand what one can get concerning the asymptotics. Any help is still appreciated. | |
| May 20, 2012 at 23:26 | comment | added | Gerry Myerson | I'm surprised that no one has thought to look this up at the Online Encyclopedia of Integer Sequences, where it is oeis.org/A001783. There you will find the formula given in the answers here, with a reference to Apostol's textbook on Analytic Number Theory. I don't think anything there deals in asymptotics. | |
| May 20, 2012 at 12:43 | answer | added | Daniel m3 | timeline score: 4 | |
| May 18, 2012 at 18:53 | answer | added | Gerhard Paseman | timeline score: 1 | |
| May 18, 2012 at 13:42 | comment | added | Gerhard Paseman | It may be that the rough guide needs to be divvided by e^phi(n) to make it less rough. Gerhard "Maybe Stirling's Approach Would Work" Paseman, 2012.05.18 | |
| May 18, 2012 at 13:23 | comment | added | Gerhard Paseman | As a rough guide (n!)^(phi(n)/n). One can use an inclusion exclusion type formula to get more exact. Also, for n prime one has the exact formula (n-1)! . Gerhard "Ask Me About System Design" Paseman, 2012.05.18 | |
| May 18, 2012 at 11:44 | comment | added | Martin Brandenburg | Maybe mathoverflow.net/questions/97041/… is relevant. | |
| May 18, 2012 at 10:32 | history | asked | vlk | CC BY-SA 3.0 |