
Archives
 July 2020
 May 2020
 March 2020
 February 2020
 January 2020
 December 2019
 September 2019
 August 2019
 July 2019
 June 2019
 May 2019
 April 2019
 March 2019
 February 2019
 January 2019
 December 2018
 November 2018
 October 2018
 September 2018
 August 2018
 July 2018
 June 2018
 May 2018
 April 2018
 March 2018
 February 2018
 January 2018
 December 2017
 November 2017
 October 2017
 September 2017
 August 2017
 July 2017
 June 2017
 May 2017
 April 2017
 March 2017
 February 2017
 January 2017
 December 2016
 November 2016
 October 2016
 September 2016
 August 2016
 July 2016
 June 2016
 May 2016
 April 2016
 March 2016
 February 2016
 January 2016
 December 2015
 November 2015
 October 2015
 September 2015
 August 2015
 July 2015
 June 2015
 May 2015
 April 2015
 March 2015
 February 2015
 January 2015
 December 2014
 November 2014
 October 2014
 September 2014
 August 2014
 July 2014
 June 2014
 May 2014
 April 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 June 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
 July 2012
 May 2012
 March 2012
 February 2012
 January 2012
 December 2011
 November 2011
 October 2011

Meta
Category Archives: elementary number theory
Generalized Binomial Coefficients from Multiplicative and Divisible Functions
Given a function f from the natural numbers to the natural numbers, one way to generalize the binomial coefficient is via . The usual binomial coefficient of course has f as the identity function . Question: What kinds of functions f guarantee that … Continue reading
Some Divisibility Properties of the Binomial Coefficients
Recently I read in Koshy’s book [1] on Catalan numbers some divisibility properties of the binomial coefficients I had not seen before. Koshy credits them to Hermite. They are particularly interesting to me because (as Koshy notes) some of the most famous … Continue reading
Some Stirling Number Congruences
Here is Problem 51, parts a and b, in Chapter 6 of the classic text Concrete Mathematics: 51. Let p be a prime number. a. Prove that , for . b. Prove that , for . In this post I will show that the converses … Continue reading
Posted in combinatorics, elementary number theory
Leave a comment
Checking Multiplication via Digit Sums
Last week a friend who is a fourth grade teacher came to me with a math problem. The father of one of his students had showed him a trick for checking the result of a threedigit multiplication problem. The father … Continue reading
Posted in arithmetic, elementary number theory
4 Comments
A Combinatorial Proof of a Formula Involving Euler’s Totient Function
Several years ago I found a proof of the following identity, which I had not seen before (and still haven’t seen anywhere else): where is Euler’s totient function, the number of positive integers less than or equal to and relatively … Continue reading
Posted in combinatorics, elementary number theory
2 Comments
Perfect numbers and Pythagorean triples
For my first entry, let’s talk about a problem I posed in Mathematics Magazine several years ago. (Plus it gives me a chance to mention Fermat, which I really should.) Two of the more famous topics in elementary number theory … Continue reading
Posted in elementary number theory
Leave a comment