Publishable?

[dendisuhubdy]

Hey @MartinMystery! This was inspired by your algorithm and post on MathOverflow.net.

Would you think we could publish this?

@obilaniu

[MartinMystery]

Hi @dendisuhubdy ! Publish it if you wish . It's ok with me .

[dendisuhubdy]

@MartinMystery no I mean, could we publish it together?

[MartinMystery]

@dendisuhubdy Oh , I see ...I suppose you think we could publish this on the arXiv .

[MartinMystery]

@dendisuhubdy As far as I know the only journal that publishes conjectures is Experimental Mathematics .

[dendisuhubdy]

@MartinMystery yes on Arxiv would be cool!

[MartinMystery]

@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 .

[dendisuhubdy]

@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.

[MartinMystery]

@dendisuhubdy Hi! To what upper bound you have verified the conjecture? Did you find any counter-example?

[dendisuhubdy]

@MartinMystery @obilaniu let me rerun the computations, would take a couple of days

[dendisuhubdy]

https://www.overleaf.com/project/5e9810d1782a1b00013b4082

[MartinMystery]

@dendisuhubdy I am getting the following message: "Restricted, sorry you don't have permission to load this page."

[dendisuhubdy]

I think I forgot to add some shared settings. Will do in the morning @MartinMystery