相关论文: Computing the n-th coefficient of an algebraic pow…

We revisit Christol's theorem on algebraic power series in positive characteristic and propose yet another proof for it. This new proof combines several ingredients and advantages of existing proofs, which make it very well-suited for…

We determine the p-exponent in many of the coefficients in the power series (log(1+x)/x)^t, where t is any integer. In our proof, we introduce a variant of multinomial coefficients. We also characterize the power series x/log(1+x) by…

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

We provide a new proof of the multivariate version of Christol's theorem about algebraic power series with coefficients in finite fields, as well as of its extension to perfect ground fields of positive characteristic obtained independently…

A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an…

This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…

Let $p$ be a sufficiently large prime number, $n$ be a positive odd integer with $n|\,p-1$ and $n>p^\varepsilon $, where $\varepsilon$ is a sufficiently small constant. Let $k(p,\,n)$ denote the least positive integer $k$ such that for…

In this paper we give simple expressions, involving binomials coefficients, for the value of $c(n,k)$ modulo $p^{v_p(n)}$, when $v_p(n) > 0$. Here $c(n,k)$ denotes a Stirling number of the first kind, and $v_p(n)$ is the highest power of…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

Algebraic power series are formal power series which satisfy a univariate polynomial equation over the polynomial ring in n variables. This relation determines the series only up to conjugacy. Via the Artin-Mazur theorem and the implicit…

We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…

A famous result of Christol gives that a power series $F(t)=\sum_{n\ge 0} f(n)t^n$ with coefficients in a finite field $\mathbb{F}_q$ of characteristic $p$ is algebraic over the field of rational functions in $t$ if and only if there is a…

By using an asymptotic formula known for the numbers of Euler and Bernoulli it is possible to obtain an explicit expression of the nth digit of $\pi$ in decimal or in binary, it also makes it possible to obtain the $n^{\rm th}$ digit of…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

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}…

Translation from the Latin original, "Demonstratio gemina theorematis Neutoniani, quo traditur relatio inter coefficientes cuiusvis aequationis algebraicae et summas potestatum radicum eiusdem" (1747). E153 in the Enestrom index. In this…

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…