Skip to main content
17 events
when toggle format what by license comment
Sep 27, 2019 at 21:41 vote accept cupcake111680
Sep 27, 2019 at 21:41 vote accept cupcake111680
Sep 27, 2019 at 21:41
Sep 27, 2019 at 21:41 vote accept cupcake111680
Sep 27, 2019 at 21:41
Sep 27, 2019 at 17:12 answer added WhatsUp timeline score: 4
Sep 27, 2019 at 16:40 comment added cupcake111680 @WhatsUp An algorithm would do if there is no closed-form expression
Sep 27, 2019 at 16:09 comment added WhatsUp Do you need a closed-form expression, or just a sufficiently fast algorithm to evaluate the sum (e.g. for some math-programming puzzle)?
Sep 27, 2019 at 8:01 answer added Greg Martin timeline score: 5
Sep 27, 2019 at 7:03 comment added cupcake111680 @user35593 I did, actually, and it didn't yield anything useful.
Sep 27, 2019 at 6:49 comment added user35593 Did you try computing the first few elements and enter it on oeis.org?
Sep 27, 2019 at 6:09 history edited cupcake111680 CC BY-SA 4.0
deleted 11 characters in body
Sep 27, 2019 at 6:01 comment added cupcake111680 @user35593 Correct -- but how do we get a closed form for all $n$, $p$?
Sep 27, 2019 at 5:50 comment added user35593 The observation follows because then p and i are coprime and then we have $\phi(pii)=\phi(p)\phi(i)$
Sep 27, 2019 at 4:30 history edited cupcake111680 CC BY-SA 4.0
added 94 characters in body
Sep 27, 2019 at 4:09 comment added cupcake111680 @AlexeyUstinov Yes, a closed-form expression is preferred.
Sep 27, 2019 at 3:59 comment added Alexey Ustinov Do you need closed-form expression exactly? It will be easyer to prove asymptotic formula for this sum.
Sep 27, 2019 at 3:40 review First posts
Sep 27, 2019 at 3:42
Sep 27, 2019 at 3:35 history asked cupcake111680 CC BY-SA 4.0