Related papers: Repdigits in Euler functions of Pell and associate…

The $\ell$-deck of a graph $G$ is the multiset of all induced subgraphs of $G$ on $\ell$ vertices. We say that a graph is reconstructible from its $\ell$-deck if no other graph has the same $\ell$-deck. In 1957, Kelly showed that every tree…

The usual division algorithms on $\mathbb{Z}$ and $\mathbb{Z}[i]$ measure the size of remainders using the norm function. These rings are Euclidean with respect to several functions. The pointwise minimum of all Euclidean functions $f: R…

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally…

For each positive integer $r$, let $S_r$ denote the $r^{th}$ Schemmel totient function, a multiplicative arithmetic function defined by \[S_r(p^{\alpha})=\begin{cases} 0, & \mbox{if } p\leq r; \\ p^{\alpha-1}(p-r), & \mbox{if } p>r…

For a nonzero integer $n$, a set of distinct nonzero integers $\{a_1,a_2,\ldots,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1\leq i<j\leq m$, is called a Diophantine $m$-tuple with the property $D(n)$ or simply $D(n)$-set.…

A generating function is given for the number, $E(l,k)$, of irreducible $k$-fold Euler sums, with all possible alternations of sign, and exponents summing to $l$. Its form is remarkably simple: $\sum_n E(k+2n,k) x^n = \sum_{d|k}\mu(d)…

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…

Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and…

This paper studies the singularities of Cullen-regular functions of one quaternionic variable. The quaternionic Laurent series prove to be Cullen-regular. The singularities of Cullen-regular functions are thus classified as removable,…

We show the recurrence relations of the Euler-Zagier multiple zeta-function which describes the $r$-fold function with one variable specialized to a non-positive integer as a rational linear combination of $(r-1)$-fold functions, which…

We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…

Lehmer's totient problem asks whether there exists any composite number $n$ such that $\varphi(n) \, \mid \, (n-1)$, where $\varphi$ is Euler totient function. It is known that if any such $n$ exists, it must be Carmichael and $n >…

We discuss a special function (polyexponential) that extends the natural exponential function and also the exponential integral. The basic properties of the polyexponential are listed and some applications are given. In particular, it is…

Several discrete geometry problems are closely related to the arithmetic theory of elliptic curves defined on the rational fields $\mathbb{Q}$. In this paper we consider the $\theta$-congruent number for $\theta=\frac{\pi}{3}$ and…

In this article, with a new approach, which is not discussed in the literature yet, the limit of the Riemann zeta function or Euler-Riemann zeta function is approximately explored by applying Dirichlet's rearrangement theorem for absolutely…

Let $g \geq 2$ be an integer. A natural number is said to be a base-$g$ Niven number if it is divisible by the sum of its base-$g$ digits. Assuming Hooley's Riemann Hypothesis, we prove that the set of base-$g$ Niven numbers is an additive…

The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having…

This survey paper is not a complete reference guide to number-theoretical applications of ergodic theory. Instead, it considers an approach to a class of problems involving Diophantine properties of $n$-tuples of real numbers, namely,…