<--- Back to Details
First PageDocument Content
Mathematics / Discrete mathematics / Integer sequences / Number theory / Bernoulli number / Topology / Binomial coefficient / Generating function / Trinomial triangle / Euler characteristic
Date: 2013-11-04 12:20:24
Mathematics
Discrete mathematics
Integer sequences
Number theory
Bernoulli number
Topology
Binomial coefficient
Generating function
Trinomial triangle
Euler characteristic

How Euler Did It by Ed Sandifer A memorable example of false induction August 2005 Euler wrote about 800 books and papers. An exact number is hard to define. The “official” number of entries in Eneström’s index is

Add to Reading List

Source URL: eulerarchive.maa.org

Download Document from Source Website

File Size: 272,70 KB

Share Document on Facebook

Similar Documents

Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1  Institute of Discrete Mathematics and Geometry, Vienna University of Technology

Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology

DocID: 1xTCQ - View Document

Using Alloy in a Language Lab Approach to Introductory Discrete Mathematics Charles Wallace Michigan Technological University In collaboration with Laura Brown, Adam Feltz

Using Alloy in a Language Lab Approach to Introductory Discrete Mathematics Charles Wallace Michigan Technological University In collaboration with Laura Brown, Adam Feltz

DocID: 1xTvc - View Document

Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math), 322–337. doi:AADM100425018H

Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math), 322–337. doi:AADM100425018H

DocID: 1vmuF - View Document

Discrete Mathematics and Theoretical Computer Science  DMTCS vol. (subm.), by the authors, 1–1 A lower bound for approximating the grundy number

Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1–1 A lower bound for approximating the grundy number

DocID: 1vkug - View Document

Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is

Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is

DocID: 1vjVY - View Document