Related papers: Mills' constant is irrational
In this paper, we give a new upper bound for the number $N_{\mathcal{R}}$ which is defined to be the smallest positive integer such that a certain inequality due to Ramanujan involving the prime counting function $\pi(x)$ holds for every $x…
In a recent work [JNT \textbf{129}, 2154 (2009)], Gun and co-workers have claimed that the number $\,\log{\Gamma(x)} + \log{\Gamma(1-x)}\,$, $x$ being a rational number between $0$ and $1$, is transcendental with at most \emph{one} possible…
A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…
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…
The mathematical constant pi has recently been computed up to 22,459,157,718,361 decimal and 18,651,926,753,033 hexadecimal digits. As a simple check for the normality of pi, the frequencies of all sequences with length one, two and three…
Among the currently known constructions of absolutely normal numbers, the one given by Mordechay Levin in 1979 achieves the lowest discrepancy bound. In this work we analyze this construction in terms of computability and computational…
We make explicit a result of Selberg on the argument of Dirichlet $L$-functions averaged over non-principal characters modulo a prime $q$. As a corollary, we show for all sufficiently large prime $q$ that the height of the lowest…
A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its…
We prove that the formula giving the exact value of the irrationality exponent of regular continued fractions remains valid for semi-regular continued fractions satisfyiong certain conditions.
We study the function M(t,n) = Floor[ 1 / {t^(1/n)} ], where t is a positive real number, Floor[.] and {.} are the floor and fractional part functions, respectively. In a recent article in the Monthly, Nathanson proved that if log(t) is…
Our main result shows that for every odd natural number n > 1 there is a partition of the rational numbers, x/2n in lowest terms, in the unit interval, the product of whose Gamma values takes the form of powers of 2 and pi.
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
It is shown that when a real quadratic integer $\xi$ of fixed norm $\mu$ is considered, the fundamental unit $\varepsilon_d$ of the field $\mathbb{Q}(\xi) = \mathbb{Q}(\sqrt{d})$ satisfies $\log \varepsilon_d \gg (\log d)^2$ almost always.…
Let $k({\bf x})=k(x_1,\ldots ,x_n)$ be the rational function field, and $k\subsetneqq L\subsetneqq k({\bf x})$ an intermediate field. Then, Hilbert's fourteenth problem asks whether the $k$-algebra $A:=L\cap k[x_1,\ldots ,x_n]$ is finitely…
This short article is aimed at educators and teachers of mathematics.Its goal is simple and direct:to explore some of the basic/elementary properties of proper rational numbers.A proper rational number is a rational which is not an integer.…
The concept of nearest integer is used to derive theorems and algorithms for the best approximations of an irrational by rational numbers, which are improved with the pigeonhole principle and used to offer an informed presentation of the…
Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…
Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…
Following earlier results of Sondow, we propose another criterion of irrationality for Euler's constant $\gamma$. It involves similar linear combinations of logarithm numbers $L\_{n,m}$. To prove that $\gamma$ is irrational, it suffices to…
In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.