Related papers: Simultaneous Elements Of Prescribed Multiplicative…

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

In this paper we study products of quadratic residues modulo odd primes and prove some identities involving quadratic residues. For instance, let $p$ be an odd prime. We prove that if $p\equiv5\pmod8$, then…

For an $n$-bit positive integer $a$ written in binary as $$ a = \sum_{j=0}^{n-1} \varepsilon_{j}(a) \,2^j $$ where, $\varepsilon_j(a) \in \{0,1\}$, $j\in\{0, \ldots, n-1\}$, $\varepsilon_{n-1}(a)=1$, let us define $$ \overleftarrow{a} =…

Let $p^k m^2$ be an odd perfect number with special prime $p$. In this article, we provide an alternative proof for the biconditional that $\sigma(m^2) \equiv 1 \pmod 4$ holds if and only if $p \equiv k \pmod 8$. We then give an application…

In this note, we prove by using T. Estermann's and S. Dimitrov's arguments with an elementary inequality that there are infinitely many $n$ for which all of the numbers $n^2+1,n^2+2$ and $n^2+3$ are squarefree. We also improve the error…

Two conjectures, posed by Finch-Smith, Harrington, and Wong in a paper published in Integers in $2023$, are proven. Given a monic biquadratic polynomial $f(x) = x^4 + cx^2 + e$, we prove a formula for the sum of its distinct outputs modulo…

In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…

Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd…

Let $n \geq 1$ be a squarefree integer, and let $M$, $A$ be two groups of order $n$. Using our previous results on the enumeration of Hopf-Galois structures on Galois extensions of fields of squarefree degree, we determine the number of…

We study integral almost square-free modular categories; i.e., integral modular categories of Frobenius-Perron dimension $p^nm$, where $p$ is a prime number, $m$ is a square-free natural number and ${\rm gcd}(p,m)=1$. We prove that if…

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

In this paper, we consider the problem of order preservation under addition and multiplication operators over the vector space of univariate real-valued random variables. Consistent with the case of usual order over the real numbers-as…

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

Let $E_1$ and $E_2$ be elliptic curves in Legendre form with integer parameters. We show there exists a constant $C$ such that for almost all primes, for all but at most $C$ pairs of points on the reduction of $E_1 \times E_2$ modulo $p$…

Let $m$ be any positive integer and let $\delta_1,\delta_2\in\{1,-1\}$. We show that for some constanst $C_m>0$ there are infinitely many integers $n>1$ with $p_{n+m}-p_n\le C_m$ such that $$\left(\frac{p_{n+i}}{p_{n+j}}\right)=\delta_1\…

Can one find an integer $g$ and a polynomial $f$, such that $g$ is a primitive root for many consecutive (different) prime values assumed by $f$? Moree considered this problem in 2007 with computational assistence from Gallot and…

Intersective polynomials are polynomials in $\Z[x]$ having roots every modulus. For example, $P_1(n)=n^2$ and $P_2(n)=n^2-1$ are intersective polynomials, but $P_3(n)=n^2+1$ is not. The purpose of this note is to deduce, using results of…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

For any distinct two primes $p_1\equiv p_2\equiv 3$ $(\text{mod }4)$, let $h(-p_1)$, $h(-p_2)$ and $h(p_1p_2)$ be the class numbers of the quadratic fields $\mathbb{Q}(\sqrt{-p_1})$, $\mathbb{Q}(\sqrt{-p_2})$ and…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…