Results 11 to 20 of about 174,940 (323)
Binomial Coefficients and Jacobi Sums [PDF]
Transactions of the American Mathematical Society, 1984 Throughout this paper e e denotes an integer ⩾ 3 \geqslant 3 and p p a prime ≡ 1 ( mod e ) \equiv \;1\ \pmod e . With f f defined by p = e f
Richard H. Hudson, Kenneth S. Williams
openaire +3 more sources
On prime divisors of binomial coefficients [PDF]
Mathematics of Computation, 1988 This paper, using computational and theoretical methods, deals with prime divisors of binomial coefficients: Geometric distribution and number of distinct prime divisors are studied. We give a numerical result on a conjecture by Erdős on square divisors of binomial coefficients.
Pierre Goetgheluck
+5 more sources
Number of odd binomial coefficients [PDF]
Proceedings of the American Mathematical Society, 1977 Let F ( n ) F(n) denote the number of odd numbers in the first n rows of Pascal’s triangle, and θ = ( log 3 ) / log 2 ) \theta = (\log 3)/\log 2) . Then α = lim
Heiko Harborth
openaire +2 more sources
Some congruence properties of binomial coefficients and linear second order recurrences [PDF]
International Journal of Mathematics and Mathematical Sciences, 1988 Using elementary methods, the following results are obtained:(I) If p is prime, 0≤m≤n ...
Neville Robbins
doaj +2 more sources
Congruences for sums of binomial coefficients
Journal of Number Theory, 2007 Let q>1 and m>0 be relatively prime integers. We find an explicit period $ _m(q)$ such that for any integers n>0 and r we have $[n+ _m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q), or a=1 (mod q) and 2|m, where $[n,r]_m(a)=\sum_{k=r(mod m)}\binom{n}{k}a^k$.
Sun, ZW, TAURASO, ROBERTO
openaire +5 more sources
Sum of the Reciprocals of the Binomial Coefficients
European Journal of Combinatorics, 1993 Let \(S_ n=\sum^ n_{k=0}{1 \over {n \choose k}}\). It is shown that \(S_ n\) satisfies the recurrence \(S_ n={n+1 \over 2n}S_{n-1}+1\). The proof can be simplified by observing that \[ n!S_ n=\sum^ n_{k=0}k!(n-k)!=n!+\sum^{n-1}_{k=0}k!(n-k-1)!(n+1-k-1) =n!+(n+ 1)(n-1)!S_{n-1}-(n!S_ n-n!). \]
B. Sury
openaire +3 more sources
Binomial coefficients and quadratic fields [PDF]
Proceedings of the American Mathematical Society, 2006 Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d.
Zhi‐Wei Sun
openaire +5 more sources
Factoring peak polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in S_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$.
Sara Billey +2 more
doaj +1 more source
Explicit formulas for the $p$-adic valuations of Fibonomial coefficients II
AIMS Mathematics, 2020 In this article, we give explicit formulas for the $p$-adic valuations of the Fibonomial coefficients $\binom{p^a n}{n}_F$ for all primes $p$ and positive integers $a$ and $n$.
Phakhinkon Phunphayap +1 more
doaj +1 more source
Reliability of environmental sampling culture results using the negative binomial intraclass correlation coefficient. [PDF]
, 2014 The Intraclass Correlation Coefficient (ICC) is commonly used to estimate the similarity between quantitative measures obtained from different sources.
Aly, Sharif S +3 more
core +1 more source