Turán sieve: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Charles Matthews
m References: refine cat
 
m References: expand bibliodata
Line 1: Line 1:
With that said, submitting one article alone can be a time consuming affair. After all, there are several article directories and ezine annoucement lists out there. Each article service has different structure requiremen... <br><br>You know the benefits of article marketing as a successful way of generating traffic to your internet site and getting backlinks. For continuing marketing and growing traffic, it is a good idea to submit articles on a regular basis to article submission sites. <br><br>With that said, distributing one article alone can be a time consuming matter. After-all, there are several article submission sites and ezine annoucement lists out there. Each article listing has different structure requirements and some only focus on particular markets. From my experience, you are better off having an article submission application or article service submission support than personally distributing the articles yourself. <br><br>The disadvantage is-of course, cost price. You will need to dole out some money for the software or for the service of article marketing. But have a look at it this time can also be money! By saving time in this extremely laborious exercise, you are able to channel your efforts to other means of marketing your site or other more effective work. <br><br>Utilizing an article distribution software like article submitter pro, still needs some work with your part. That is why it is the next least expensive alternative. However, some automation is preferable to none. But when you can afford it, outsourcing post submission using a service is a great choice to consider. <br><br>Article distribution service providers are committed to growing their list of post index websites they submit to. Generally, their number could run into hundreds. If people require to learn more on [http://scriptogr.am/submitterlinkliciousppb submitterlinkliciousppb on scriptogr.am], we recommend many on-line databases you might think about investigating. Also, they keep their lists up-to-date. Get more about [http://jazztimes.com/community/profiles/387781-linkliciouswikifyw official site] by visiting our pictorial website. If you use articles distribution application you will need to manage the list yourself. <br><br>Below are a few report distribution company providers: <br><br>http://www.articlemarketer.com <br><br>http://www.submityourarticle.com <br><br>http://www.isnare.com <br><br>Now for post distribution services, which do I recommend? For my own personal sites, I take advantage of a mix of companies. I do a prediction on-the amount of articles that I will probably use within the next couple of months for marketing a specific site. My mother learned about [http://scriptogr.am/linkliciousmeaffiliateclave linklicious tips] by searching the Denver Star-Tribune. Also, recommendations and principles change for every article distribution service. I then pick the best choice based on my needs and my budget. <br><br>Another advantage I also see-in not only using one service is that each report submission service includes a different directory number. You most likely get greater coverage if your articles are seen across a multitude of directories. <br><br>Article index distribution pc software or outsourcing post articles are just two approaches to cut down your workload, particularly when you are a tiny internet business manager. I consequently, recommend that you choose an ideal budget-time option that will give you the most effective mileage for effective marketing with articles..<br><br>To find out more information regarding health fitness; [http://independent.academia.edu/JessieBirda/Posts independent.academia.edu], look at our own web page.
In [[number theory]], an '''average order of an arithmetic function''' is some simpler or better-understood function which takes the same values "on average".
 
Let ''f'' be an [[arithmetic function]]. We say that an ''average order'' of ''f'' is ''g'' if
 
:<math> \sum_{n \le x} f(n) \sim \sum_{n \le x} g(n) </math>
 
as ''x'' tends to infinity.
 
It is conventional to choose an approximating function ''g'' that is [[Continuous function|continuous]] and [[Monotonic function|monotone]]. But even thus an average order is of course not unique.  
 
==Examples==
* An average order of ''d''(''n''), the [[Divisor function|number of divisors]] of ''n'', is log(''n'');
* An average order of σ(''n''), the sum of divisors of ''n'', is ''n''π<sup>2</sup> / 6;
* An average order of φ(''n''), [[Euler's totient function]] of ''n'', is 6''n'' / π<sup>2</sup>;
* An average order of ''r''(''n''), the number of ways of expressing ''n'' as a sum of two squares, is π;
* An average order of ω(''n''), the number of distinct [[prime factor]]s of ''n'', is log log ''n'';
* An average order of Ω(''n''), the number of prime factors of ''n'', is log log ''n'';
* The [[prime number theorem]] is equivalent to the statement that the [[von Mangoldt function]] Λ(''n'') has average order 1;
* An average order of μ(''n''), the [[Möbius function]], is zero; this is again equivalent to the [[prime number theorem]].
 
==Better average order==
 
This notion is best discussed through an example. From
:<math> \sum_{n\le x}d(n)=x\log x+(2\gamma-1)x+o(x)</math>
(<math>\gamma</math> is the [[Euler-Mascheroni constant]]) and
:<math> \sum_{n\le x}\log n=x\log x-x+O(\log x),</math>
we have the asymptotic relation
:<math>\sum_{n\le x}(d(n)-(\log n+2\gamma))=o(x)\quad(x\rightarrow\infty),</math>
which suggests that the function <math>\log n+2\gamma</math> is a better choice of average order for <math>d(n)</math> than simply <math>\log n</math>.
 
 
==See also==
* [[Divisor summatory function]]
* [[Normal order of an arithmetic function]]
* [[Extremal orders of an arithmetic function]]
 
==References==
* {{Hardy and Wright|citation=cite book}}  Pp.347–360
* {{cite book | title=Introduction to Analytic and Probabilistic Number Theory | author=Gérald Tenenbaum | series=Cambridge studies in advanced mathematics | volume=46 | publisher=[[Cambridge University Press]] | year=1995 | isbn=0-521-41261-7 | zbl=0831.11001 | pages=36–55 }}
 
[[Category:Arithmetic functions]]
 
{{numtheory-stub}}

Revision as of 18:19, 3 April 2013

In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average".

Let f be an arithmetic function. We say that an average order of f is g if

nxf(n)nxg(n)

as x tends to infinity.

It is conventional to choose an approximating function g that is continuous and monotone. But even thus an average order is of course not unique.

Examples

  • An average order of d(n), the number of divisors of n, is log(n);
  • An average order of σ(n), the sum of divisors of n, is nπ2 / 6;
  • An average order of φ(n), Euler's totient function of n, is 6n / π2;
  • An average order of r(n), the number of ways of expressing n as a sum of two squares, is π;
  • An average order of ω(n), the number of distinct prime factors of n, is log log n;
  • An average order of Ω(n), the number of prime factors of n, is log log n;
  • The prime number theorem is equivalent to the statement that the von Mangoldt function Λ(n) has average order 1;
  • An average order of μ(n), the Möbius function, is zero; this is again equivalent to the prime number theorem.

Better average order

This notion is best discussed through an example. From

nxd(n)=xlogx+(2γ1)x+o(x)

(γ is the Euler-Mascheroni constant) and

nxlogn=xlogxx+O(logx),

we have the asymptotic relation

nx(d(n)(logn+2γ))=o(x)(x),

which suggests that the function logn+2γ is a better choice of average order for d(n) than simply logn.


See also

References

Template:Numtheory-stub