Ancient Egyptian numbers: a CS-complete example

Authors:
Timothy S. Gegg-Harrison
Affiliations:
Department of Computer Science, Winona State University, Winona, MN
Venue:
Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Year:
2001

Citing 0
Cited 2

Studying program correctness by constructing contracts

Proceedings of the 8th annual conference on Innovation and technology in computer science education
Constructing contracts: Making discrete mathematics relevant to beginning programmers

Journal on Educational Resources in Computing (JERIC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A critical piece of any successful curriculum is a robust example that permeates the key concepts of the field. For computer science, we refer to such an example as CS-complete. A good CS-complete example is applicable in CS1, CS2, and Discrete Mathematics. Approximately 4000 years ago, the ancient Egyptians used a numbering system that serves as a prototype CS-complete example. In this paper, we outline the use of Egyptian numbering system as an example that naturally extends through CS1, CS2, and Discrete Mathematics.