Related papers: Using Lucas Sequences to Generalize a Theorem of S…

Given $\beta\in(1,2)$ the fat Sierpinski gasket $\mathcal S_\beta$ is the self-similar set in $\mathbb R^2$ generated by the iterated function system (IFS) \[ f_{\beta,d}(x)=\frac{x+d}{\beta},\quad d\in\mathcal A:=\{(0, 0), (1,0), (0,1)\}.…

Under the Riemann Hypothesis, we prove for any natural number $r$ there exist infinitely many large natural numbers $n$ such that $(\gamma_{n+r}-\gamma_n)/(2\pi /\log \gamma_n) > r + \Theta\sqrt{r}$ and $(\gamma_{n+r}-\gamma_n)/(2\pi /\log…

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} =…

We exploit some properties of the Hurwitz zeta function $\zeta (n,x)$ in order to study sums of the form $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}1/(jk+l)^{n}$ and $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}(-1)^{j}/(jk+l)^{n}$ for $%…

A beautiful theorem of Zeckendorf states that every positive integer can be uniquely decomposed as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, where $F_1 = 1$, $F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$. For general recurrences…

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

Zaremba's conjecture (1971) states that every positive integer number d can be represented as a denominator of a finite continued fraction b/d = [d1,d2,...,dk], with all partial quotients d1,d2,...,dk being bounded by an absolute constant…

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.

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

We connect the existence of a ternary classical universal quadratic form over a totally real number field $K$ with the property that all totally positive multiples of 2 are sums of squares (if $K$ does not contain $\sqrt 2$ or contains a…

If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$…

Zeckendorf's Theorem states that any positive integer can be uniquely decomposed into a sum of distinct, non-adjacent Fibonacci numbers. There are many generalizations, including results on existence of decompositions using only even…

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

In a recent work, Dancs and He found new `Euler-type' formulas for $\,\ln{2}\,$ and $\,\zeta{(2\,n+1)}$, $\,n\,$ being a positive integer, each containing a series that apparently can not be evaluated in closed form, distinctly from…

In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

The classical Stern sequence of positive integers was extended to a polynomial sequence $S_n(\lambda)$ by Klav\v{z}ar et. al. by defining $S_0(\lambda) = 0$, $S_1(\lambda) = 1$, and $$S_{2n}(\lambda) = \lambda S_n(\lambda),\quad…

Let $\varphi$ be the Euler's function and fix an integer $k\ge 0$. We show that, for every initial value $x_1\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+1}=\varphi(x_n)+k$ for all $n\ge 1$ is eventually…

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…