Let G be an additive finite abelian group, and let S be a sequence over G. We say that S is regular if for every proper subgroup H ⊆ G, S contains at most |H|-1 terms from H. Let ₀(G) be the smallest integer t such that every regular sequence S over G of length |S| ≥ t forms an additive basis of G, i.e., every element of G can be expressed as the sum over a nonempty subsequence of S. The constant ₀(G) has been determined previously only for the elementary abelian groups. In this paper, we determine...

Let $a$ and $b\in \mathbb{N}$. Denote by $R_{a,b}$ the set of all integers $n>1$ whose canonical prime representation $n=p_1^{{\alpha }_1}{p}_2^{{\alpha }_2}\cdots p_r^{{\alpha }_r}$ has all exponents ${\alpha }_i$$(1\le i\le r)...$

For a finite abelian group G and a splitting field K of G, let (G,K) denote the largest integer l ∈ ℕ for which there is a sequence $S=g₁·...·g_l$ over G such that $(X^{g₁}-a₁)·...·(X^{g_l}-a_l)\ne 0\in K\left[G\right]$ for all $a₁,...,a_l\in K^{\times }$. If (G) denotes the Davenport constant of G, then there is the straightforward inequality (G) - 1 ≤ (G,K). Equality holds for a variety of groups, and a conjecture of W. Gao et al. states that equality holds for all groups. We offer further groups for which equality holds, but we also give the first examples of groups G for which (G) -...

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$.

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.