TL;DR: In the integer case, the Kempner function of a positive integer is defined to be the smallest positive integer such that it divides the Carlitz factorial of the positive integer as discussed by the authors.
Abstract: In the integer case, the Kempner function of a positive integer $n$ is defined to be the smallest positive integer $k$ such that $n$ divides the factorial $k!$. In this paper, we first define a natural order for polynomials in $\F_q[t]$ over a finite field $\F_q$ and then define the Kempner function of a non-zero polynomial $f \in \F_q[t]$, denoted by $K(f)$, to be the smallest polynomial $g$ such that $f$ divides the Carlitz factorial of $g$. In particular, we establish an analogue of a problem of Erd{\H o}s, which implies that for almost all polynomials $f$, $K(f)=t^d$, where $d$ is the maximal degree of the irreducible factors of $f$.
TL;DR: In this article, it was shown that for any fixed number k > 1, the inequality (n^k < S(n)!$) holds for almost all positive integers (n = 1).
Abstract: The Smarandache function of a positive integer $n$, denoted by $S(n)$, is defined to be the smallest positive integer $j$ such that $n$ divides the factorial $j!$. In this note, we prove that for any fixed number $k > 1$, the inequality $n^k < S(n)!$ holds for almost all positive integers $n$. This confirms Sondow's conjecture which asserts that the inequality $n^2 < S(n)!$ holds for almost all positive integers $n$.
TL;DR: This paper presents an alternative characterization of polynomial functions over Z n by constructing a generating set for the Z n -module of Poole's inequality, which results in an algorithm that is faster on average in decidingPolynomial representability.
Abstract: Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing a generating set for the $\mathbb{Z}_{n}$-module of polynomial functions. This characterization results in an algorithm that is faster on average in deciding polynomial representability. We also extend the characterization to functions in several variables.