اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProducts of quadratic residues and related identities
147
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 $pequiv5pmod8$, then $$prod_{0<x<p/2,(frac{x}{p})=1}xequiv(-1)^{1+r}pmod p,$$ where $(frac{cdot}{p})$ is the Legendre symbol and $r$ is the number of $4$-th power residues modulo $p$ in the interval $(0,p/2)$. Our work involves class number formula, quartic Gauss sums, Stickelbergers congruence and values of Dirichlet L-series at negative integers.
قيم البحث
اقرأ أيضاً
For a prime $pge 5$ let $q_0,q_1,ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}bmod 2$ and $t_n=1$ if $q_{n+1}=q_n+1$ and $
t_n=0$ otherwise, $n=0,1,ldots,(p-5)/2$. For both sequences we find some sufficient conditions for attaining the maximal linear complexity $(p-3)/2$. Studying the linear complexity of $(d_n)$ was motivated by heuristics of Caragiu et al. However, $(d_n)$ is not balanced and we show that a period of $(d_n)$ contains about $1/3$ zeros and $2/3$ ones if $p$ is sufficiently large. In contrast, $(t_n)$ is not only essentially balanced but also all longer patterns of length $s$ appear essentially equally often in the vector sequence $(t_n,t_{n+1},ldots,t_{n+s-1})$, $n=0,1,ldots,(p-5)/2$, for any fixed $s$ and sufficiently large $p$.
Let $p>3$ be a prime, and let $(frac{cdot}p)$ be the Legendre symbol. Let $binmathbb Z$ and $varepsilonin{pm 1}$. We mainly prove that $$left|left{N_p(a,b): 1<a<p text{and} left(frac apright)=varepsilonright}right|=frac{3-(frac{-1}p)}2,$$ where $N_p(
a,b)$ is the number of positive integers $x<p/2$ with ${x^2+b}_p>{ax^2+b}_p$, and ${m}_p$ with $minmathbb{Z}$ is the least nonnegative residue of $m$ modulo $p$.
We present a short, self-contained, and purely combinatorial proof of Linniks theorem: for any $varepsilon > 0$ there exists a constant $C_varepsilon$ such that for any $N$, there are at most $C_varepsilon$ primes $p leqslant N$ such that the least p
ositive quadratic non-residue modulo $p$ exceeds $N^varepsilon$.
Let $qgeq 1$ be any integer and let $ epsilon in [frac{1}{11}, frac{1}{2})$ be a given real number. In this short note, we prove that for all primes $p$ satisfying $$ pequiv 1pmod{q}, quad loglog p > frac{log 6.83}{frac{1}{2}-epsilon} mbox{ and } fra
c{phi(p-1)}{p-1} leq frac{1}{2} - epsilon, $$ there exists a quadratic non-residue $g$ which is not a primitive root modulo $p$ such that $gcdleft(g, frac{p-1}{q}right) = 1$.
Since the study by Jacobi and Hecke, Hecke-type series have received a lot of attention. Unlike such series associated with indefinite quadratic forms, identities on Hecke-type series associated with definite quadratic forms are quite rare in the lit
erature. Motivated by the works of Liu, we first establish many parameterized identities with two parameters by employing different $q$-transformation formulas and then deduce various Hecke-type identities associated with definite quadratic forms by specializing the choice of these two parameters. As applications, we utilize some of these Hecke-type identities to establish families of inequalities for several partition functions. Our proofs heavily rely on some formulas from the work of Zhi-Guo Liu.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
