Skip to content
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

How Hard can it Be? #3

Open
mwelinder opened this issue Aug 25, 2020 · 1 comment
Open

How Hard can it Be? #3

mwelinder opened this issue Aug 25, 2020 · 1 comment

Comments

@mwelinder
Copy link

https://www.wolframalpha.com/input/?i=Select%5BConvergents%5BPi%2F2%2C100%5D%2CPrimeQ%5BNumerator%5B%23%5D%5D%26%5D

that gives you...

{2,
3/2,
11/7,
4846147/3085153,
411557987/262005952,
1169809367327212570704813632106852886389036911/744723773141314414542111064094745678855643069,
7809723338470423412693394150101387872685594299/4971824293990828375535640163674073854638853330}

The numerators are primes with very large tangents.
@been-jamming
Copy link

I was wondering the same thing; I left a pull request.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@been-jamming @mwelinder