English
Related papers

Related papers: Factorials and powers, a minimality result, revisi…

200 papers

Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…

Number Theory · Mathematics 2021-06-04 David E. Radford

We study a sequence of differences related to the problem of finding the smallest factorial $n!$ greater than or equal to $a^n$, where $a > 1$, using the gamma function.

Number Theory · Mathematics 2021-06-04 David E. Radford

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Number Theory · Mathematics 2022-11-15 Joshua Zelinsky

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

Number Theory · Mathematics 2018-05-30 Zeév Rudnick

Our main result shows that for every odd natural number n > 1 there is a partition of the rational numbers, x/2n in lowest terms, in the unit interval, the product of whose Gamma values takes the form of powers of 2 and pi.

Classical Analysis and ODEs · Mathematics 2009-07-13 Albert Nijenhuis

Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…

Symbolic Computation · Computer Science 2013-02-12 Albert D. Rich , David R. Stoutemyer

Let b > 1 be an integer and denote by s_b(m) the sum of the digits of the positive integer m when is written in base b. We prove that s_b(n!) > C_b log n log log log n for each integer n > e, where C_b is a positive constant depending only…

Number Theory · Mathematics 2014-10-30 Carlo Sanna

Sequence of positive integers $\{x_n\}_{n\geq1}$ is called similar to $\mathbb {N}$ respectively a given property $A$ if for every $n\geq1$ the numbers $x_n$ and $n$ are in the same class of equivalence respectively $A\enskip(x_n\sim n…

Number Theory · Mathematics 2009-04-20 Vladimir Shevelev

For a positive rational $\alpha$, call a set of distinct positive integers $\{a_1, a_2, \ldots, a_r\}$ an $\alpha$-partition of $n$, if the sum of the $a_i$ is equal to $n$ and the sum of the reciprocals of the $a_i$ is equal to $\alpha$.…

Number Theory · Mathematics 2025-07-25 Wouter van Doorn

Recently, there has been some interest in values of arithmetical functions on members of special sequences, such as Euler's totient function $\phi$ on factorials, linear recurrences, etc. In this article, we investigate, for given positive…

Number Theory · Mathematics 2021-11-19 Ayan Nath , Abhishek Jha

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

Number Theory · Mathematics 2026-04-28 Dan Levy

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

Rings and Algebras · Mathematics 2025-02-11 Yves Fomatati

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

Commutative Algebra · Mathematics 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Let $\alpha$ be a real number greater than $1$. We establish an effective lower bound for the distance between an integral power of $\alpha$ and its nearest integer.

Number Theory · Mathematics 2021-01-25 Yann Bugeaud

In this paper, we state a conjecture on the prime factorization of numbers of the form $n!+1$, explore its implications, and compare it with empirical evidence and established results based on the $abc$ conjecture.

General Mathematics · Mathematics 2018-09-21 William Gerst

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…

Number Theory · Mathematics 2020-02-11 Xiumei Li , Min Sha

Let D(n) be the set of all fractions in the unit interval whose denominator in lowest terms equals $n$. We evaluate the product of the values of the Gamma function at the points of D(n), as a function of $n$; the answer depends on whether…

Classical Analysis and ODEs · Mathematics 2009-12-14 Greg Martin

Let P be a finite set of at least two prime numbers, and A the set of positive integers that are products of powers of primes from P. Let F(k) denote the smallest positive integer which cannot be presented as sum of less than k terms of A.…

Number Theory · Mathematics 2012-01-20 Lajos Hajdu , Rob Tijdeman

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…

Number Theory · Mathematics 2026-04-17 Alice Bazzanella , Carlo Sanna
‹ Prev 1 2 3 10 Next ›