mersenneforum.org  

Go Back   mersenneforum.org > Math Stuff > Probability & Probabilistic Number Theory

Reply
 
Thread Tools
Old 2014-08-05, 00:55   #12
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

26·113 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
Interesting.

I haven't worked through the proof yet. Do you recommend the original or a modern version (Granville-Soundarajan, etc.)?
I can't give a recommendation, I did not even know about the latter
result.
R.D. Silverman is offline   Reply With Quote
Old 2014-08-05, 14:10   #13
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

2×2,969 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
I can't give a recommendation, I did not even know about the latter
result.
I read it over last night -- Granville is a great expositor (in addition to being a first-rate mathematician). It doesn't look like their method easily extends to a correction term, since they're not finding the terms directly but rather the moments and then deriving the desired conclusion from a 'magical' theorem in statistics that says that if all the moments match the normal distribution it is normal. So it appears that 1 + o(1) is all you get.

But it struck me while reading the theorem that even more important than the correction term in variance is the correction term in mean, and it is purely elementary to improve the error term in the average order of \omega from O(1) to M + O(1/log x), where the error term comes both from the fraction of numbers below x which are prime and from Mertens' theorem. I know this isn't the same as the normal order, and I doubt something so sharp could be proved at that level, but this should improve the practical performance.
CRGreathouse is offline   Reply With Quote
Old 2014-08-12, 15:12   #14
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

2×2,969 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
I would try to get a 2nd term (i.e. main term plus error term with effective constant) for the
Erdos-Kac thm.
Look what I found:

Persi Diaconis, Frederick Mosteller, Hironari Onishi, Second-order terms for the variances and covariances of the number of prime factors—Including the square free case, Journal of Number Theory 9:2 (May 1977), pp. 187-202.
CRGreathouse is offline   Reply With Quote
Old 2014-08-13, 13:05   #15
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

26·113 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
Look what I found:

Persi Diaconis, Frederick Mosteller, Hironari Onishi, Second-order terms for the variances and covariances of the number of prime factors—Including the square free case, Journal of Number Theory 9:2 (May 1977), pp. 187-202.
Excellent.

The authors surprise me. None of them, AFAIK, is a number theorist.

OTOH, I got to take statistics from Mosteller. He was a terrific
lecturer.
R.D. Silverman is offline   Reply With Quote
Old 2014-08-13, 18:46   #16
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

2·2,969 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
The authors surprise me. None of them, AFAIK, is a number theorist.
The only one I know is Diaconis who is a probabilist.
CRGreathouse is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne number factored (disbelievers are biting elbows) alpertron Data 529 2020-10-07 01:00
Largest Mersenne Number Fully Factored? c10ck3r Data 49 2017-12-10 19:39
Possibility of a Fully-Factored Number Trejack FactorDB 7 2016-05-14 05:38
Estimating the number of prime factors a number has henryzz Math 7 2012-05-23 01:13
230 bits! M1237 (partially) factored petrw1 Factoring 5 2010-11-03 11:31

All times are UTC. The time now is 21:52.

Mon Nov 23 21:52:57 UTC 2020 up 74 days, 19:03, 4 users, load averages: 2.07, 2.48, 2.52

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.