Related papers: A New Binary BBP-type Formula for $\sqrt 5\,\log\p…

Let $R$ be a ring, $\CC_R$ and $\pCCR$ be the set of regular and left regular elements of $R$ ($\CC_R\subseteq \pCCR$). Goldie's Theorem is a semisimplicity criterion for the classical left quotient ring $Q_{l,cl}(R):=\CC_R^{-1}R$.…

In this paper we prove that if $\{\varphi_i(x)=\lambda x+t_i\}$ is an equicontractive iterated function system and $b$ is a positive integer satisfying $\frac{\log b}{\log |\lambda|}\notin\mathbb{Q},$ then almost every $x$ is normal in base…

The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…

We report the observation of the decay $B^{\pm} \to \phi \phi K^{\pm}$ and find evidence for $B^{0} \to \phi \phi K^{0}$. These results are based on a 414 fb$^{-1}$ data sample that contains $449 \times 10^6$ $B\bar{B}$ pairs, collected…

Binary stars play a vital role in astrophysical research, as a good fraction of stars are in binaries. Binary fraction (BF) is known to change with stellar mass in the Galactic field, but such studies in clusters require binary…

In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…

This paper is devoted to establishing several new formulas relating Bernoulli and Stirling numbers of both kinds.

As properties of poly-Bernoulli numbers, a number of formulas such as the duality formula, explicit formula using the Stirling numbers of the second kind and periodicity for negative upper-index have been established. For the multi-indexed…

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

In this paper will be proved the existence of a formula to reduce a tetration of base $2^{k}$ and $5^{k}$ $\mod 10^{n}$. Indeed, last digits of a tetration are the same starting from a certain hyper-exponent; In order to compute the last…

On each nonorientable surface of odd genus $g \geq 5$, we give a mapping class whose dilatation on an invariant subsurface is the golden ratio.

We present the first evidence of charmless decays of the $B_s^0$ meson, the decay \phiphi, and a measurement of the Branching Ratio $\BR(\phiphi)$ using $180 {\rm pb}^{-1}$ of data collected by the \cdfii experiment at the Fermilab Tevatron…

Bogoliubov many-body perturbation theory (BMBPT) relying on the breaking of U(1) global gauge symmetry has been recently formulated and applied to extend the applicability of standard perturbation theory to ab initio calculations of atomic…

Using Hecke characters, we construct two infinite families of newforms with complex multiplication, one by $\mathbb{Q}(\sqrt{-3})$ and the other by $\mathbb{Q}(\sqrt{-2})$. The values of the $p$-th Fourier coefficients of all the forms in…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

In this paper we obtain an asymptotic formula for the number of $\operatorname{SL}_2(\mathbb{Z})$-equivalence classes of positive definite binary quadratic forms over $\bZ$ having bounded discriminant $\Delta = 1-4p$, with $p$ a prime. We…

We describe a tabulation of (conjecturally) modular elliptic curves over the field Q(sqrt(5)) up to the first curve of rank 2. Using an efficient implementation of an algorithm of Lassina Dembele, we computed tables of Hilbert modular forms…

Faugere's F5 algorithm is one of the fastest known algorithms for the computation of Grobner bases. So far only the F5 Criterion is proved, whereas the second powerful criterion, the Rewritten Criterion, is not understood very well until…

Let $E_x(q,a)$ be the error term when counting primes in arithmetic progressions and let $M(Q)=\sum_{q\leq Q}\phi(q)\sum_{a=1}^qE_x(q,a)^3$. We show that $M(Q)<<Q^3(x/Q)^{7/5}$ for large $Q$ close to $x$ (in the usual BDH sense) thereby…

Semiclassical approximations often involve the use of stationary phase approximations. This method can be applied when $\hbar$ is small in comparison to relevant actions or action differences in the corresponding classical system. In many…