We study the relations between several notions of dimension for an additive set, some of which are well-known and some of which are more recent, appearing for instance in work of Schoen and Shkredov. We obtain bounds for the ratios between these dimensions by improving an inequality of Lev and Yuster, and we show that these bounds are asymptotically sharp, using in particular the existence of large dissociated subsets of {0,1}ⁿ ⊂ ℤⁿ.

Let $p$ be an odd prime. By using the elementary methods we prove that: (1) if $2\nmid x$, $p\equiv \pm 3(mod8),$ the Diophantine equation $(2^x-1)(p^y-1)=2z^2$ has no positive integer solution except when $p=3$ or $p$ is of the form $p=2a_0^2+1$, where $a_0>1$ is an odd positive integer. (2) if $2\nmid x$, $2\mid y$, $y\ne 2,4,$ then the Diophantine equation $(2^x-1)(p^y-1)=2z^2$ has no positive integer solution.

Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots +k{F}_k^p=F_n^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers. A complete solution is given if the exponents are included in the set $\{1,2\}$. Based on the specific cases we could solve, and a computer search with $p,q,k\le 100$ we conjecture that beside the trivial solutions only $F_8=F_1+2F_2+3F_3+4F_4$, $F_4^2=F_1+2F_2+3F_3$, and $F_4^3=F_1^3+2F_2^3+3F_3^3$ satisfy the title equation.

In this study, we determine when the Diophantine equation $x^2-kxy+y^2-2^n=0$ has an infinite number of positive integer solutions $x$ and $y$ for $0\le n\le 10.$ Moreover, we give all positive integer solutions of the same equation for $0\le n\le 10$ in terms of generalized Fibonacci sequence. Lastly, we formulate a conjecture related to the Diophantine equation $x^2-kxy+y^2-2^n=0$.

Let p denote a prime number. P. Samuel recently solved the problem of determining all squares in the linear recurrence sequence {Tₙ}, where Tₙ and Uₙ satisfy Tₙ² - pUₙ² = 1. Samuel left open the problem of determining all squares in the sequence {Uₙ}. This problem was recently solved by the authors. In the present paper, we extend our previous joint work by completely solving the equation Uₙ = bx², where b is a fixed positive squarefree integer. This result also extends previous work of the second...

For an integer k ≥ 2, let $\left(F{ₙ}^{\left(k\right)}\right)ₙ$ be the k-Fibonacci sequence which starts with 0,..., 0,1 (k terms) and each term afterwards is the sum of the k preceding terms. This paper completes a previous work of Marques (2014) which investigated the spacing between terms of distinct k-Fibonacci sequences.

A positive integer $n$ is called a square-free number if it is not divisible by a perfect square except $1$. Let $p$ be an odd prime. For $n$ with $(n,p)=1$, the smallest positive integer $f$ such that $n^f\equiv 1(modp)$ is called the exponent of $n$ modulo $p$. If the exponent of $n$ modulo $p$ is $p-1$, then $n$ is called a primitive root mod $p$. Let $A\left(n\right)$ be the characteristic function of the square-free primitive roots modulo $p$. In this paper we study the distribution $$\sum _{n\le x}A\left(n\right)A(n+1),$$ and give an asymptotic formula by using properties of character sums.