English
Related papers

Related papers: Consecutive Quadratic Residues And Quadratic Nonre…

200 papers

In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.

Number Theory · Mathematics 2017-02-13 Weiqiong Wang , Liping Wang , Haiyan Zhou

Let $p$ be a prime number, $p=2^nq+1$, where $q$ is odd. D. Shanks described an algorithm to compute square roots $\pmod{p}$ which needs $O(\log q + n^2)$ modular multiplications. In this note we describe two modifications of this…

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

Given a primitive, non-CM, holomorphic cusp form $f$ with normalized Fourier coefficients $a(n)$ and given an interval $I\subset [-2, 2]$, we study the least prime $p$ such that $a(p)\in I$ . This can be viewed as a modular form analogue of…

Number Theory · Mathematics 2022-09-02 Ratnadeep Acharya , Sary Drappeau , Satadal Ganguly , Olivier Ramaré

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

Number Theory · Mathematics 2022-01-19 Stephan Baier , Anup Haldar

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

Combinatorics · Mathematics 2024-01-12 Abdelmalek Abdesselam

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

This note concerns the non-existence of three consecutive powerful numbers. We use Pell equations, elliptic curves, and second-order recurrences to show that there are no such triplets with the middle term a perfect cube and each of the…

Number Theory · Mathematics 2025-03-28 Tsz Ho Chan

Suppose that $p$ is an odd prime and $\genfrac{(}{)}{}{}{\cdot}{p}$ denotes the Legendre symbol modulo $p$. If $p$ is has the form $p= n^2+1$ then one easily verifies that $\genfrac{(}{)}{}{}{a}{p} = \genfrac{(}{)}{}{}{-a}{p}$ for all $a\in…

Number Theory · Mathematics 2018-08-21 Yemeen Ayub , Charles L. Samuels

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

General Mathematics · Mathematics 2015-04-03 N. A. Carella

In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…

Combinatorics · Mathematics 2023-08-17 Lubomíra Balková , Aranka Hrušková

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Number Theory · Mathematics 2017-04-28 Carlos D'Andrea , Alina Ostafe , Igor E. Shparlinski , Martin Sombra

Let $u\ne \pm 1$, and $v\ne \pm 1$ be a pair of fixed relatively prime squarefree integers, and let $d\geq 1$, and $e \geq1$ be a pair of fixed integers. It is shown that there are infinitely many primes $p\geq 2$ such that $u$ and $v$ have…

General Mathematics · Mathematics 2021-03-09 N. A. Carella

Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…

General Mathematics · Mathematics 2024-11-04 Marc Wolf , François Wolf

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

Dynamical Systems · Mathematics 2007-05-23 Nikos Frantzikinakis , Bernard Host , Bryna Kra

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

Number Theory · Mathematics 2011-08-02 Mitja Lakner , Peter Petek , Marjeta Škapin Rugelj

This article provides a proof of a generalization of Schur's theorem on the partition regularity of the equation x+y=z, which involves a divisibility condition. This generalization will be utilized to prove the existence of 'small'…

Number Theory · Mathematics 2013-10-01 Carsten Dietzel

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev , A. A. Karatsuba

Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_{\epsilon}(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 +…

General Mathematics · Mathematics 2011-09-13 Hisanobu Shinya

In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex…

Commutative Algebra · Mathematics 2008-03-19 Uffe Haagerup

An $n$-ary integral quadratic form is a formal expression $Q(x_1,...,x_n)=\sum_{1\leq i,j\leq n}a_{ij}x_ix_j$ in $n$-variables $x_1,...,x_n$, where $a_{ij}=a_{ji} \in \mathbb{Z}$. We present a poly$(n,k, \log p, \log t)$ randomized…

Data Structures and Algorithms · Computer Science 2014-09-23 Chandan Dubey , Thomas Holenstein