
Math General Math Forum  For general math related discussion and news 
 LinkBack  Thread Tools  Display Modes 
March 20th, 2016, 10:24 PM  #1 
Newbie Joined: Mar 2016 From: US Posts: 6 Thanks: 0  Generalizing the prime number theorem. Sorta.
I was thinking about the prime number theorem (because what else do I have to do with my time), and I ran across a problem I can't solve: Say you have a function f(x), and the input is a natural number. The goal is to make f(x) act in such a way that it roughly estimates the number of factors that x has. The reason I call this an extension of the prime number theorem is simply because you're trying to find information about the number of factors, rather than information about which numbers will have no nontrivial factors. So, I suspect that, in some way, the answer will turn out to be related to the proof of the prime number theorem. 
March 21st, 2016, 09:47 AM  #2  
Math Team Joined: May 2013 From: The Astral plane Posts: 1,662 Thanks: 652 Math Focus: Wibbly wobbly timeywimey stuff.  Quote:
Dan  

Tags 
generalizing, number, prime, sorta, theorem 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Theorem: Every odd prime number can be written 2p+q  M_B_S  Number Theory  21  July 24th, 2015 06:04 AM 
Prime Number Theorem  matqkks  Number Theory  2  September 11th, 2013 10:04 PM 
2D Fourier inverse (sorta) of a function?  reddmann  Calculus  0  July 17th, 2010 06:12 AM 
Generalizing a recursive series  boyo  Applied Math  1  November 20th, 2009 09:39 AM 
Prime number theorem  kaushiks.nitt  Number Theory  57  June 29th, 2009 10:23 AM 