If some is wondering what in the world I'm doing to compute n, it's about this: every prime number larger than 3 is of the form 6 k ± 1. With a little manipulation it could be rewritten as 3/2 + 3 h + (-1)h + 1 / 2.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
JavaScript:
If some is wondering what in the world I'm doing to compute
n
, it's about this: every prime number larger than 3 is of the form 6 k ± 1. With a little manipulation it could be rewritten as 3/2 + 3 h + (-1)h + 1 / 2.