相关论文: Number of binomial coefficients divided by a fixed…

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

Every binomial coefficient aficionado knows that the greatest common divisor of the binomial coefficients $\binom n1,\binom n2,\dots,\binom n{n-1}$ equals $p$ if $n=p^i$ for some $i>0$ and equals 1 otherwise. It is less well known that the…

Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity…

For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…

Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients…

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

In 1947 Fine obtained an expression for the number of binomial coefficients on row n of Pascal's triangle that are nonzero modulo p. In this paper we use Kummer's theorem to generalize Fine's theorem to prime powers, expressing the number…

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

In this article, we give explicit formulas for the $p$-adic valuations of the Fibonomial coefficients ${p^a n \choose n}_F$ for all primes $p$ and positive integers $a$ and $n$. This is a continuation from our previous article extending…

The article describes prime intervals into the prime factorization of the middle binomial coefficient. Prime factors and prime powers are distributed in layers. Each layer consists of non-repeated prime numbers which are chosen (not…

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.

The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…

Let $m$ and $n>0$ be integers. Suppose that $p$ is a prime dividing $m-4$ but not dividing $m$. We show that $\nu_p(\sum_{k=0}^{n-1}\frac{\binom{2k}k}{m^k})$ and $\nu_p(\sum_{k=0}^{n-1}\binom{n-1}{k}(-1)^k\frac{\binom{2k}k}{m^k})$ are at…

We complete a proof of a theorem that was inspired by an Indian Olympiad problem, which gives an interesting characterization of a prime number $p$ with respect to the binomial coefficients ${n\choose p}$. We also derive a related result…

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…