Article
Licensed
Unlicensed
Requires Authentication
Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem
-
Kevin A. Broughan
Published/Copyright:
November 5, 2010
Abstract
We show that the set of composite positive integers n ≤ x satisfying the congruence
is of cardinality at most x as x → ∞.
Received: 2009-06-09
Revised: 2010-03-16
Accepted: 2010-05-11
Published Online: 2010-11-05
Published in Print: 2010-November
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem
- On the Iteration of a Function Related to Euler's φ-Function
- An Explicit Evaluation of the Gosper Sum
- On the Frobenius Problem for {ak, ak + 1, ak + a, . . . , ak + ak−1}
- Generalizing the Combinatorics of Binomial Coefficients via -Nomials
- Finding Almost Squares V
- On Relatively Prime Subsets and Supersets
- Reformed Permutations in Mousetrap and Its Generalizations
- On Ternary Inclusion-Exclusion Polynomials
- Sums and Products of Distinct Sets and Distinct Elements in ℂ
Articles in the same Issue
- Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem
- On the Iteration of a Function Related to Euler's φ-Function
- An Explicit Evaluation of the Gosper Sum
- On the Frobenius Problem for {ak, ak + 1, ak + a, . . . , ak + ak−1}
- Generalizing the Combinatorics of Binomial Coefficients via -Nomials
- Finding Almost Squares V
- On Relatively Prime Subsets and Supersets
- Reformed Permutations in Mousetrap and Its Generalizations
- On Ternary Inclusion-Exclusion Polynomials
- Sums and Products of Distinct Sets and Distinct Elements in ℂ