![]() |
![]() |
#12 |
"Καλός"
May 2018
22×5×17 Posts |
![]()
My bad, the Wolfram script is actually testing the π6,5(x) and π6,1(x) cases.
Therefore, the following correction applies: π6,5(x) = π6,1(x) for x = 2, 3, 7, 13, 19, 37, 43, 79, 163, 223 and 229. π6,5(2) = π6,1(2) = 0 (trivial case) π6,5(3) = π6,1(3) = 0 (trivial case) π6,5(7) = π6,1(7) = 1 π6,5(13) = π6,1(13) = 2 π6,5(19) = π6,1(19) = 3 π6,5(37) = π6,1(37) = 5 π6,5(43) = π6,1(43) = 6 π6,5(79) = π6,1(79) = 10 π6,5(163) = π6,1(163) = 18 π6,5(223) = π6,1(223) = 23 π6,5(229) = π6,1(229) = 24 Last fiddled with by Dobri on 2021-08-26 at 20:10 |
![]() |
![]() |
![]() |
#13 |
Mar 2016
22×101 Posts |
![]()
Perhaps this is helpful for you:
p 1 3 5 mod 6 ------------------ 10 1 1 1 10^2 11 1 12 10^3 80 1 86 10^4 611 1 616 10^5 4784 1 4806 10^6 39231 1 39265 10^7 332194 1 332383 10^8 2880517 1 2880936 10^9 25422713 1 25424819 10^10 227523123 1 227529386 10^11 2059018668 1 2059036143 10^12 18803933520 1 18803978496 10^13 173032692013 1 173032844824 10^14 1602470745574 1 1602471005226 |
![]() |
![]() |
![]() |
#14 |
"Καλός"
May 2018
15416 Posts |
![]()
Thanks, this is of limited use as the task is to study the exact locations of the reversal points for which the sign of π6,5(x) - π6,1(x) flips to the opposite, or eventually π6,5(x) - π6,1(x) = 0 with or without a subsequent sign reversal for larger primes. There is no need of considering the only prime π6,3(x) = 3 for said task.
|
![]() |
![]() |
![]() |
#15 |
"Καλός"
May 2018
22×5×17 Posts |
![]()
Indeed, the question is what is happening on the average (rather than at distinct sampling points or limited sampling intervals) when the number of reversal points approaches infinity.
|
![]() |
![]() |
![]() |
#16 |
"Καλός"
May 2018
22·5·17 Posts |
![]()
It should be noted that the prime number race π6,5(x) vs. π6,1(x) is not the same with the race π3,2(x) vs. π3,1(x) and their respective reversal points might differ.
Therefore, unless a reference is found to prove that the reversal points of the race π6,5(x) vs. π6,1(x) have been studied in the past, the said race is a new topic. Thus I do not understand why an anonymous mod had to change the thread icon from 'question' sign to 'minus' sign. |
![]() |
![]() |
![]() |
#17 | ||
Apr 2020
797 Posts |
![]() Quote:
Quote:
|
||
![]() |
![]() |
![]() |
#19 |
Apr 2020
797 Posts |
![]()
What sort of investigation do you want? From a mathematical point of view, there's no real difference between the mod 3 and mod 6 races. Results like Littlewood's and Rubinstein and Sarnak's aren't going to be changed by the omission of the single prime 2.
|
![]() |
![]() |
![]() |
#20 |
"Καλός"
May 2018
22·5·17 Posts |
![]()
There appears to be a significant difference. For instance, the list of π6,5(x) = π6,1(x) in my corrected post is invalid for the mod 3 case. Changing the sequence interval from 3 to 6 changes the behavior of the prime-counting function.
|
![]() |
![]() |
![]() |
#21 |
Apr 2020
797 Posts |
![]()
You get a few extra crossover points by going from mod 3 to mod 6. That's it. Number theorists are not particularly concerned with the exact positions of the crossover points - especially once the first one has been found - but about the long-term trends. Changing the difference by 1 does not affect these. The difference is usually much larger than 1.
|
![]() |
![]() |
![]() |
#22 | |
"Καλός"
May 2018
22×5×17 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Number of primes 2^n-1 within certain range of n | bur | Homework Help | 8 | 2021-02-18 20:54 |
Number of relative primes for P-1 | petrw1 | Factoring | 4 | 2018-11-07 20:20 |
The expected number of primes | Batalov | Computer Science & Computational Number Theory | 5 | 2016-08-11 01:17 |
Estimating the number of primes in a partially-factored number | CRGreathouse | Probability & Probabilistic Number Theory | 15 | 2014-08-13 18:46 |
Guess a Number | davar55 | Puzzles | 11 | 2008-03-19 21:33 |