Related papers: Tweaking Ramanujan's Approximation of n!
A series of formula is presented that are all inspired by the Ramanujan Notebooks [6]. One of them appears in the notebooks II about Zeta(3). That formula inspired others that appeared in 1998, 2006 and 2009 on the author's website and…
The paper provides a description of the two recent approximation algorithms for the Asymmetric Traveling Salesman Problem, giving the intuitive description of the works of Feige-Singh[1] and Asadpour et.al\ [2].\newline [1] improves the…
We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…
Applying a theorem of Howard for a formula recently proved by Brassesco and M\'endez, we derive new simple explicit formulas for the coefficients of the asymptotic expansion to the sequence of factorials. To our knowledge no explicit…
The subject of robust estimation in time series is widely discussed in literature. One of the approaches is to use GM-estimation. This method incorporates a broad class of nonparametric estimators which under suitable conditions includes…
Person-fit statistics are widely used to detect aberrant response patterns in educational and psychological measurement. Snijders (2001) suggested an asymptotically correct standardization for a broad class of such statistics. This paper…
We give an elementary proof for new strict upper and lower bounds for the correction term in Ramanujan's approximation for the factorial function
We provide an alternating proof of sharp inequalities related with Burnside's formula for $n!$
The effective and efficient numerical solution of Riemann-Hilbert problems has been demonstrated in recent work. With the aid of ideas from the method of nonlinear steepest descent for Riemann-Hilbert problems, the resulting numerical…
In the article, new asymptotic approximation of the $n$th order is obtained and proposed to be used in calculations of radiation propagation without scattering in optically thick media; the asymptotic approximation is much simpler and more…
Cohen-Ramanujan sum, denoted by $c_r^s(n)$, is an exponential sum similar to the Ramanujan sum $c_r(n):=\sum\limits_{\substack{h=1\\{(h,r)=1}}}^{r}e^{\frac{2\pi i n h}{r}}$. An arithmetical function $f$ is said to admit a Cohen-Ramanujan…
Let $t(N)$ denote the largest number such that $N!$ can be expressed as the product of $N$ integers greater than or equal to $t(N)$. The bound $t(N)/N = 1/e-o(1)$ was apparently established in unpublished work of Erd\H{o}s, Selfridge, and…
We derive a new integral formula for the Stieltjes constants. The new formula permits easy computations as well as an exact approximate asymptotic formula. Both the sign oscillations and the leading order of growth are provided. The formula…
Two approximations are frequently used in statistical physics: the first one, which we shall name the mean values approximation, is generally (and improperly) named as "maximum term approximation". The second is the "Stirling…
Recently, the proximal Newton-type method and its variants have been generalized to solve composite optimization problems over the Stiefel manifold whose objective function is the summation of a smooth function and a nonsmooth function. In…
In this paper we present experimental ways of evaluating Ramanujan`s quantities which as someone can see are related with algebraic numbers. The good thing with algebraic numbers is that can be found in a closed form, from there…
The resummation of superfactorially divergent series represents a significant computational challenge in mathematical physics. In the present paper the resummation of a specific class of Stieltjes series characterized by a moment sequence…
Recently, there has been renewed interest in studying the asymptotic properties of the integer partition function $p(n)$. Hardy, Ramanujan, and Rademacher provided detailed asymptotic analysis for $p(n)$. Presently, attention has shifted…
The method proposed by Bernardo and Smith [2000] to approximate reference priors by simulation was analyzed with the objective of improving the procedure in order to obtain consistent estimators and to allow the estimation of asymptotic…
For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…