Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.02919

Charles Babbage, Ada Lovelace, and the Bernoulli Numbers

Thomas J. Misa
View original source ↗Read source document ↗Export metadata ↓

Abstract

This chapter makes needed corrections to an unduly negative scholarly view of Ada Lovelace. Credit between Lovelace and Babbage is not a zero-sum game, where any credit added to Lovelace somehow detracts from Babbage. Ample evidence indicates Babbage and Lovelace each had important contributions to the famous 1843 Sketch of Babbage's Analytical Engine and the accompanying Notes. Further, Lovelace's correspondence with two highly accomplished figures in 19th century mathematics, Charles Babbage and Augustus De Morgan, establish her mathematical background and sophistication. Babbage and Lovelace's treatment of the Bernoulli numbers in Note 'G' spotlights this aspect of their collaboration. Finally, while acknowledging significant definitional problems in calling Lovelace the world's "first computer programmer," I affirm that Lovelace created an elemental sequence of instructions -- that is, an algorithm -- for computing the series of Bernoulli numbers.

Explore related subjects

math.HOcs.CYcs.GL

Keep this discovery

BibTeXRIS

Thomas J. Misa. 2023-01-07. Charles Babbage, Ada Lovelace, and the Bernoulli Numbers. https://doi.org/10.1145/2809523.2809527

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO↗
arXiv2026

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO↗
arXiv2026

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO↗