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 p be an odd prime and let a be a positive integer. In this paper we investigate the sum $\genfrac{}{}{0pt}{}{{\sum }_{k=0}^{p^a-1}(h{p}^a-1}{\genfrac{}{}{0pt}{}{k\left)\right(2k}{k)/m^k\left(modp²\right)}}$, where h and m are p-adic integers with m ≢ 0 (mod p). For example, we show that if h ≢ 0 (mod p) and $p^a>3$, then $\genfrac{}{}{0pt}{}{{\sum }_{k=0}^{p^a-1}(h{p}^a-1}{\genfrac{}{}{0pt}{}{k\left)\right(2k}{{k)(-h/2)}^k\equiv ((1-2h)/\left(p^a\right))(1+h({(4-2/h)}^{p-1}-1))\left(modp²\right)}}$, where (·/·) denotes the Jacobi symbol. Here is another remarkable congruence: If $p^a>3$ then $\genfrac{}{}{0pt}{}{{\sum }_{k=0}^{p^a-1}(p^a-1}{\genfrac{}{}{0pt}{}{k\left)\right(2k}{{k)(-1)}^k\equiv 3^{p-1}(p^a/3)\left(modp²\right)}}$.

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.

Let P and Q be nonzero integers. The sequences of generalized Fibonacci and Lucas numbers are defined by U₀ = 0, U₁ = 1 and $U_{n+1}=PUₙ-Q{U}_{n-1}$ for n ≥ 1, and V₀ = 2, V₁ = P and $V_{n+1}=PVₙ-Q{V}_{n-1}$ for n ≥ 1, respectively. In this paper, we assume that P ≥ 1, Q is odd, (P,Q) = 1, Vₘ ≠ 1, and $V_r\ne 1$. We show that there is no integer x such that $Vₙ=V_{r}Vₘx²$ when m ≥ 1 and r is an even integer. Also we completely solve the equation $Vₙ=VₘV_{r}x²$ for m ≥ 1 and r ≥ 1 when Q ≡ 7 (mod 8) and x is an even integer. Then we show that when P ≡ 3 (mod 4) and...

Let $p$ be a fixed odd prime. We combine some properties of quadratic and quartic Diophantine equations with elementary number theory methods to determine all integral points on the elliptic curve $E:y^2=x^3-4p^{2}x$. Further, let $N\left(p\right)$ denote the number of pairs of integral points $(x,\pm y)$ on $E$ with $y>0$. We prove that if $p\ge 17$, then $N\left(p\right)\le 4$ or $1$ depending on whether $p\equiv 1(mod8)$ or $p\equiv -1(mod8)$.

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

Let $C_m:y^2=x^3-m^{2}x+p^2{q}^2$ be a family of elliptic curves over $\mathbb{Q}$, where $m$ is a positive integer and $p$, $q$ are distinct odd primes. We study the torsion part and the rank of $C_m\left(\mathbb{Q}\right)$. More specifically, we prove that the torsion subgroup of $C_m\left(\mathbb{Q}\right)$ is trivial and the $\mathbb{Q}$-rank of this family is at least 2, whenever $m\neg \equiv 0(mod3)$, $m\neg \equiv 0(mod4)$ and $m\equiv 2(mod64)$ with neither $p$ nor $q$ dividing $m$.

The number of solutions of the congruence $a₁x₁+\cdots +a_k{x}_k\equiv 0\left(modn\right)$ in the box $0\le x_i\le b_i$ is estimated from below in the best possible way, provided for all i,j either $(a_i,n)|(a_j,n)$ or $(a_j,n)|(a_i,n)$ or $n\left|\right[a_i,a_j]$.

Let $d$ be an odd square-free integer, $m\ge 3$ any integer and $L_{m,d}:=\mathbb{Q}({\zeta }_{2^m},\sqrt{d})$. In this paper, we shall determine all the fields $L_{m,d}$ having an odd class number. Furthermore, using the cyclotomic ${\mathbb{Z}}_2$-extensions of some number fields, we compute the rank of the $2$-class group of $L_{m,d}$ whenever the prime divisors of $d$ are congruent to $3$ or $5(mod8)$.

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

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