Search results
Results from the WOW.Com Content Network
In more recent years, computer programs have been used to find and calculate more precise approximations of the perimeter of an ellipse. In an online video about the perimeter of an ellipse, recreational mathematician and YouTuber Matt Parker, using a computer program, calculated numerous approximations for the perimeter of an ellipse. [10]
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 ...
More formulas of this nature can be given, as explained by Ramanujan's theory of elliptic functions to alternative bases. Perhaps the most notable hypergeometric inversions are the following two examples, involving the Ramanujan tau function τ {\displaystyle \tau } and the Fourier coefficients j {\displaystyle \mathrm {j} } of the J-invariant ...
) + / A detailed proof of this formula can be found here: [14] This identity is similar to some of Ramanujan 's formulas involving π , [ 13 ] and is an example of a Ramanujan–Sato series . The time complexity of the algorithm is O ( n ( log n ) 3 ) {\displaystyle O\left(n(\log n)^{3}\right)} .
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.
He also found out the formula for n C r as [n (n − 1) (n − 2) ... (n − r + 1)] / [r (r − 1) (r − 2) ... 2 * 1]. [10] He devised a formula which approximated the area and perimeters of ellipses and found methods to calculate the square of a number and cube roots of a number. [11] He asserted that the square root of a negative number ...
Except for a comment by Landen [14] his ideas were not pursued until 1786, when Legendre published his paper Mémoires sur les intégrations par arcs d’ellipse. [15] Legendre subsequently studied elliptic integrals and called them elliptic functions. Legendre introduced a three-fold classification –three kinds– which was a crucial ...
This asymptotic formula was first obtained by G. H. Hardy and Ramanujan in 1918 and independently by J. V. Uspensky in 1920. Considering p ( 1000 ) {\displaystyle p(1000)} , the asymptotic formula gives about 2.4402 × 10 31 {\displaystyle 2.4402\times 10^{31}} , reasonably close to the exact answer given above (1.415% larger than the true value).