Related papers: Generalized Sierpi\'nski Numbers
A positive integer $n$ is said to be a palindrome in base $b$ (or $b$-adic palindrome) if the representation of $n = (a_k a_{k-1} \cdots a_0)_b$ in base $b$ with $a_k \neq 0$ has the symmetric property $a_{k-i} = a_i$ for every…
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
Let $n$ be a positive integer. In 1915, Theisinger proved that if $n\ge 2$, then the $n$-th harmonic sum $\sum_{k=1}^n\frac{1}{k}$ is not an integer. Let $a$ and $b$ be positive integers. In 1923, Nagell extended Theisinger's theorem by…
A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…
A positive integer $n$ is called a $\theta$-congruent number if there is a triangle with sides $a,b$ and $c$ for which the angle between $a$ and $b$ is equal to $\theta$ and its area is $n\sqrt{r^2 - s^2}$, where $0 < \theta < \pi$, $\cos…
We solve a theoretical arithmetics problem stated by Wac{\l}aw Sierpi\'nski. The problem has remained open for a couple of decades.
We construct an absolutely normal number whose continued fraction expansion is normal in the sense that it contains all finite patterns of partial quotients with the expected asymptotic frequency as given by the Gauss-Kuzmin measure. The…
We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…
Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. A natural generalization of this theorem is to look at the sequence defined as follows: for $n\ge 2$, let $F_{n,1} =…
For the Stirling numbers of the second kind $S(n,k)$ and the ordered Bell numbers $B(n)$, we prove the identity $\sum_{k=1}^{n/2} S(n,2k)(2k-1)! = B(n-1)$. An analogous identity holds for the sum over odd $k$'s.
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
We give an algorithm that produces all solutions of the equation $\sum_{i=1}^n 1/x_i = 1$ in integers of the form $2^a k^b$, where $k$ is a fixed positive integer that is not a power of $2$, $a$ is an element of $\{0,1,2\}$ that can vary…
For $b\leq -2$ and $e \geq 2$, let $S_{e,b}:\mathbb{Z}\to\mathbb{Z}_{\geq 0}$ be the function taking an integer to the sum of the $e$-powers of the digits of its base $b$ expansion. An integer $a$ is a $b$-happy number if there exists…
Let $a_k(n)$ denotes the number of representations of a non-negative integer $n$ as sum of $k$ quadratic forms of the type $x^2+xy+y^2$ and $a_{\lambda_1,\lambda_2,\lambda_3\dots\lambda_k}(n)$ denotes the number of representations $n$ as a…
Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence, which is $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n$-th Bernoulli number. In this paper, we will…
Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…
As a variant of Zeckendorf's theorem, Chung and Graham proved that every positive integer can be uniquely decomposed into a sum of even-indexed Fibonacci numbers, whose coefficients are either $0, 1$, or $2$ so that between two coefficients…
Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…
This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…
A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…