English
Related papers

Related papers: Formulas For The Square Root Modulo p

200 papers

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Mittal , Ashok Kumar Gupta

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

Combinatorics · Mathematics 2023-06-30 P Vanchinathan , Kevinsam B

Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…

Number Theory · Mathematics 2014-10-10 Alain Kraus

We give a method for producing explicit bounds on $g(p)$, the least primitive root modulo $p$. Using our method we show that $g(p)<2r\,2^{r\omega(p-1)}\,p^{\frac{1}{4}+\frac{1}{4r}}$ for $p>10^{56}$ where $r\geq 2$ is an integer parameter.…

Number Theory · Mathematics 2019-04-30 Kevin J. McGown , Tim Trudgian

Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…

Information Theory · Computer Science 2017-06-02 Yanping Wang , WeiGuo Zhang , Zhengbang Zha

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

Symbolic Computation · Computer Science 2017-05-31 Vincent Neiger , Johan Rosenkilde , Eric Schost

Let $\ell$ be an odd prime, $q$ an odd prime power such that $q \not\equiv 0 \pmod \ell$, and $m$ the order of $q$ in $\F_\ell^\times$. We propose an explicit $L$-polynomial of hyperelliptic function field $K:=\F_q(T,…

Number Theory · Mathematics 2025-12-10 Peter Jaehyun Cho , Jinjoo Yoo

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

Computational Complexity · Computer Science 2019-02-27 Ashish Dwivedi , Rajat Mittal , Nitin Saxena

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

Number Theory · Mathematics 2023-09-04 Vítězslav Kala , Piotr Miska

For prime $p$ we define magic squares of order $kp^3$, called type-$p$ Franklin squares, whose properties specialize to those of classical Franklin squares in the case $p=2$. We construct type-$p$ Franklin squares in prime-power orders.

Combinatorics · Mathematics 2017-12-29 John Lorch

The purpose of this note is to obtain some congruences modulo a power of a prime $p$ involving the truncated hypergeometric series $$\sum_{k=1}^{p-1} {(x)_k(1-x)_k\over (1)_k^2}\cdot{1\over k^a}$$ for $a=1$ and $a=2$. In the last section,…

Number Theory · Mathematics 2011-05-24 Roberto Tauraso

Let $\bbk$ be an algebraically closed field of prime characteristic $p$. If $p$ does not divide $n$, irreducible modules over $\frak {sl}_n$ for regular and subregular nilpotent representations have already known(see \cite{Jan2} and…

Representation Theory · Mathematics 2021-10-15 Bin Liu , Bin Shu , Xin Wen

Given an odd prime $p$, we identify composition factors of the reduction modulo $p$ of spin irreducible representations of the covering groups of symmetric groups indexed by partitions with 2 parts and find some decomposition numbers.

Representation Theory · Mathematics 2019-12-20 Lucia Morotti

Let $g(p)$ denote the least primitive root modulo $p$, and $h(p)$ the least primitive root modulo $p^2$. We computed $g(p)$ and $h(p)$ for all primes $p\le 10^{16}$. Here we present the results of that computation and prove three theorems…

Number Theory · Mathematics 2024-11-13 Kevin J. McGown , Jonathan P. Sorenson

We use properties of modular forms to prove the following extension of the Ramanujan-Mordell formula, \begin{align*} z^{k-j}z_p^{j}=&\frac{p_{\chi}^{k-j}-1}{p_{\chi}^{k}-1}F_p(k,j;\tau)+…

Number Theory · Mathematics 2018-08-06 Zafer Selcuk Aygin

In this paper the properties of R\'edei rational functions are used to derive rational approximations for square roots and both Newton and Pad\'e approximations are given as particular cases. As a consequence, such approximations can be…

Number Theory · Mathematics 2014-09-23 Marco Abrate , Stefano Barbero , Umberto Cerruti , Nadir Murru

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

Number Theory · Mathematics 2016-04-06 J. Cilleruelo , M. Z. Garaev

We prove that any prime $p$ satisfying $\phi(p-1)\leq (p-1)/4$ contains two consecutive quadratic non-residues modulo $p$ neither of which is a primitive root modulo $p$.

Number Theory · Mathematics 2017-10-16 Tamiru Jarso , Tim Trudgian

Following what Barthel-Livn\'e and Breuil made for GL(2,F), we study mod $p$ representations of SL(2,F) for F a complete non-archimedean local field of residual characteristic p and with finite residue field. In particular, we link these…

Representation Theory · Mathematics 2024-02-16 Ramla Abdellatif

We obtain a new bound for the number of solutions to polynomial equations in cosets of multiplicative subgroups in finite fields, which generalises previous results of P. Corvaja and U. Zannier (2013). We also obtain a conditional…

Number Theory · Mathematics 2020-05-13 Sergei V. Konyagin , Igor E. Shparlinski , Ilya V. Vyugin