New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Sieve method section #2

Open

ohmygauss opened this issue Feb 17, 2014 · 2 comments

ohmygauss commented Feb 17, 2014

Quick issue with method section:

2n = 2kj + k - 1
=> 2n + 1 = k (2j+1),

not 3kj.

Owner

videlalvaro commented Feb 17, 2014

which part? I kinda I understand what you mean but I don't :D

Author

ohmygauss commented Feb 17, 2014

Where you are QEDing a proof for sieve constraints.

Lastly, n = 5, 2n +1 = 11, and this works for a sieve but the n < k < sqrt(2n+1) does not hold true here, you might want to refine this.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment