BIJECTIVE PROOF PROBLEMS August 18, 2009 Richard P. Stanley

First Page		Document Content
Date: 2009-08-18 11:30:16 Enumerative combinatorics Number theory Permutations Binomial coefficient Factorial Catalan number Fibonacci number Summation Generating function Mathematics Combinatorics Integer sequences		BIJECTIVE PROOF PROBLEMS August 18, 2009 Richard P. Stanley Add to Reading List Source URL: www-math.mit.edu Download Document from Source Website File Size: 328,11 KB Share Document on Facebook

	Tuesday Daily Gather: Fibonacci. by Brian Jonah Brian’s brother has a favorite positive integer n, and he wants to find a Fibonacci number Fk such that n \| Fk . Obviously, the trivial case F0 = 0 = n · 0 satisfies th DocID: 1vqGw - View Document
	Tuesday Daily Gather: Fibonacci. by Brian Jonah Brian’s brother has a favorite positive integer n, and he wants to find a Fibonacci number Fk such that n \| Fk . Obviously, the trivial case F0 = 0 = n · 0 satisfies th DocID: 1v4RY - View Document
	THE NUMBER OF k-DIGIT FIBONACCI NUMBERS JAN-CHRISTOPH PUCHTA Define a(k) to be the number of k-digit Fibonacci numbers. For n > 5, we have 1.6Fn−1 < Fn < 1.7Fn−1 . Thus if Fn is the least k-digit Fibonacci number, we DocID: 1uaXr - View Document
	Design of Parallel and High-Performance Computing Fall 2014 Lecture: Scheduling Instructor: Torsten Hoefler & Markus Püschel DocID: 1rfSj - View Document
	The OEIS, Mathematical Discovery, and Insomnia Neil J. A. Sloane The OEIS Foundation and Rutgers University ACMES Conference, May 2016 DocID: 1r6nO - View Document