How do you make this formula in gimkit?

You gotta solve the Riemann hypothesis for the money- then a formula is derived from the solution of that to get a simple prime number pattern, or something like that.

1 Like

Good luck :slight_smile:

Huh? Don’t confuse me any more? Also, thanks for the luck, I will need it.

3 Likes

Why ever, in the great heavens and in the fiery underworld would you need math? I am deeply confused.

1 Like

yeah isnt like that thing where its the question where you need to find a number that doesnt go back to 1?

I was guessing it wasnt fake

I have a start on it.
For all numbers greater than 1, I have found that
n^2 + (n-1) = a prime number.
However, this does not produce all prime numbers, and might not work if we go into higher numbers. It is a start though.

3 Likes

Case break-

f(7) = 55

Empathetic guy question? would you split the money with someone on the forums if you got it correct?

Ooh more stuff
6n + 1

You guys gotta start checking past the first few numbers lol
n = 4 breaks it

Oh come on! You really had to ruin it!

Yeah, but that is the only one out of integers 2-10. Maybe if the final result divided by 11 is greater than 1, it doesn’t work. Also, 4 works. 16 + 3 = 19, a prime number.

I got it 6n + 1 or 6n – 1 it’s the holy formula!

Why! What is this infernal math! I am going bloody mad!

Did you get that by looking it up? That isn’t always true, I don’t think.

I should have clarified:
4 breaks fusionlords solution
7 breaks your solution

1 Like

Nice joke Sir Quillius Inkpot!

New one! There’s a new one

Indeed- double primes are somewhat common, but not every prime has another that is 2 away from it.

1 Like

It is not a joke! I am actually going mad! I have enough struggles just being on the forums! No need to get bloody math involved!

1 Like