Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#51 2014-02-10 08:06:10

bobbym
bumpkin
From: Bumpkinland
Registered: 2009-04-12
Posts: 109,606

Re: need help in simple computation for my thory

Actually according to wave theory I think Im able to find every next prime

Well of course you can as long as you want to keep on calculating the sky is the limit.

but it have to be formed as formula

Hmmm.

Do you know where I could download lot of primes to verify results?

Have you checked google yet?


In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.

Offline

#52 2014-02-10 21:49:12

martnSpruce
Member
Registered: 2014-02-08
Posts: 25

Re: need help in simple computation for my thory

I have found only complete list for 1-10^10

BTW some funny coincidence found by this theory. Pimes in range x-y are always in reverse order after given interval and the interval is always easy to compute for each primes group. So after you know Primes in range 1-10000000 you also know primes in 10000000-19999999 without computation.
So if I had 'big enough' calculator I could give you about 20 numbers where you could find prime with at least 100,000,000 decimal digits. I hope research will give more accurate result.
Also Im able to get <= number of primes for some ranges (which means there is never more than X primes in given range). I hope more research will give me exact number of primes in given range.

Last edited by martnSpruce (2014-02-10 22:02:51)

Offline

#53 2014-02-10 23:16:34

bobbym
bumpkin
From: Bumpkinland
Registered: 2009-04-12
Posts: 109,606

Re: need help in simple computation for my thory

So after you know Primes in range 1-10000000 you also know primes in 10000000-19999999 without computation.

Nothing mysterious about that. You only have to sieve numbers from 1 to √n. Then you will know all the primes up to n.

For instance to find all the primes from 2 to 1000 you just sieve up to n = 37 or so. This seems to be a great time saver at first but as those primes get larger and larger it is not.


In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.

Offline

#54 2014-02-12 00:31:35

martnSpruce
Member
Registered: 2014-02-08
Posts: 25

Re: need help in simple computation for my thory

I wasnt thought about that kind of computing.
Anyway reserch goes further thanks to few guys that helped me with to educate myself a bit in math.
In fact primes are in pattern, but its not obivious it you are using old fashioned decimal system. Thats all I can tell right now.

But yes Im able to predict any prime and generate pattern for any kind of range even on my mobile phone. Stay tuned, before 2015 I schould show more.

Offline

#55 2014-02-12 05:39:16

bobbym
bumpkin
From: Bumpkinland
Registered: 2009-04-12
Posts: 109,606

Re: need help in simple computation for my thory

But yes Im able to predict any prime and generate pattern for any kind of range even on my mobile phone.

Sieving them is computing them. Computing them is not predicting. Bold claims always provoke the same reaction. Prove it!


In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.

Offline

#56 2014-10-26 04:09:35

martnSpruce
Member
Registered: 2014-02-08
Posts: 25

Re: need help in simple computation for my thory

Hi there.
Because Im a programmer, I've moved my effort to factorization, so I needed effective sieving (to improve my algorythmic skills also). Still need more mathemathical skill to perform deterministic formula.

But just to refresh the topic. Here is my latest creation (not yet debuged and finally tested, still work in progress - maybe someone will find it usefull).
So, my main question atm is: Do you know any similar solution/site/aplication/program I could test and compare? Im not looking at this point for raw algorithm.
Yes I've was searching google for probabilistic prime calc.

It works in two steps:
A.generating sieve,
B.sieving

http://spruce-mobile.com/samples/divisionCalc_v53.html
I hope I will see you soon with some more interesting work.

Last edited by martnSpruce (2014-10-26 04:10:16)

Offline

#57 2014-10-26 06:03:14

SolarDevil
Member
Registered: 2014-09-14
Posts: 37

Re: need help in simple computation for my thory

martnSpruce wrote:

I said that you need all primes X/2 to sieve X. Isnt this obivious?

Don't you only need the primes that are less than sqrtX to sieve X?

@martnSpruce I think your idea is interesting but I find it slightly hard to distinguish it from the Sieve of Eratosthenes.


Herro! Sycamore School will win National Science Bowl this year!!! big_smile

Offline

Board footer

Powered by FluxBB