enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Ramanujan–Petersson conjecture - Wikipedia

    en.wikipedia.org/wiki/Ramanujan–Petersson...

    Satake (1966) reformulated the Ramanujan–Petersson conjecture in terms of automorphic representations for GL(2) as saying that the local components of automorphic representations lie in the principal series, and suggested this condition as a generalization of the Ramanujan–Petersson conjecture to automorphic forms on other groups. Another ...

  3. Partition function (number theory) - Wikipedia

    en.wikipedia.org/wiki/Partition_function_(number...

    Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences. For instance, whenever the decimal representation of n ends in the digit 4 or 9, the number of partitions of n will be divisible by 5.

  4. Ramanujan tau function - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_tau_function

    The only solutions up to 10 10 to the equation τ(p) ≡ 0 (mod p) are 2, 3, 5, 7, 2411, and 7 758 337 633 (sequence A007659 in the OEIS). [11] Lehmer (1947) conjectured that τ(n) ≠ 0 for all n, an assertion sometimes known as Lehmer's conjecture. Lehmer verified the conjecture for n up to 214 928 639 999 (Apostol 1997, p. 22).

  5. Lafforgue's theorem - Wikipedia

    en.wikipedia.org/wiki/Lafforgue's_theorem

    Lafforgue's theorem implies the Ramanujan–Petersson conjecture that if an automorphic form for GL n (F) has central character of finite order, then the corresponding Hecke eigenvalues at every unramified place have absolute value 1.

  6. Hardy–Ramanujan–Littlewood circle method - Wikipedia

    en.wikipedia.org/wiki/Hardy–Ramanujan...

    The initial idea is usually attributed to the work of Hardy with Srinivasa Ramanujan a few years earlier, in 1916 and 1917, on the asymptotics of the partition function.It was taken up by many other researchers, including Harold Davenport and I. M. Vinogradov, who modified the formulation slightly (moving from complex analysis to exponential sums), without changing the broad lines.

  7. Ramanujan's congruences - Wikipedia

    en.wikipedia.org/wiki/Ramanujan's_congruences

    In mathematics, Ramanujan's congruences are the congruences for the partition function p(n) discovered by Srinivasa Ramanujan: (+) (), (+) (), (+) ().In plain words, e.g., the first congruence means that If a number is 4 more than a multiple of 5, i.e. it is in the sequence

  8. AOL

    login.aol.com

    Log in to your AOL account to access email, news, weather, and more.

  9. Ramanujan graph - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_graph

    See Winnie Li's survey on Ramanujan's conjecture and other aspects of number theory relevant to these results. [ 5 ] Lubotzky , Phillips and Sarnak [ 2 ] and independently Margulis [ 6 ] showed how to construct an infinite family of ( p + 1 ) {\displaystyle (p+1)} -regular Ramanujan graphs, whenever p {\displaystyle p} is a prime number and p ...