Timeline for The relationship between the Dirichlet Hyperbola Method, the prime counting function, and Mertens function
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Jun 22, 2012 at 15:05 | vote | accept | Nathan McKenzie | ||
| Jun 20, 2012 at 23:44 | answer | added | Terry Tao | timeline score: 19 | |
| May 23, 2012 at 23:55 | comment | added | Nathan McKenzie | Greg: Maybe I should be using alternative terminology rather than "generalize"? My generalization of D here should be read as "what is the count of pairs/triples/k-tuples of whole numbers, each greater than or equal to s that, when multiplied together, satisfy the condition of being less than or equal to n (with distinct orderings counted separately)". So the value you give for $D_{1,s}(n)$ is in fact exactly what I mean. Sorry if I'm inartful in my descriptions here... | |
| May 23, 2012 at 22:39 | comment | added | Greg Martin | I don't think your definition of $D_{k,s}$ is what you mean. Right now $D_{1,s}(n) = n-s+1$, for example, and has nothing to do with the multiplicative structure of $n$. | |
| May 23, 2012 at 18:38 | answer | added | jeremy ebert | timeline score: 0 | |
| May 22, 2012 at 18:48 | history | asked | Nathan McKenzie | CC BY-SA 3.0 |