X Tutup

The Wayback Machine - https://web.archive.org/web/20220111020101/https://github.com/TheAlgorithms/Java/issues/2885

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.

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

Add NewManShanks Algorithm #2885

Open

uditkhanna112 opened this issue Dec 31, 2021 · 1 comment

Assignees

uditkhanna112 commented Dec 31, 2021

No description provided.

siriak assigned uditkhanna112

Deeeeksha commented Jan 2, 2022

In mathematics, a Newman–Shanks–Williams prime (NSW prime) is a prime number p which can be written in the form:

{\huge S_{2m+1} = \frac{ {(1+\sqrt{2})^{2m+1} + (1-\sqrt{2})^{2m+1} } }{2} }

We can implement this approach by DP Approach.

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

X Tutup