Comment on Open thread for December 17-23, 2013

Thu, 19 Dec 2013 07:35:51 GMT

How about the statements:

A: "The number of prime factors of 4678946132165798721321 is divisible by 3"

B: "The number of prime factors of 9876216987326578968732678968432126877 8498415465468 5432159878453213659873 1987654164163415874987 3674145748126589681321826878 79216876516857651 64549687962165468765632 132185913574684613213557 is divisible by 2"

P(F(A)) is about 1/3 and P(F(B)) is about 1/2.

But it's far more likely that someone will bother to prove A, just because the number is much smaller.

ETA: To clarify, I don't expect it to be particularly hard to prove or disprove, I just don't think anyone will bother.

Discuss