Related papers: A New Binary BBP-type Formula for $\sqrt 5\,\log\p…
Let $\vartheta := \frac{-1+\sqrt{5}}{2}$ be the golden ratio. A golden lattice is an even unimodular $\Z[\vartheta ]$-lattice of which the Hilbert theta series is an extremal Hilbert modular form. We construct golden lattices from extremal…
In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], a[1], ..., a[n]} and minimal extra-super increasing sequence…
Two topics of the number theory are discussed in this paper. First, we prove that given each natural number $x\geq10^{3}$, we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where $c$…
Sidorov and Vershik showed that in base $G=\frac{\sqrt{5}+1}{2}$ and with the digits $0,1$ the numbers $x=nG ~(\text {mod} 1)$ have $\aleph_{0}$ expansions for any $n\in\mathbb{Z}$, while the other elements of $(0, \frac{1}{G-1})$ have…
In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…
Based on artistic interpretations, art professor Christopher Bartlett (Towson University, USA) suggested introducing a new mathematical constant related to the golden ratio. He called it the chi ratio, as chi follows phi in the Greek…
The main aim of this paper is to further develop the multiple-correction method that formulated in our previous works~\cite{CXY, Cao}. As its applications, we establish a kind of hybrid-type finite continued fraction approximations related…
For real numbers $p,q>1$ we consider the following family of integrals: \begin{equation*} \int_{0}^{1}\frac{(x^{q-2}+1)\log\left(x^{mq}+1\right)}{x^q+1}{\rm d}x \quad \mbox{and}\quad…
For an infinite word $\mathbf{x}$, Bugeaud and Kim introduced a new complexity function $\text{rep}(\mathbf{x})$ which is called the exponent of repetition of $\mathbf{x}$. They showed $1\le \text{rep}(\mathbf{x}) \le \sqrt{10}-\frac{3}{2}$…
In the base phi representation any natural number is written uniquely as a sum powers of the golden mean with digits 0 and 1, where one requires that the product of two consecutive digits is always 0. In this paper we give precise…
In this paper an explicit algorithm is proposed for solving an equilibrium problem whose associated bifunction is pseudomonotone and satisfies a Lipschitz-type condition. Contrary to many algorithms, our algorithm is done without using…
For an integer $n\geq 1$, consider the $n$-th metallic number $\phi_n=\frac{n+\sqrt{n^2+4}}{2}$ (e.g. $\phi_1$ is the golden number) and denote by $[\phi_n]_q$ its $q$-deformation in the sense of S. Morier-Genoud and V. Ovsienko. This is an…
It is conjectured that there is a converging sequence of some generalized Fibonacci ratios, given the difference between consecutive ratios, such as the Golden Ratio, $\varphi^1$, and the next golden ratio $\varphi^2$. Moreover, the graphic…
We prove a few new properties of the $\varphi$-representation of integers, where $\varphi = (1+\sqrt{5})/2$. In particular, we prove a 2012 conjecture of Kimberling. As software assistants, we used the Walnut theorem-prover, and in one…
In this paper, we introduce two golden ratio algorithms with new stepsize rules for solving pseudomonotone and Lipschitz variational inequalities in finite dimensional Hilbert spaces. The presented stepsize rules allow the resulting…
Let $a>1$. Denote by $l_a(p)$ the multiplicative order of $a$ modulo $p$. We look for an estimate of sum of $\frac{l_a(p)}{p-1}$ over primes $p\leq x$ on average. When we average over $a\leq N$, we observe a statistic of $C\mathrm{Li}(x)$.…
It is well known that the golden ratio $\phi$ is the ''most irrational'' number in the sense that its best rational approximations $s/t$ have error $\sim 1/(\sqrt{5} t^2)$ and this constant $\sqrt{5}$ is as low as possible. Given a prime…
A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.
Let $P_{r}$ denote an integer with at most $r$ prime factors counted with multiplicity. In this paper we prove that for some $\lambda < \frac{1}{12}$, the inequality $\{\sqrt{p}\}<p^{-\lambda}$ has infinitely many solutions in primes $p$…
In Galperin billiards, two balls colliding with a hard wall form an analog calculator for the digits of the number $\pi$. This classical, one-dimensional three-body system (counting the hard wall) calculates the digits of $\pi$ in a base…