Timeline for How does this sequence grow
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 12, 2014 at 10:36 | comment | added | Jeremy Rouse | @David - Your formula and mine are the same if $p > 2$. Note that Ceiling[2/8] = 1. | |
| Jun 11, 2014 at 22:31 | comment | added | The Masked Avenger | You could also say floor((p+7)/8) for all odd primes, and floor (p/8) for all even primes. | |
| Jun 11, 2014 at 21:47 | comment | added | David S. Newman | There's something not displaying properly in my computer's rendition of the formula for the number of solutions. Thanks for the answer. My purely experimental version of the formula is Ceiling[p/8] with no exceptions as far as I carried the computation. | |
| Jun 11, 2014 at 21:08 | vote | accept | David S. Newman | ||
| Jun 11, 2014 at 17:17 | history | answered | Jeremy Rouse | CC BY-SA 3.0 |