Related papers: A class of digit extraction BBP-type formulas in g…
This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…
Galperin introduced an interesting method to learn the digits of $\pi $ by counting the collisions of two billiard balls and a hard wall. This paper studies two quantum versions of the Galperin billiards. It is shown that the digits of $\pi…
For certain primes $p$, the average digit in the expansion of $1/p$ was found to have a deviation from random behaviour related to the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-p})$ (Girstmair 1994). In this short…
Let $h$ and $l$ be integers such that $0\le h\le 2$, $0\le l\le 4$. We obtain asymptotic formulas for the numbers of solutions of the equations $n-3m=h$, $n-5m=l$ in positive integers $m$ and $n$ of a special kind, $m\le X$.
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits…
The aim of this paper is to study the fully degenerate Bernoulli polynomials and numbers, which are a degenerate version of Bernoulli polynomials and numbers and arise naturally from the Volkenborn integral of the degenerate exponential…
This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…
Decimal-to-binary conversion is important to modern binary computers. The classical method to solve this problem is based on division operation. In this paper, we investigate a decimal-to-binary conversion method based on addition…
In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by…
Binary Integer Programming (BIP) problems are of interest due in part to the difficulty they pose and because of their various applications, including those in graph theory, combinatorial optimization and network optimization. In this note,…
Motivated by Ramanujan-type series and Zeilberger-type series, in this paper we investigate two new types of series for powers of $\pi$. For example, we prove that…
One of the main purposes of this article is to give functional equations and differential equations between Bernstein basis functions and generating functions of B-spline curves. Using these equations, very useful formulas containing the…
Let $b$ be a numeration base. A $b$-Niven number is one that is divisible by the sum of its base $b$ digits. We introduce high degree $b$-Niven numbers. These are $b$-Niven numbers that have a power greater than $1$ that is $b$-Niven…
Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic…
Bag and Shparlinski \cite{BaSh} considered bilinear sums of terms of the form $e_p(axy^s)$, where $p$ is a prime, $a$ is an integer coprime to $p$, $s$ is an integer, $x$ runs over a subset of $\mathbb{F}_p^{\ast}$ and $y$ runs over an…
A new method is presented for obtaining indefinite integrals of common special functions. The approach is based on a Lagrangian formulation of the general homogeneous linear ordinary differential equation of second order. A general integral…
In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…
Consider the following process: Take any four-digit number which has at least two distinct digits. Then, rearrange the digits of the original number in ascending and descending order, take these two numbers, and find the difference between…
We present a new result on counting primes $p<N=2^n$ for which $r$ (arbitrarily placed) digits in the binary expansion of $p$ are specified. Compared with earlier work of Harman and Katai, the restriction on $r$ is relaxed to $r<…
Unlike the Hamilton quaternion algebra, the split-quaternions contain nontrivial zero divisors. In general speaking, it is hard to find the solutions of equations in algebras containing zero divisor. In this paper, we manage to derive…