/sci/ - Science & Math

do your own homework

>>10325944
Reminds me of this

>>10325944
It's funny how mathematicians think they are above everything, but proving or disproving this, would mean nothing, because it DOES NOT LOOK FOR THE SOLUTION, it just makes you sure quick solution exist.

>>10325944
We've been over this, I did find the pattern in it, and even posted the formula for it here in sci. Here is the same info in a single function.

>>10325944
>>10327430
And here is the formula for the pattern in one of its forms, there are others.

>>10327430
>>10327432
Clearly not the same pattern

>>10325944
have you heard of tesla's 3 6 9?

>>10325944
Looks like yin and yang.

What's the yin yang formula?

There will never be a formula to predict all primes.

>>10327646
There are plenty, we just don't have infinite memory to store every single prime.

>>10327649
I said for all primes.

>>10327526
It is the same pattern, they are both just sieves of Eratosthenes.

>>10327646
There already is, for all primes, that can calculate the nth prime.

>>10327650
Yes, we have those https://en.m.wikipedia.org/wiki/AKS_primality_test Earasthothenes sieve is enough,.

>>10327432
Is it simultaneously able to find any prime number without requiring previous primes? And why haven't you claimed your $150,000 reward from The Electronic Frontier Foundation yet by simply finding a 100-million-digit prime?

>>10327802
you have to set his equation equal to 2 for large enough j and then solve for x
thats probably not analytically or computationally reasonable

>>10327802
Yes it can find any prime without requiring all previous primes, it skips chunks of numbers at a time as it hones in on the answer. It can be shown to run in at least polynomial time if not faster. However it isn't very efficient, but it is right. Just because it runs in polynomial time doesn't mean I have a machine that could spit out a prime with 100-million digits. If I plug 10^100,000,000 into it, it will absolutely spit out the 10^100,000,000th prime number, which has at least 100 million digits, but again would take a supercomputer. However, I have a modular version that I think runs a lot faster, and I'm always looking for people to improve my equations.

>>10327988
The graph is set to 2 like you said, that formula is set to 1. And while what you said was true as a way to use it as a test, I have another manipulation of that function that just cranks out the answer, so there is no solving for part, just plug and go.

The pic were the hops it took to find the 20th prime. Again, not efficient, but it works. It will also always list all the numbers between the previous prime and the one you asked it to find, so it always ends up passing through the n-1th prime. I'm sure people could clean up what I have.

>>10327988
oops, both pic and equation were 1 ,not 2, but you had the idea.

>>10328199
yeah, you can change the beginning index to k=2 and set j=x
then you can set that function equal to 1 and still get the solution set to be the primes

We don't need a prime generator

We need an easy method to determine whether something is prime