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 K be an algebraic number field with non-trivial class group G and ${}_K$ be its ring of integers. For k ∈ ℕ and some real x ≥ 1, let $F_k\left(x\right)$ denote the number of non-zero principal ideals $a_K$ with norm bounded by x such that a has at most k distinct factorizations into irreducible elements. It is well known that $F_k\left(x\right)$ behaves for x → ∞ asymptotically like $x{\left(logx\right)}^{1-1/\left|G\right|}{\left(loglogx\right)}^{{}_k\left(G\right)}$. We prove, among other results, that $₁\left(C_{n₁}\oplus C_{n₂}\right)=n₁+n₂$ for all integers n₁,n₂ with 1 < n₁|n₂.

Let $E/K$ be an elliptic curve defined over a number field, and let $P\in E\left(K\right)$ be a point of infinite order. It is natural to ask how many integers $n\ge 1$ fail to occur as the order of $P$ modulo a prime of $K$. For $K=\mathbb{Q}$, $E$ a quadratic twist of $y^2=x^3-x$, and $P\in E\left(\mathbb{Q}\right)$ as above, we show that there is at most one such $n\ge 3$.

Let $p$ be a prime number. In this paper we prove that the addition in $p$-ary without carry admits a recursive definition like in the already known cases $p=2$ and $p=3$.

Such problems as the search for Wieferich primes or Wall-Sun-Sun primes are intensively studied and often discused at present. This paper is devoted to a similar problem related to the Tribonacci numbers.