Related papers: Efficient Lifting of Discrete Logarithms Modulo Pr…

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.

Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac…

Let $G=D_p$ be the dihedral group of order $2p$, where $p$ is an odd prime. Let $k$ an algebraically closed field of characteristic $p$. We show that any action of $G$ on the ring $k[[y]]$ can be lifted to an action on $R[[y]]$, where $R$…

We establish the existence of liftings into discrete subspaces of $\mathbf{H}(\mathrm{div})$ of piecewise polynomial data on locally refined simplicial partitions of polygonal/polyhedral domains. Our liftings are robust with respect to the…

Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Christol and, independently, Denef and Lipshitz showed that an algebraic sequence of $p$-adic integers (or integers) is $p$-automatic when reduced modulo $p^\alpha$. Previously, the best known bound on the minimal automaton size for such a…

We present a formal verification of Wolstenholme's theorem -- $\binom{2p}{p} \equiv 2 \pmod{p^3}$ for prime $p \geq 5$ -- in Lean~4 with Mathlib. The proof proceeds by expanding the shifted factorial product $\prod_{k=1}^{p-1}(p+k)$ to…

We prove that $p$-determinants of a certain class of differential operators can be lifted to power series over $\mathbb{Q}$. We compute these power series in terms of monodromy of the corresponding differential operators.

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$.

In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.

In this paper, we show that for almost all primes p there is an integer solution x in [2,p-1] to the congruence x^x == x mod p. The solutions can be interpretated as fixed points of the map x -> x^x mod p, and we study numerically and…

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 present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.

Solving the discrete logarithm problem in a finite prime field is an extremely important computing problem in modern cryptography. The hardness of solving the discrete logarithm problem in a finite prime field is the security foundation of…

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

We present some congruences modulo $p^{6-d}$ for sums of the type $\sum_{k=0}^{(p-3)/2}x^k{2k\choose k}/(2k+1)^d$, for $d=1,2,3$ where $p>5$ is a prime.