请输入您要查询的百科知识：

　

词条 Ramanujan's sum
释义

  1. Notation

  2. Formulas for cq(n)

     Trigonometry  Kluyver  von Sterneck  Other properties of cq(n) 

  3. Table

  4. Ramanujan expansions

     Generating functions  σk(n)  d(n)  φ(n)  Λ(n)  Zero  r2s(n) (sums of squares)  r′2s(n) (sums of triangles)  Sums 

  5. See also

  6. Notes

  7. References

  8. External links

{{distinguish|Ramanujan summation}}

In number theory, a branch of mathematics, Ramanujan's sum, usually denoted cq(n), is a function of two positive integer variables q and n defined by the formula:

where (a, q) = 1 means that a only takes on values coprime to q.

Srinivasa Ramanujan mentioned the sums in a 1918 paper.[1] In addition to the expansions discussed in this article, Ramanujan's sums are used in the proof of Vinogradov's theorem that every sufficiently-large odd number is the sum of three primes.[2]

Notation

For integers a and b, is read "a divides b" and means that there is an integer c such that b = ac. Similarly, is read "a does not divide b". The summation symbol

means that d goes through all the positive divisors of m, e.g.

is the greatest common divisor,

is Euler's totient function,

is the Möbius function, and

is the Riemann zeta function.

Formulas for cq(n)

Trigonometry

These formulas come from the definition, Euler's formula and elementary trigonometric identities.

and so on ({{OEIS2C|A000012}}, {{OEIS2C|A033999}}, {{OEIS2C|A099837}}, {{OEIS2C|A176742}},.., {{OEIS2C|A100051}},...) They show that cq(n) is always real.

Kluyver

Let Then {{math|ζq}} is a root of the equation {{math|xq − 1 {{=}} 0}}. Each of its powers,

is also a root. Therefore, since there are q of them, they are all of the roots. The numbers where 1 ≤ n ≤ q are called the q-th roots of unity. {{math|ζq}} is called a primitive q-th root of unity because the smallest value of n that makes is q. The other primitive q-th roots of unity are the numbers where (a, q) = 1. Therefore, there are φ(q) primitive q-th roots of unity.

Thus, the Ramanujan sum cq(n) is the sum of the n-th powers of the primitive q-th roots of unity.

It is a fact[3] that the powers of {{math|ζq}} are precisely the primitive roots for all the divisors of q.

Example. Let q = 12. Then

and are the primitive twelfth roots of unity,

and are the primitive sixth roots of unity,

and are the primitive fourth roots of unity,

and are the primitive third roots of unity,

is the primitive second root of unity, and

is the primitive first root of unity.

Therefore, if

is the sum of the n-th powers of all the roots, primitive and imprimitive,

and by Möbius inversion,

It follows from the identity xq − 1 = (x − 1)(xq−1 + xq−2 + ... + x + 1) that

and this leads to the formula

published by Kluyver in 1906.[4]

This shows that cq(n) is always an integer. Compare it with the formula

von Sterneck

It is easily shown from the definition that cq(n) is multiplicative when considered as a function of q for a fixed value of n:[5] i.e.

From the definition (or Kluyver's formula) it is straightforward to prove that, if p is a prime number,

and if pk is a prime power where k > 1,

This result and the multiplicative property can be used to prove

This is called von Sterneck's arithmetic function.[6] The equivalence of it and Ramanujan's sum is due to Hölder.[7][8]

Other properties of cq(n)

For all positive integers q,

For a fixed value of q the absolute value of the sequence

cq(1), cq(2), ... is bounded by φ(q), and

for a fixed value of n the absolute value of the sequence

c1(n), c2(n), ... is bounded by n.

If q > 1

Let m1, m2 > 0, m = lcm(m1, m2). Then[9] Ramanujan's sums satisfy an orthogonality property:

Let n, k > 0. Then[10]

known as the Brauer - Rademacher identity.

If n > 0 and a is any integer, we also have[11]

due to Cohen.

Table

Ramanujan Sum cs(n)
 n
123456789101112131415161718192021222324252627282930
s11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
2 −11 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1
3 −1 −12 −1 −1 2 −1 −1 2 −1 −1 2 −1 −1 2 −1 −1 2 −1 −1 2 −1 −1 2 −1 −1 2 −1 −1 2
4 0 −2 0 2 0 −2 0 2 0 −2 0 2 0 −2 0 2 0 −2 0 2 0 −2 0 2 0 −2 0 2 0 −2
5 −1 −1 −1 −1 4 −1 −1 −1 −1 4 −1 −1 −1 −1 4 −1 −1 −1 −1 4 −1 −1 −1 −1 4 −1 −1 −1 −1 4
6 1 −1 −2 −1 1 2 1 −1 −2 −1 1 2 1 −1 −2 −1 1 2 1 −1 −2 −1 1 2 1 −1 −2 −1 1 2
7 −1 −1 −1 −1 −1 −1 6 −1 −1 −1 −1 −1 −1 6 −1 −1 −1 −1 −1 −1 6 −1 −1 −1 −1 −1 −1 6 −1 −1
8 0 0 0 −4 0 0 0 4 0 0 0 −4 0 0 0 4 0 0 0 −4 0 0 0 4 0 0 0 −4 0 0
9 0 0 −3 0 0 −3 0 0 6 0 0 −3 0 0 −3 0 0 6 0 0 −3 0 0 −3 0 0 6 0 0 −3
10 1 −1 1 −1 −4 −1 1 −1 1 4 1 −1 1 −1 −4 −1 1 −1 1 4 1 −1 1 −1 −4 −1 1 −1 1 4
11 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 10 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 10 −1 −1 −1 −1 −1 −1 −1 −1
12 0 2 0 −2 0 −4 0 −2 0 2 0 4 0 2 0 −2 0 −4 0 −2 0 2 0 4 0 2 0 −2 0 −4
13 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 12 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 12 −1 −1 −1 −1
14 1 −1 1 −1 1 −1 −6 −1 1 −1 1 −1 1 6 1 −1 1 −1 1 −1 −6 −1 1 −1 1 −1 1 6 1 −1
15 1 1 −2 1 −4 −2 1 1 −2 −4 1 −2 1 1 8 1 1 −2 1 −4 −2 1 1 −2 −4 1 −2 1 1 8
16 0 0 0 0 0 0 0 −8 0 0 0 0 0 0 0 8 0 0 0 0 0 0 0 −8 0 0 0 0 0 0
17 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 16 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1
18 0 0 3 0 0 −3 0 0 −6 0 0 −3 0 0 3 0 0 6 0 0 3 0 0 −3 0 0 −6 0 0 −3
19 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 18 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1
20 0 2 0 −2 0 2 0 −2 0 −8 0 −2 0 2 0 −2 0 2 0 8 0 2 0 −2 0 2 0 −2 0 −8
21 1 1 −2 1 1 −2 −6 1 −2 1 1 −2 1 −6 −2 1 1 −2 1 1 12 1 1 −2 1 1 −2 −6 1 −2
22 1 −1 1 −1 1 −1 1 −1 1 −1 −10 −1 1 −1 1 −1 1 −1 1 −1 1 10 1 −1 1 −1 1 −1 1 −1
23 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 22 −1 −1 −1 −1 −1 −1 −1
24 0 0 0 4 0 0 0 −4 0 0 0 −8 0 0 0 −4 0 0 0 4 0 0 0 8 0 0 0 4 0 0
25 0 0 0 0 −5 0 0 0 0 −5 0 0 0 0 −5 0 0 0 0 −5 0 0 0 0 20 0 0 0 0 −5
26 1 −1 1 −1 1 −1 1 −1 1 −1 1 −1 −12 −1 1 −1 1 −1 1 −1 1 −1 1 −1 1 12 1 −1 1 −1
27 0 0 0 0 0 0 0 0 −9 0 0 0 0 0 0 0 0 −9 0 0 0 0 0 0 0 0 18 0 0 0
28 0 2 0 −2 0 2 0 −2 0 2 0 −2 0 −12 0 −2 0 2 0 −2 0 2 0 −2 0 2 0 12 0 2
29 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 28 −1
30 −1 1 2 1 4 −2 −1 1 2 −4 −1 −2 −1 1 −8 1 −1 −2 −1 −4 2 1 −1 −2 4 1 2 1 −1 8

Ramanujan expansions

If f(n) is an arithmetic function (i.e. a complex-valued function of the integers or natural numbers), then a convergent infinite series of the form:

or of the form:

where the {{math|ak ∈ C}}, is called a Ramanujan expansion[12] of f(n).

Ramanujan found expansions of some of the well-known functions of number theory. All of these results are proved in an "elementary" manner (i.e. only using formal manipulations of series and the simplest results about convergence).[13][14][15]

The expansion of the zero function depends on a result from the analytic theory of prime numbers, namely that the series

converges to 0, and the results for r(n) and r′(n) depend on theorems in an earlier paper.[16]

All the formulas in this section are from Ramanujan's 1918 paper.

Generating functions

The generating functions of the Ramanujan sums are Dirichlet series:

is a generating function for the sequence cq(1), cq(2), ... where q is kept constant, and

is a generating function for the sequence c1(n), c2(n), ... where n is kept constant.

There is also the double Dirichlet series

σk(n)

σk(n) is the divisor function (i.e. the sum of the k-th powers of the divisors of n, including 1 and n). σ0(n), the number of divisors of n, is usually written d(n) and σ1(n), the sum of the divisors of n, is usually written σ(n).

If s > 0,

and

Setting s = 1 gives

If the Riemann hypothesis is true, and

d(n)

d(n) = σ0(n) is the number of divisors of n, including 1 and n itself.

where γ = 0.5772... is the Euler–Mascheroni constant.

φ(n)

Euler's totient function φ(n) is the number of positive integers less than n and coprime to n. Ramanujan defines a generalization of it, if

is the prime factorization of n, and s is a complex number, let

so that φ1(n) = φ(n) is Euler's function.[17]

He proves that

and uses this to show that

Letting s = 1,

Note that the constant is the inverse[18] of the one in the formula for σ(n).

Λ(n)

Von Mangoldt's function {{math|Λ(n) {{=}} 0}} unless n = pk is a power of a prime number, in which case it is the natural logarithm log p.

Zero

For all n > 0,

This is equivalent to the prime number theorem.[19][20]

r2s(n) (sums of squares)

r2s(n) is the number of way of representing n as the sum of 2s squares, counting different orders and signs as different (e.g., r2(13) = 8, as 13 = (±2)2 + (±3)2 = (±3)2 + (±2)2.)

Ramanujan defines a function δ2s(n) and references a paper[21] in which he proved that r2s(n) = δ2s(n) for s = 1, 2, 3, and 4. For s > 4 he shows that δ2s(n) is a good approximation to r2s(n).

s = 1 has a special formula:

In the following formulas the signs repeat with a period of 4.

If s ≡ 0 (mod 4),

If s ≡ 2 (mod 4),

If s ≡ 1 (mod 4) and s > 1,

If s ≡ 3 (mod 4),

and therefore,

r′2s(n) (sums of triangles)

r′2s(n) is the number of ways n can be represented as the sum of 2s triangular numbers (i.e. the numbers 1, 3 = 1 + 2, 6 = 1 + 2 + 3, 10 = 1 + 2 + 3 + 4, 15, ...; the n-th triangular number is given by the formula n(n + 1)/2.)

The analysis here is similar to that for squares. Ramanujan refers to the same paper as he did for the squares, where he showed that there is a function δ′2s(n) such that r′2s(n) = δ′2s(n) for s = 1, 2, 3, and 4, and that for s > 4, δ′2s(n) is a good approximation to r′2s(n).

Again, s = 1 requires a special formula:

If s is a multiple of 4,

If s is twice an odd number,

If s is an odd number and s > 1,

Therefore,

Sums

Let

Then for {{math|s > 1}},

See also

  • Gaussian period
  • Kloosterman sum

Notes

1. ^Ramanujan, On Certain Trigonometric Sums ...
These sums are obviously of great interest, and a few of their properties have been discussed already. But, so far as I know, they have never been considered from the point of view which I adopt in this paper; and I believe that all the results which it contains are new.
(Papers, p. 179). In a footnote cites pp. 360–370 of the Dirichlet-Dedekind Vorlesungen über Zahlentheorie, 4th ed.
2. ^Nathanson, ch. 8
3. ^Hardy & Wright, Thms 65, 66
4. ^G. H. Hardy, P. V. Seshu Aiyar, & B. M. Wilson, notes to On certain trigonometrical sums ..., Ramanujan, Papers, p. 343
5. ^Schwarz & Spilken (1994) p.16
6. ^B. Berndt, commentary to On certain trigonometrical sums..., Ramanujan, Papers, p. 371
7. ^Knopfmacher, p. 196
8. ^Hardy & Wright, p. 243
9. ^Tóth, external links, eq. 6
10. ^Tóth, external links, eq. 17.
11. ^Tóth, external links, eq. 8.
12. ^B. Berndt, commentary to On certain trigonometrical sums..., Ramanujan, Papers, pp. 369–371
13. ^Ramanujan, On certain trigonometrical sums...
The majority of my formulae are "elementary" in the technical sense of the word — they can (that is to say) be proved by a combination of processes involving only finite algebra and simple general theorems concerning infinite series
(Papers, p. 179)
14. ^The theory of formal Dirichlet series is discussed in Hardy & Wright, § 17.6 and in Knopfmacher.
15. ^Knopfmacher, ch. 7, discusses Ramanujan expansions as a type of Fourier expansion in an inner product space which has the cq as an orthogonal basis.
16. ^Ramanujan, On Certain Arithmetical Functions
17. ^This is Jordan's totient function, Js(n).
18. ^Cf. Hardy & Wright, Thm. 329, which states that
19. ^Hardy, Ramanujan, p. 141
20. ^B. Berndt, commentary to On certain trigonometrical sums..., Ramanujan, Papers, p. 371
21. ^Ramanujan, On Certain Arithmetical Functions

References

  • {{citation

| last1 = Hardy | first1 = G. H.
| title = Ramanujan: Twelve Lectures on Subjects Suggested by his Life and Work
| publisher = AMS / Chelsea
| location = Providence RI
| year = 1999
| isbn = 978-0-8218-2023-0}}
  • {{Hardy and Wright | edition=5th}}
  • {{citation

| last1 = Knopfmacher | first1 = John
| title = Abstract Analytic Number Theory
| publisher = Dover | edition=2nd | zbl=0743.11002
| location = New York
| year = 1990 | origyear=1975
| isbn = 0-486-66344-2}}
  • {{citation

| title=Additive Number Theory: the Classical Bases
| volume=164
| series=Graduate Texts in Mathematics
| last=Nathanson
| first=Melvyn B.
| publisher=Springer-Verlag
| year=1996 | isbn=0-387-94656-X | zbl= 0859.11002 | at= Section A.7 }}.
  • {{cite journal | title=Some formulas involving Ramanujan sums |

|first1=C. A. | last1=Nicol |volume=14 }}
  • {{citation

| last1 = Ramanujan | first1 = Srinivasa
| title = On Certain Trigonometric Sums and their Applications in the Theory of Numbers
| journal = Transactions of the Cambridge Philosophical Society
| volume = 22
| issue = 15
| year = 1918
| pages = 259–276}} (pp. 179–199 of his Collected Papers)
  • {{citation

| last1 = Ramanujan | first1 = Srinivasa
| title = On Certain Arithmetical Functions
| journal = Transactions of the Cambridge Philosophical Society
| volume = 22
| issue = 9
| year = 1916
| pages = 159–184}} (pp. 136–163 of his Collected Papers)
  • {{citation

| last1 = Ramanujan | first1 = Srinivasa
| title = Collected Papers
| publisher = AMS / Chelsea
| location = Providence RI
| year = 2000
| isbn = 978-0-8218-2076-6}}
  • {{citation | first1=Wolfgang | last1=Schwarz | first2=Jürgen | last2=Spilker | title=Arithmetical Functions. An introduction to elementary and analytic properties of arithmetic functions and to some of their almost-periodic properties | year=1994 | publisher=Cambridge University Press | isbn=0-521-42725-8 | zbl=0807.11001 | series=London Mathematical Society Lecture Note Series | volume=184 }}

External links

  • {{cite journal|first1=László |last1= Tóth | title=Sums of products of Ramanujan sums |arxiv=1104.1906 | year=2011 |doi=10.1007/s11565-011-0143-3 |volume=58 |journal=ANNALI DELL'UNIVERSITA' DI FERRARA |pages=183–197}}

3 : Number theory|Squares in number theory|Srinivasa Ramanujan
随便看

　

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

　

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间：2024/11/10 12:00:02