Timeline for Does there exist a polynomial that extracts the highest digit of an integer in base p?
Current License: CC BY-SA 4.0
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 27 at 13:39 | comment | added | Peter Taylor | The highest digit of $a$ is $1$ and of $b$ is $p-1$, so they do differ. The contradiction is that $p$ doesn't divide into $p-2$. | |
Jun 27 at 13:27 | comment | added | fofo | Thanks for your nice answer! I see that finding a $f(x)$ that directly extracts the highest digit is not feasible in this setting. Is it safe to say that removing the highest digit is just as hard as extracting the highest digit? So that no $f(x)$ can map $x=\sum_{i=0}^{n-1}x_ip^i$ to $x=(0,x_{n-2},...,x_1,x_0)$ either? | |
Jun 27 at 4:56 | history | answered | Fedor Petrov | CC BY-SA 4.0 |