Talk:Prime omega function: Difference between revisions

Content deleted Content added

Inline

Revision as of 07:49, 2 June 2019

Mathematics Start‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

I removed the following tag:

Really the updated identity for $\sum _{n\leq x}\omega (n)^{k}$ provides what this is asking for, just with a notably weak error term formulation. Maxie (talk) 07:49, 2 June 2019 (UTC)[reply]

@@ Line 1: / Line 1: @@
 {{maths rating|class=start|importance=low|field=number theory}}
+I removed the following tag:
+{{expand section|For example, one good demonstrative formula for generalizing the method from Hardy and Wright would be to calculate <math>\sum_{n \leq x} \omega(n) \left\{\omega(n)-1\right\} \left\{\omega(n)-2\right\}</math> explicitly. May prove or conjecture at a general formula for these so-termed factorial moments of the little omega function. Such a formula immediately implies a formula for the power summatory functions of the form <math>\sum_{n \leq x} \omega(n)^k</math> by inversion formulas converting between powers and [[falling factorial]]s given in terms of the [[Stirling numbers]]. These two generalized results would ''definitely'' be a nice addition to this page!|date=April 2018}}
+Really the updated identity for <math>\sum_{n \leq x} \omega(n)^k</math> provides what this is asking for, just with a notably weak error term formulation. [[User:Maxieds|Maxie]] ([[User talk:Maxieds|talk]]) 07:49, 2 June 2019 (UTC)