enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Ramanujan's sum - Wikipedia

    en.wikipedia.org/wiki/Ramanujan's_sum

    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]

  3. Srinivasa Ramanujan - Wikipedia

    en.wikipedia.org/wiki/Srinivasa_Ramanujan

    Srinivasa Ramanujan Aiyangar [a] (22 December 1887 – 26 April 1920) was an Indian mathematician.Often regarded as one of the greatest mathematicians of all time, though he had almost no formal training in pure mathematics, he made substantial contributions to mathematical analysis, number theory, infinite series, and continued fractions, including solutions to mathematical problems then ...

  4. Partition function (number theory) - Wikipedia

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

    The multiplicative inverse of its generating function is the Euler function; by Euler's pentagonal number theorem this function is an alternating sum of pentagonal number powers of its argument. Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences.

  5. Ramanujan sum - Wikipedia

    en.wikipedia.org/?title=Ramanujan_sum&redirect=no

    Download as PDF; Printable version; From Wikipedia, the free encyclopedia. Redirect page. Redirect to: Ramanujan's sum; Retrieved from " ...

  6. Elementary Number Theory, Group Theory and Ramanujan Graphs

    en.wikipedia.org/wiki/Elementary_Number_Theory...

    Its authors have divided Elementary Number Theory, Group Theory and Ramanujan Graphs into four chapters. The first of these provides background in graph theory, including material on the girth of graphs (the length of the shortest cycle), on graph coloring, and on the use of the probabilistic method to prove the existence of graphs for which both the girth and the number of colors needed are ...

  7. Hardy–Ramanujan–Littlewood circle method - Wikipedia

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

    Later, I. M. Vinogradov extended the technique, replacing the exponential sum formulation f(z) with a finite Fourier series, so that the relevant integral I n is a Fourier coefficient. Vinogradov applied finite sums to Waring's problem in 1926, and the general trigonometric sum method became known as "the circle method of Hardy, Littlewood and ...

  8. Ramanujan graph - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_graph

    Download as PDF; Printable version ... In the mathematical field of spectral graph theory, a Ramanujan graph is a ... [10] proved the stronger statement that a sum of ...

  9. Landau–Ramanujan constant - Wikipedia

    en.wikipedia.org/wiki/Landau–Ramanujan_constant

    In mathematics and the field of number theory, the Landau–Ramanujan constant is the positive real number b that occurs in a theorem proved by Edmund Landau in 1908, [1] stating that for large , the number of positive integers below that are the sum of two square numbers behaves asymptotically as