-
Notifications
You must be signed in to change notification settings - Fork 3
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
Publishable? #2
Comments
Hi @dendisuhubdy ! Publish it if you wish . It's ok with me . |
@MartinMystery no I mean, could we publish it together? |
@dendisuhubdy Oh , I see ...I suppose you think we could publish this on the arXiv . |
@dendisuhubdy As far as I know the only journal that publishes conjectures is Experimental Mathematics . |
@MartinMystery yes on Arxiv would be cool! |
@dendisuhubdy I think that the upper bound for which the conjecture has been verified to hold is too small . It should be at least 10^10 . |
@MartinMystery @obilaniu we're doing a check from 0-2^64 which is around 1.8446744e+19. We passed 10^10 already. So far the algorithms run on average 250 microseconds per primality test on an integer. |
@dendisuhubdy Hi! To what upper bound you have verified the conjecture? Did you find any counter-example? |
@MartinMystery @obilaniu let me rerun the computations, would take a couple of days |
@dendisuhubdy I am getting the following message: "Restricted, sorry you don't have permission to load this page." |
I think I forgot to add some shared settings. Will do in the morning @MartinMystery |
Hey @MartinMystery! This was inspired by your algorithm and post on MathOverflow.net.
Would you think we could publish this?
@obilaniu
The text was updated successfully, but these errors were encountered: