All Questions

This question was previously posted here on MSE. Let $P(x)$ be a polynomial with integer coefficients, and let $p$ be a prime number. For $n\in\mathbb N$, let $I_n$ be the number of integers $i\in\{1,\...

Let $p$ be an odd prime and $n \geq 2$. (1) Does there exist an integer-coefficient polynomial $f$ such that $f(x) = x - (x \bmod p)$ for all $x \in \mathbb{Z}/p^n \mathbb{Z}$? The polynomial ...

Given an odd prime $p$, a positive integer $1 \lt n$, and an integer $x \in \mathbb{Z}/p^n\mathbb{Z}$, does there exist an an integer-coefficient polynomial that extracts the highest digit of $x$? The ...

Let $q$ be a power of a prime $p$. For every $i\in\mathbb N$, one denotes $D_i=\prod_{\substack{h\in\mathbb F_q[T]\text{ monic}\\\deg h=i}}\limits h$. For $n\in\mathbb N$, write $$n=n_0+n_1q+\cdots+...

If $q$ is a prime what is the best method to compute roots of a quadratic polynomial $f(x)\equiv0\bmod q^2$ which is of form $x^2+bx+c\equiv0\bmod q^2$ where $b^2-4c\equiv0\bmod q$ and $gcd(b,q)=1$ ...