Let ${\Phi }_n\left(q\right)$ denote the $n$th cyclotomic polynomial in $q$. Recently, Guo, Schlosser and Zudilin proved that for any integer $n>1$ with $n\equiv 1(mod4)$, $$\sum _{k=0}^{n-1}\frac{{(q^{-1};q^2)}_k^2{(q^{-2};q^4)}_k}{{(q^2;q^2)}_k^2{(q^4;q^4)}_k}{q}^{6k}\equiv 0(mod{\Phi }_n{\left(q\right)}^2),$$ where ${(a;q)}_m=(1-a)(1-aq)\cdots (1-a{q}^{m-1})$. In this note, we give a generalization of the above $q$-congruence to the modulus ${\Phi }_n{\left(q\right)}^3$ case. Meanwhile, we give a corresponding $q$-congruence modulo ${\Phi }_n{\left(q\right)}^2$ for $n\equiv 3(mod4)$. Our proof is based on the ‘creative microscoping’ method, recently developed by Guo and Zudilin, and a ${}_4{\varphi }_3$ summation formula.

We show that the only Lucas numbers which are factoriangular are $1$ and $2$.

By Descartes’ rule of signs, a real degree $d$ polynomial $P$ with all nonvanishing coefficients with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$) has $\mathrm{pos}\le c$ positive and $\neg \le p$ negative roots, where $\mathrm{pos}\equiv c(mod2)$ and $\neg \equiv p(mod2)$. For $1\le d\le 3$, for every possible choice of the sequence of signs of coefficients of $P$ (called sign pattern) and for every pair $(\mathrm{pos},\mathrm{neg})$ satisfying these conditions there exists a polynomial $P$ with exactly $\mathrm{pos}$ positive and exactly $\neg$ negative roots (all of them simple). For $d\ge 4$...

For an integer $k\ge 2$, let ${\left(n\right)}_n$ be the $k-$generalized Pell sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is given by the linear recurrence $n=2n-1+n-2+\cdots +n-k$. In this paper, we find all $k$-generalized Pell numbers with only one distinct digit (the so-called repdigits). Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for repdigits in the usual Pell sequence ${\left(P_n^{\left(2\right)}\right)}_n$. ...

Consider the linear congruence equation $x_1+...+x_k\equiv b(mod{n}^s)$ for $b\in \mathbb{Z}$, $n,s\in \mathbb{N}$. Let ${(a,b)}_s$ denote the generalized gcd of $a$ and $b$ which is the largest $l^s$ with $l\in \mathbb{N}$ dividing $a$ and $b$ simultaneously. Let $d_1,...,d_{\tau \left(n\right)}$ be all positive divisors of $n$. For each $d_j\mid n$, define ${𝒞}_{j,s}\left(n\right)=\{1\le x\le n^s:{(x,n^s)}_s=d_j^s\}$. K. Bibak et al. (2016) gave a formula using Ramanujan sums for the number of solutions of the above congruence equation with some gcd restrictions on $x_i$. We generalize their result with generalized gcd restrictions on $x_i$ and prove that for the above linear congruence, the...

Consider a recurrence sequence ${\left(x_k\right)}_{k\in \mathbb{Z}}$ of integers satisfying $x_{k+n}=a_{n-1}{x}_{k+n-1}+...+a₁x_{k+1}+a₀x_k$, where $a₀,a₁,...,a_{n-1}\in \mathbb{Z}$ are fixed and a₀ ∈ -1,1. Assume that $x_k>0$ for all sufficiently large k. If there exists k₀∈ ℤ such that $x_{k₀}<0$ then for each negative integer -D there exist infinitely many rational primes q such that $q|x_k$ for some k ∈ ℕ and (-D/q) = -1.

Let $\left\{U_n\right\}=\left\{U_n(P,Q)\right\}$ and $\left\{V_n\right\}=\left\{V_n(P,Q)\right\}$ be the Lucas sequences of the first and second kind respectively at the parameters $P\ge 1$ and $Q\in \{-1,1\}$. In this paper, we provide a technique for characterizing the solutions of the so-called Bartz-Marlewski equation $$x^2-3xy+y^2+x=0,$$ where $(x,y)=(U_i,U_j)$ or $(V_i,V_j)$ with $i$, $j\ge 1$. Then, the procedure of this technique is applied to completely resolve this equation with certain values of such parameters.

Let $K=\mathbb{Q}\left(\alpha \right)$ be a number field generated by a complex root $\alpha$ of a monic irreducible polynomial $f\left(x\right)=x^{18}-m$, $m\ne \mp 1$, is a square free rational integer. We prove that if $m\equiv 2$ or $3(\mathrm{mod}4)$ and $m\neg \equiv \mp 1(\mathrm{mod}9)$, then the number field $K$ is monogenic. If $m\equiv 1(\mathrm{mod}4)$ or $m\equiv 1(\mathrm{mod}9)$, then the number field $K$ is not monogenic.

Let $k\ge 2$ and let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence defined by $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}$$ for $n\ge 2$ with initial conditions $$P_{-(k-2)}^{\left(k\right)}=P_{-(k-3)}^{\left(k\right)}=\cdots =P_{-1}^{\left(k\right)}=P_0^{\left(k\right)}=0,P_1^{\left(k\right)}=1.$$ In this study, we handle the equation $P_n^{\left(k\right)}=y^m$ in positive integers $n$, $m$, $y$, $k$ such that $k,y\ge 2,$ and give an upper bound on $n.$ Also, we will show that the equation $P_n^{\left(k\right)}=y^m$ with $2\le y\le 1000$ has only one solution given by $P_7^{\left(2\right)}={13}^2.$

A natural number $n$ is said to be a $(k,r)$-integer if $n=a^{k}b$, where $k>r>1$ and $b$ is not divisible by the $r$th power of any prime. We study the distribution of such $(k,r)$-integers in the Piatetski-Shapiro sequence $\left\{\lfloor n^c\rfloor \right\}$ with $c>1$. As a corollary, we also obtain similar results for semi-$r$-free integers.

In this paper, we find all Pell and Pell-Lucas numbers written in the form $-2^a-3^b+5^c$, in nonnegative integers $a$, $b$, $c$, with $0\le max\{a,b\}\le c$.

A metacyclic group $H$ can be presented as $\langle \alpha ,\beta :{\alpha }^n=1$, ${\beta }^m={\alpha }^t$, $\beta \alpha {\beta }^{-1}={\alpha }^r\rangle$ for some $n$, $m$, $t$, $r$. Each endomorphism $\sigma$ of $H$ is determined by $\sigma \left(\alpha \right)={\alpha }^{x_1}{\beta }^{y_1}$, $\sigma \left(\beta \right)={\alpha }^{x_2}{\beta }^{y_2}$ for some integers $x_1$, $x_2$, $y_1$, $y_2$. We give sufficient and necessary conditions on $x_1$, $x_2$, $y_1$, $y_2$ for $\sigma$ to be an automorphism.

The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let $\alpha$ and $\beta$ be two multiplicatively independent Perron numbers. Then a sequence $x\in A^{\mathbb{N}}$, where $A$ is a finite alphabet, is both $\alpha$-substitutive and $\beta$-substitutive if and only if $x$ is ultimately...

For any positive integer $D$ which is not a square, let $(u_1,v_1)$ be the least positive integer solution of the Pell equation $u^2-D{v}^2=1,$ and let $h\left(4D\right)$ denote the class number of binary quadratic primitive forms of discriminant $4D$. If $D$ satisfies $2\nmid D$ and $v_{1}h\left(4D\right)\equiv 0(modD)$, then $D$ is called a singular number. In this paper, we prove that if $(x,y,z)$ is a positive integer solution of the equation $x^y+y^x=z^z$ with $2\mid z$, then maximum $max\{x,y,z\}<480000$ and both $x$, $y$ are singular numbers. Thus, one can possibly prove that the equation has no positive integer solutions...