Related papers: Formulas For The Square Root Modulo p

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

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…

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…

In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are…

Let $P_{r}$ denote an integer with at most $r$ prime factors counted with multiplicity. In this paper we prove that for some $\lambda < \frac{1}{12}$, the inequality $\{\sqrt{p}\}<p^{-\lambda}$ has infinitely many solutions in primes $p$…

In this paper, we show that if $p\equiv 1\pmod 4$ is prime, then $4F_p$ admits a representation of the form $u^2-pv^2$ for some integers $u$ and $v$, where $F_n$ is the $n$th Fibonacci number. We prove a similar result when $p\equiv -1\pmod…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Let p denote an odd prime. For all p-admissible conductors c over a quadratic number field \(K=\mathbb{Q}(\sqrt{d})\), p-ring spaces \(V_p(c)\) modulo c are introduced by defining a morphism \(\psi:\,f\mapsto V_p(f)\) from the divisor…

Let $p>5$ be a prime. We prove congruences modulo $p^{3-d}$ for sums of the general form $\sum_{k=0}^{(p-3)/2}\binom{2k}{k}t^k/(2k+1)^{d+1}$ and $\sum_{k=1}^{(p-1)/2}\binom{2k}{k}t^k/k^d$ with $d=0,1$. We also consider the special case…

We study the splitting fields of the family of polynomials $f_n(X)= X^n-X-1$. This family of polynomials has been much studied in the literature and has some remarkable properties. Serre related the function on primes $N_p(f_n)$, for a…

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

Let $p$ be a prime, and let $n>0$ and $r$ be integers. In this paper we study Fleck's quotient $$F_p(n,r)=(-p)^{-\lfloor(n-1)/(p-1)\rfloor} \sum_{k=r(mod p)}\binom {n}{k}(-1)^k\in Z.$$ We determine $F_p(n,r)$ mod $p$ completely by certain…

We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke,…

We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.