相关论文: Divisibility of binomial coefficients and generati…

In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this…

We verify that every alternating group of degree at most one quadrillion is invariably generated by an element of prime order together with an element of prime power order.

We develop an elementary divisor theory for the unimodular and the modular group over quadratic field extensions and quaternion algebras. In particular, we investigate which sets of elementary divisors can occur. Under an additional…

We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…

Simple divisibility rules are given for the 1st 1000 prime numbers.

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

The divisibility of truncated binomial series by their exponent n is analyzed. Divisibility is shown to depends on the divisibility characteristics of the integers constituting the binomials. Series division by the highest possible powers…

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…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…

We give a formula for the coefficients of the Yablonskii-Vorob'ev polynomial. Also the reduction modulo a prime number of the polynomial is studied.

We shall present an elementary approach to extremal decompositions of (quantum) covariance matrices determined by densities. We give a new proof on former results and provide a sharp estimate of the ranks of the densities that appear in the…

In this paper we consider the notions of binomial thinning, binomial mixing, their generalizations, certain interplay between them, associated limit theorems and provide various examples.

We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayley-Dickson algebra, and prove a connection between the alternating roots of a given polynomial and the roots of the corresponding…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable…