Results 31 to 40 of about 174,940 (323)
Infinite series about harmonic numbers inspired by Ramanujan–like formulae
By employing the coefficient extraction method from hypergeometric series, we shall establish numerous closed form evaluations for infinite series containing central binomial coefficients and harmonic numbers, including several conjectured ones made by Z.
Chunli Li, Wenchang Chu
doaj +1 more source
Practical central binomial coefficients [PDF]
A practical number is a positive integer $n$ such that all positive integers less than $n$ can be written as a sum of distinct divisors of $n$. Leonetti and Sanna proved that, as $x \to +\infty$, the central binomial coefficient $\binom{2n}{n}$ is a practical number for all positive integers $n \leq x$ but at most $O(x^{0.88097})$ exceptions.
openaire +4 more sources
A generalization of the binomial coefficients
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 d terminer est la meilleure g n ralisation possible des factorielles et des coefficients du bin ome.
openaire +4 more sources
Three new classes of binomial Fibonacci sums [PDF]
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients. One particular result is linked to a problem proposal recently published in the journal The Fibonacci Quarterly.
Robert Frontczak
doaj +1 more source
A note on a one-parameter family of non-symmetric number triangles [PDF]
The recent growing interest in special Clifford algebra valued polynomial solutions of generalized Cauchy-Riemann systems in \((n + 1)\)-dimensional Euclidean spaces suggested a detailed study of the arithmetical properties of their coefficients, due to ...
Maria Irene Falcão, Helmuth R. Malonek
doaj +1 more source
On congruences for binomial coefficients
For primes \(p=1+4f=a^ 2+b^ 2\), \(a\equiv 1 (mod 4)\), Gauss proved that \(\left( \begin{matrix} 2f\\ f\end{matrix} \right)\equiv 2a (mod p)\). For primes \(p=1+kf\) (k\(\geq 3)\), many congruences modulo p, for the binomial coefficients \(\left( \begin{matrix} rf\\ sf\end{matrix} \right ...
openaire +3 more sources
Inequalities for Binomial Coefficients
For any real number \(r\) with \(r>1\), let \(c_r= (2\pi(1-{1\over r}))^{-1/2}\) and \(d_r= (r-1)/(1-{1\over r})^r\). Let \(B_{2m}\) \((m= 1,2,\dots)\) be the Bernoulli numbers defined by \[ {z\over e^z-1}=1-{z\over 2}+\sum^\infty_{m=1} B_{2m}{z^{2m}\over (2m)!}.
openaire +3 more sources
On the divisibility of binomial coefficients
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 divisible by at least one of $p$ or $q$. We give conditions under which a number $n$ has this property and discuss a
openaire +4 more sources
Based on a recent representation of the psi function due to Guillera and Sondow and independently Boyadzhiev, new closed forms for various series involving harmonic numbers and inverse factorials are derived.
Kunle Adegoke, Robert Frontczak
doaj +1 more source
On divisibility of binomial coefficients
Let \(p\) be a prime and \(A(n,p)\) the \(p^ n\times p^ n\)-matrix with entries \(a_{ij}= \left(\begin{smallmatrix} i\\ j\end{smallmatrix}\right)\text{ mod }p\) for \(0\leq i,j< p^ n\). It is shown that \(A(n,p)\) is the \(n\)-fold tensor product of \(A(1,p)\) with itself. As an application a short proof is given that there are precisely \(\left(\begin{
openaire +3 more sources

