相关论文: Integral Factorial Ratios

We show that the new relation between master integrals recently obtained in Ref. [1] can be reproduced using the integration-by-parts technique implemented with an effective mass. In fact, this relation is recovered as a special case of a…

A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit operations is presented. The algorithm tests the divisibility of $n$ by all the integers in a short interval at once, rather than integer by integer as in trial division.…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We consider the equations $(k!)^{n!}\pm k^n=(n!)^{k!}\pm n^k$ and $(k!)^n\pm…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

We prove that $d_k(n)=d_k(n+B)$ infinitely often for any positive integers $k$ and $B$, where $d_k(n)$ denotes the number of divisors of $n$ coprime to $k$.

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.

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

For the solution $\{u_n\}_{n=0}^\infty$ to the polynomial recursion $(n+1)^5u_{n+1}-3(2n+1)(3n^2+3n+1)(15n^2+15n+4)u_n -3n^3(3n-1)(3n+1)u_{n-1}=0$, where $n=1,2,...$, with the initial data $u_0=1$, $u_1=12$, we prove that all $u_n$ are…

The object of this paper is to investigate the certain results involving Bateman's matrix polynomials for integral index. We obtain some properties, integral representation and recurrence relations for hypergeometric matrix function. We…

Under sufficiently strong assumptions about the first term in an arithmetic progression, we prove that for any integer $a$, there are infinitely many $n\in \mathbb N$ such that for each prime factor $p|n$, we have $p-a|n-a$. This can be…

For any positive integer $n$, let $\sigma (n)$ be the sum of all positive divisors of $n.$ In this paper, it is proved that for every integer $ 1\leq k\leq 29,\ (k,30)=1, $ we have $$\sum_{n\leq K}\sigma(30n)>\sum_{n\leq K}\sigma(30n+k)$$…

In 1991, David Gale and Raphael Robinson, building on explorations carried out by Michael Somos in the 1980s, introduced a three-parameter family of rational recurrence relations, each of which (with suitable initial conditions) appeared to…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

Let $S_p(n)$ denote the sum of $p$th powers of the first $n$ positive integers $1^p + 2^p + \cdots + n^p$. In this paper, first we express $S_p(n)$ in the so-called Faulhaber form, namely, as an even or odd polynomial in $(n + 1/2)$,…

In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation $n!=x^2-1$. It is conjectured that this equation has only three solutions, but up to now this is an open problem. Overholt observed…