Related papers: Formulas For The Square Root Modulo p

In this article, we prove a modulo $p$ congruence which connects the class number of the quadratic field $\mathbb{Q}(\sqrt{(-1)^{(p-1)/2}p})$ and the trace of a certain monomial in a root $\theta$ of the Artin-Schreier polynomial…

Let p be an odd prime number. Using some previous work of the two authors, we determine the socle filtration of all irreducible smooth mod p representations of SL(2,Q_{p}).

Let $p\equiv 1\pmod{8}$ and $q\equiv7\pmod 8$ be two prime numbers. The purpose of this paper is to compute the unit group of the fields $\KK=\QQ(\sqrt 2, \sqrt{p}, \sqrt{q} )$ and give their $2$-class numbers.

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

This paper applies the modular approach to obtain effectively computable bounds for Fermat-type equations over number fields, while also discussing the differences and obstructions that arise when considering such equations over totally…

Extending work of J. Raleigh, we compute polynomials $P_{n,F}(x)$ associated to certain families $F = \{f_m\}_{m = 3, 4, ...}$ of modular forms for Hecke groups $G(\lambda_m)$ with the property that $P_{n,F}(m)$ is the $n^{th}$ coefficient…

We prove that if the signed binomial coefficient $(-1)^i\binom{k}{i}$ viewed modulo p is a periodic function of i with period h prime to p in the range $0\le i\le k$, then k+1 is a power of p, provided h is not too large compared to k. (In…

Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…

For fixed prime integer $p > 0$ we develop a notion of Bernstein-Sato polynomial for polynomials with $\mathbb{Z} / p^m$-coefficients, compatible with existing theory in the case $m = 1$. We show that the ``roots" of such polynomials are…

Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

In this paper we shall investigate the problem of the representation of the number of integral points of an elliptic curve modulo a prime number p. We present a way of expressing an exponential sum which involves polynomials of third…

The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…

A curious identity of Bunyakovsky (1882), made more widely known by P\'olya and Szeg{\H o} in their ``Problems and Theorems in Analysis", gives an evaluation of a sum of the floor function of square roots involving primes $p\equiv…

The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.

Let $p=2n+1$ be an odd prime, and let $\zeta_{p^2-1}$ be a primitive $(p^2-1)$-th root of unity in the algebraic closure $\overline{\mathbb{Q}_p}$ of $\mathbb{Q}_p$. We let $g\in\mathbb{Z}_p[\zeta_{p^2-1}]$ be a primitive root modulo…

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

Let $S_p(n)$ denote the sum of $p$th powers of the first $n$ positive integers $1^p + 2^p + \cdots + n^p$. In this paper, first we express $S_p(n)$ in the so-called Faulhaber form, namely, as an even or odd polynomial in $(n + 1/2)$,…

For prime $p\equiv-1\bmod d$ and $q$ a power of $p$, we obtain the slopes of the $q$-adic Newton polygons of $L$-functions of $x^d+ax^{d-1}\in \mathbb{F}_q[x]$ with respect to finite characters $\chi$ when $p$ is larger than an explicit…