1
Will this close @ [any prime number] % ?
23
resolved Apr 8
Resolved
NO

Close % will be rounded to the nearest integer.

🏅 Top traders

#NameTotal profit
1Ṁ60
2Ṁ53
3Ṁ31
4Ṁ21
5Ṁ15
Sort by:
vincentpearce avatar
vincent pearce

@CalebDitchfield what is your plan on the 10%market?

BoltonBailey avatar
Bolton Baileybought Ṁ0 of NO

Resolves to NO. Not sure why we didn't see a lot of activity in the final seconds.

Lavander avatar
Lavanderbought Ṁ10 of YES

Someone probably just bet in the last 2 seconds anyway in the direction that gives them more profit

CalebDitchfield avatar
Caleb Ditchfieldbought Ṁ100 of YES

Shrug. Could be interesting, due to the fact that primes become more sparse as the odds go up.

Related markets

Are there infinitely many primes of the form n^2 + 1?89%
Are there infinitely many twin primes?88%
Will the next nice number be found by a Proofnik?38%
Are there infinitely many sexy primes?91%
Will the first quantum computer to factor two 2048-bit RSA moduli do so in under a minute?41%
How will a blank-slate AI first prove the infinitude of primes?
Are there any almost perfect numbers that are not powers of 2?17%
Are there any odd perfect numbers?21%
Will the Cipher Challenge close within the range 40% to 60%?20%
Is the Collatz conjecture true?91%
Will the Collatz conjecture be resolved by the end of the decade (11:59, 31 December 2029)?11%
Will the Cipher Challenge close with a percentage within the range of 10% to 90%?72%
Is pi^pi^pi^pi an integer?4%
Will we have a formalized proof of Fermat's last theorem by 2029-05-01?44%
Will we have a formalized proof of Fermat's last theorem by 2049-05-01?89%
What are the prime factors of RSA-2048?
Will the first quantum computer to factor RSA-2048 be a topological quantum computer?32%
Are there infinitely many palindromic primes in base 10?82%
Is Integer Factorization in P?7%
Can integer factorization be solved in polynomial time on a classical computer?4%