相关论文: A new form of the Machin-like formula for pi by it…

We introduce some new classes of words and permutations characterized by the second difference condition $\pi(i-1) + \pi(i+1) - 2\pi(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and…

Augmentation methods for mixed-integer (linear) programs are a class of primal solution approaches in which a current iterate is augmented to a better solution or proved optimal. It is well known that the performance of these methods, i.e.,…

We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\pi$ to be $k$-pass…

Given a permutation $\pi\in \Sn\_n$, construct a graph $G\_\pi$ on the vertex set $\{1,2, ..., n\}$ by joining $i$ to $j$ if (i) $i<j$ and $\pi(i)<\pi(j)$ and (ii) there is no $k$ such that $i < k < j$ and $\pi(i)<\pi(k)<\pi(j)$. We say…

New formulas for 1/Pi^2 are found by transforming Guillera's formulas

We develop the Akhiezer iteration, a generalization of the classical Chebyshev iteration, for the inner product-free, iterative solution of indefinite linear systems using orthogonal polynomials for measures supported on multiple, disjoint…

Let $n$ and $k$ be positive integers with $n>k$. Given a permutation $(\pi_1,\ldots,\pi_n)$ of integers $1,\ldots,n$, we consider $k$-consecutive sums of $\pi$, i.e., $s_i:=\sum_{j=0}^{k-1}\pi_{i+j}$ for $i=1,\ldots,n$, where we let…

Based on the first 25 known values of Pi(10^n), the number of primes less than 10^n, with n integer between 1 and 25, we propose a conjectured value range of Pi(10^26) calculated by using polynomial interpolations with two corrective…

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

We prove several asymptotic continued fraction expansions of $\pi(x)$, $\Pi(x)$, $\operatorname{li}(x)$, $\operatorname{Ri}(x)$, and related functions, where $\pi(x)$ is the prime counting function, $\Pi(x) = \sum_{k = 1}^\infty…

In the present report the author presents a simple and systematically defined formula for the fine structure constant based only on the number $\pi$. The difference between the suggested value and the currently known experimental one is…

We establish a law of the iterated logarithm (LIL) for the set of real numbers whose $n$-th partial quotient is bigger than $\alpha_n$, where $(\alpha_n)$ is a sequence such that $\sum 1/\alpha_n$ is finite. This set is shown to have…

In the paper we provide measure estimates for the set of numbers whose sequence of products of continued fraction partial quotients $M_n = a_1 \ldots a_n$ has exponential growth with rate close to the one predicted by Khintchine's theorem,…

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

We derive explicit Pieri-type multiplication formulas in the Grothendieck ring of a flag variety. These expand the product of an arbitrary Schubert class and a special Schubert class in the basis of Schubert classes. These special Schubert…

In this paper we establish a number of new estimates concerning the prime counting function \pi(x), which improve the estimates proved in the literature. As an application, we deduce a new result concerning the existence of prime numbers in…

A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.

We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p for many small primes p, and then reconstruct B(k) via the…

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

In this paper we suggest an {\it iterative} algorithm to compute automatically the scattering matrix elements of any given effective lagrangian, $\Gamma$. By exploiting the relation between $\Gamma$ and the connected Green function…