相关论文: A novel approach to the discovery of ternary BBP-t…
Using a clear and straightforward approach, we discover and prove new binary digit extraction BBP-type formulas for polylogarithm constants. Some known results are also rediscovered in a more direct and elegant manner. Numerous…
BBP-type formulas are usually discovered experimentally, one at a time and in specific bases, through computer searches. In this paper, however, we derive directly, without doing any searches, explicit digit extraction BBP-type formulas in…
We provide a simple way of searching for formulas of the Bailey--Borwein--Plouffe type together with an algorithm and an implementation in \texttt{sage}. Aside from rediscovering some already known formulas, the method has been used in the…
Hitherto only a base 5 BBP-type formula is known for $\sqrt 5\log\phi$, where \mbox{$\phi=(\sqrt 5+1)/2$}, the golden ratio, ( i.e. Formula 83 of the April 2013 edition of Bailey's Compendium of \mbox{BBP-type} formulas). In this paper we…
BBP-type formulas are usually discovered experimentally, through computer searches. In this paper, however, starting with two simple generators, and hence without doing any computer searches, we derive a wide range of BBP-type formulas in…
We present a general procedure to generate infinitely many BBP and BBP-like formulas for the simplest transcendental numbers. This provides some insight and a better understanding into their nature. In particular, we can derive the main…
This paper presents a detailed, self-contained proof of a BBP-type formula for $\pi^2$ expressed in the golden ratio base, $\phi$. The formula was discovered empirically by the author in 2004. The proof presented herein is built upon a…
We study the number of non-zero terms in two specific families of ternary cyclotomic polynomial, we find formulas for the number of terms by writing the cyclotomic polynomial as a sum of smaller sub-polynomials and study the properties of…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
We derive interesting arctangent identities involving the golden ratio, Fibonacci numbers and Lucas numbers. Binary BBP-type formulas for the arctangents of certain odd powers of the golden ratio are also derived, for the first time in the…
Ongoing efforts that span over decades show a rise of AI methods for accelerating scientific discovery, yet accelerating discovery in mathematics remains a persistent challenge for AI. Specifically, AI methods were not effective in creation…
Let $ (P_n)_{n\ge 0}$ be the sequence of Perrin numbers defined by ternary relation $ P_0=3 $, $ P_1=0 $, $ P_2=2 $, and $ P_{n+3}=P_{n+1}+P_n $ for all $ n\ge 0 $. In this paper, we use Baker's theory for nonzero linear forms in logarithms…
Recently a new proof was given for Beurling's Ingham type theorem on one-dimensional nonharmonic Fourier series, providing explicit constants. We improve this result by applying a short elementary method instead of the previous complex…
In this work we propose a novel approach to investigate boundary value problems (BVPs) for fully third order differential equations. It is based on the reduction of BVPs to operator equations for the nonlinear terms but not for the…
With this paper we introduce a new series representation of $\zeta(3)$, which is based on the Clausen representation of odd integer zeta values. Although, relatively fast converging series based on the Clausen representation exist for…
In this paper, we introduce a new and direct approach to study the solvability of systems of equations generated by bilinear forms. More precisely, let $B (\cdot, \cdot)$ be a non-degenerate bilinear form and $E$ be a set in…
In this paper, we give an explicit expression for a certain family of ternary cyclotomic polynomials: specifically $\Phi_{p_{1}p_{2}p_{3}}$, where $p_{1}<p_{2}<p_{3}$ are odd primes such that $p_{2} \equiv1 \mod p_{1}$ and $p_{3} \equiv1…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
Natural numbers which are nontrivial multiples of some permutation of their base-$b$ digit representations are called permutiples. Specific cases include numbers which are multiples of cyclic permutations (cyclic numbers) and reversals of…
We offer some partition functions related to ternary quadratic forms, and note on their upper bounds and related properties. We offer these results as an application of a simple method related to conjugate Bailey pairs presented in a prior…