![]() |
|
Number Theory Number Theory Math Forum |
![]() |
| LinkBack | Thread Tools | Display Modes |
September 28th, 2016, 02:46 PM | #1 |
Newbie Joined: Sep 2016 From: Tempe, Arizona Posts: 5 Thanks: 0 | Fourier Series for Prime Counting Functions
If you're interested in prime number theory and the Riemann hypothesis, you'll probably be interested in the following website which illustrates Fourier series for several prime counting functions and their first and second-order derivatives. Probably the most interesting result illustrated is that at positive integer values of x the Fourier series for the first-order derivative of a prime counting function always evaluates to 2f times the step size of the prime counting function at the integer x even at the minimum evaluation frequency f=1 (where f is assumed to be a positive integer). primefourierseries.com |
![]() |
September 28th, 2016, 03:21 PM | #2 |
Math Team Joined: Dec 2013 From: Colombia Posts: 7,599 Thanks: 2587 Math Focus: Mainly analysis and algebra |
Fourier Series are periodic. The picture you have on the front page is not. What are you really doing?
|
![]() |
September 28th, 2016, 03:50 PM | #3 |
Newbie Joined: Sep 2016 From: Tempe, Arizona Posts: 5 Thanks: 0 |
Of course you are correct that Fourier series are normally used to represent periodic functions. This is really an infinite set of Fourier series, each with an infinite set of harmonics. Since the range of x values illustrated on the web sites is small, I only needed to evaluate a small number of the infinite set of Fourier series to obtain a reasonable approximation. As the range of x values being illustrated increases, the number of Fourier series being evaluated needs to increase as well to obtain a reasonable approximation.
|
![]() |
October 14th, 2016, 03:08 PM | #4 |
Newbie Joined: Sep 2016 From: Tempe, Arizona Posts: 5 Thanks: 0 |
I have now illustrated the evolution of the zeta zeros from the Mellin transform of the Fourier series for the first-order derivative of the second Chebyshev function. 10.1 – Evolution of Zeta Zeros from l'[x] – Fourier Series for Prime Counting Functions |
![]() |
![]() |
|
Tags |
counting, fourier, functions, prime, series |
Search tags for this page |
Click on a term to search for related topics.
|
Thread Tools | |
Display Modes | |
|
![]() | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Approximation for the Prime Counting Function | numberguru1 | Number Theory | 3 | November 6th, 2015 02:21 PM |
A simple proof of the prime-counting function | Rahul k | Number Theory | 1 | May 14th, 2015 07:10 AM |
A property of the prime counting function. | Jonas Castillo T | Number Theory | 6 | May 9th, 2015 07:26 PM |
An equation of prime counting function. | jim198810 | Number Theory | 6 | March 26th, 2015 08:31 PM |
Question on prime counting function \pi | fafa | Number Theory | 24 | June 22nd, 2013 01:55 AM |