相关论文: Using Lucas Sequences to Generalize a Theorem of S…
Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…
In this shortnote, a series expansion technique introduced recently by Dancs and He for generating Euler-type formulae for odd zeta values $\:\zeta{(2 k +1)}$, $\zeta{(s)}$ being the Riemann zeta function and $k$ a positive integer, is…
In this paper, we investigate the combinatorial structure and asymptotic distribution of the solution set of the equation $\sigma(n+1) = k\sigma(n)$ for a given integer $k>1$. From a combinatorial perspective, the solutions to this equation…
Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers for some fixed integer $k\ge 2$, whose first $k$ terms are $0,\;\ldots\;,\;0,\;2,\;1$ and each term afterward is the sum of the preceding $k$ terms. In this…
The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…
Let $s\ge 2$ be an integer. Denote by $\mu_s$ the least integer so that every integer $\ell >\mu_s$ is the sum of exactly $s$ integers $>1 $ which are pairwise relatively prime. In 1964, Sierpi\'nski asked a determination of $\mu_s$. Let…
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}$…
A natural number is a binary $k$'th power if its binary representation consists of $k$ consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary $k$'th powers. More precisely, we show that for each integer $k…
For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…
An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…
Let $N$ be an odd perfect number. Then, Euler proved that there exist some integers $n, \alpha$ and a prime $q$ such that $N = n^{2}q^{\alpha}$, $q \nmid n$, and $q \equiv \alpha \equiv 1 \bmod 4$. In this note, we prove that the ratio…
A beautiful theorem of Zeckendorf states that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Such decompositions exist more generally, and much is known about them. First, for any positive…
We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…
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,\ldots,d_{k}],$ with all partial quotients…
Sums of positive integer powers have captivated the attention of mathematicians since ancient times. Over the centuries, mathematicians from diverse backgrounds have provided expressions for the sum of positive integer powers of the first…
In 1987, Dan Gordon defined an elliptic curve analogue to Carmichael numbers known as elliptic Carmichael numbers. In this paper, we prove that there are infinitely many elliptic Carmichael numbers. In doing so, we resolve in the…
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…
We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…
In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The…
E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…