hey, say i made a formula to find any prime number. would

it would be, but you're probably full of shit

>>8483377
if you did then you would know how valuable it is ergo you're totally full of shit
also sage

File: sage.jpg (4KB, 150x150px) Image search: [Google]

4KB, 150x150px

>>8483377
pics or it didn't happen

>>8483385
Why would I be? I'm good at patterns, math is literally just a bunch of patterns, I knows its used in some cryptography but thats about it.

>>8483428
that kinda defeats the purpose on making money of it doesn't it?

>>8483377
oh fuck, so I actually just cracked encryption? is this going to do to much damage to the world should I just destroy it?

>>8483377
>find any prime number
>any

what does this mean?

>>8483581
they can't hide from us.

5

want another?

>>8483590
holy shit guys he's telling the truth

>>8483590
yeah give me the 130985291385923rd prime
if you can't you're full of shit

>>8483590
Give me a prime number at least 2^74207281 digits long and I will check it in a program I write in C++

:^)

File: 1475595884622.jpg (40KB, 309x365px) Image search: [Google]

40KB, 309x365px

>>8483385
Step 1. Start from [math]k = 1[/math]
Step 2. If [math](k-1)! \equiv -1 (\text{mod } k)[/math], number is prime. Otherwise, it's not.
Step. 3 [math]k++[/math] and repeat step 2.

Give me money now

>>8483654
computing the factorial for each number becomes extremely costly past a certain point.
You can try to use dynamic programming (aka memorize the result of each step to avoid having to recompute it) but then you use both space and time
The problem isn't generating and verifying prime numbers, it's doing it at the scale of prime numbers used for cryptography (which are thousands of bits big)

>>8483711
and I forgot to mention, just finding a prime number isn't the most difficult part. Encryption isn't as simple as having a really big prime number and doing some math with it to easily encrypt/decrypt the message. You often use more than one huge prime number in cryptography.
Look at RSA for example, one of the most famous and used cryptosystem.

https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Encryption
https://en.wikipedia.org/wiki/RSA_Factoring_Challenge

>>8483377
hope you are on a proxy
since NSA is going to murder you now

>>8483377
You're about 2,200 years too late. However, if you developed an algorithm that could determine if a number n was prime without having to test it against every odd number between 2 and n / 2, then you'd have something.

>>8483719
you can choose to only test numbers of the form

6k+1 or 6k+5

>>8483654
There exist much faster primality tests already

whats the biggest prime number?

>>8483975
What's the biggest integer?

>>8483982
probably not a prime number

so its bigger than the biggest prime number

whats the biggest prime number?

>>8483975
17

>>8484012
There isn't one

>>8483377
only if it can fit on a regular sized bedroom window

Sieve of Eratosthenes you numbskulls

File: Russian-hacker.jpg (65KB, 558x377px) Image search: [Google]

65KB, 558x377px

>>8483377
what you should all be asking yourselves is:

what is the smallest prime number, the one that causes the wavefunctions of all other primes to collapse, forming a number which is equal to every prime number in existence

this number could solve any problem relating to any prime

just a hint.

>>8483654
damnit it was already solved? lol

>>8483606
A mechanism to generate all the primes doesn't mean you can pick out the nth prime to generate for some particular n.