2021-03-27, 17:37 | #1 |
Dec 2008
you know...around...
647 Posts |
Bandwidth of #coprimes to p# in intervals of fixed length
At the moment I'm interested in the behavior of numbers coprime to p#, or p-quasiprimes, as they are also called.
Specifically, a question regarding the bandwidth of the number of coprimes that can appear in a fixed interval of length x. Example: for p=5, the maximal bandwidth is 4: for 8 <x<10 there's a minimum of 1 and a maximum of 4 coprimes, and for 12<x<14, there's a minimum of 2 and a maximum of 5 coprimes to 5#. I'd be grateful for any hint leading to papers that touch this particular subject. |
2021-03-28, 17:55 | #2 |
Dec 2008
you know...around...
647 Posts |
Well, maybe that was too specific.
BTW, I already went through some works of Maier, Cadwell, and related works of Granville, Pintz and some others, and was hoping I overlooked some lesser-known papers... Maybe here's an easier question. I still have some serious deficiencies in dealing with differential equations... Is there a readily available algorithm, preferably for Pari, that calculates values for the differential delay equation of Buchstab? You know, the omega(u) one from this Cheer-Goldston paper: https://www.ams.org/journals/mcom/19...990-1023043-8/ |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
inconsistent timestamp intervals in prime.log | ixfd64 | Software | 1 | 2020-11-01 20:27 |
Python script for search for factors of M1277 using random k-intervals | Viliam Furik | Factoring | 61 | 2020-10-23 11:52 |
Memory Bandwidth | Fred | Hardware | 12 | 2016-02-01 18:29 |
P-1 memory bandwidth | TheMawn | Hardware | 1 | 2013-06-15 23:15 |
DJB paper "Factoring into coprimes in essentially linear time" | Chris Card | Factoring | 6 | 2005-06-25 19:41 |