STUDY IN EGYPTIAN FRACTIONS

Similar documents
8 Primes and Modular Arithmetic

Standard forms for writing numbers

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Elliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR

Solution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])

An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt

Proof by Contradiction

Quasi-reducible Polynomials

UNIT 4 NOTES: PROPERTIES & EXPRESSIONS

EGYPTIAN FRACTIONS WITH SMALL NUMERATORS

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

Egyptian Mathematics

Mathematics Foundation for College. Lesson Number 1. Lesson Number 1 Page 1

NUMBERS It s the numbers that count

SIX PROOFS OF THE INFINITUDE OF PRIMES

Miller Objectives Alignment Math

Math Real Analysis

Number Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.

Trinity Christian School Curriculum Guide

Part II. Number Theory. Year

Basic Proof Examples

Dirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions:

Florida Math Curriculum (433 topics)

Proofs. Chapter 2 P P Q Q

1. Revision Description Reflect and Review Teasers Answers Recall of Rational Numbers:

Fall 2017 Test II review problems

REVIEW Chapter 1 The Real Number System

Commutative Rings and Fields

This is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.

PRIME NUMBERS YANKI LEKILI


Class 8: Numbers Exercise 3B

A number that can be written as, where p and q are integers and q Number.

CHMC: Finite Fields 9/23/17

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

Outline. We will now investigate the structure of this important set.

1 Numbers. exponential functions, such as x 7! a x ; where a; x 2 R; trigonometric functions, such as x 7! sin x; where x 2 R; ffiffi x ; where x 0:

Math 412: Number Theory Lecture 3: Prime Decomposition of

CHAPTER (multiply by 10) 2 10 (double first line) 4 20 (double third line) 8 40 (double fourth line) (halve first line)

Math Review. for the Quantitative Reasoning measure of the GRE General Test

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Problem Set 5 Solutions

2.1 Convergence of Sequences

Introduction to Number Theory

AS1051: Mathematics. 0. Introduction

INTRODUCTION TO TRANSCENDENTAL NUMBERS

0. Introduction. Math 407: Modern Algebra I. Robert Campbell. January 29, 2008 UMBC. Robert Campbell (UMBC) 0. Introduction January 29, / 22

Solutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00

High School Preparation for Algebra 1

ON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS

West Windsor-Plainsboro Regional School District Math A&E Grade 7

Radiological Control Technician Training Fundamental Academic Training Study Guide Phase I

Shi Feng Sheng Danny Wong

CSE 1400 Applied Discrete Mathematics Proofs

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

N x. You should know how to decompose a rational function into partial fractions.

Proofs. Chapter 2 P P Q Q

A Few Primality Testing Algorithms

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Academic-Clinic.com BASIC ARITHMETIC AND ALGEBRA POINTERS. Whole (natural) numbers. Arithmetical operations

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

MATH 115 Concepts in Mathematics

Mathematics 228(Q1), Assignment 2 Solutions

ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction

Results of modern sieve methods in prime number theory and more

MATH 361: NUMBER THEORY FOURTH LECTURE

Table of Contents. 2013, Pearson Education, Inc.

Solutions to Assignment 1

Instructor s suggestions for use of Number Theory notes

Number Theory. Jason Filippou UMCP. ason Filippou UMCP)Number Theory History & Definitions / 1

Part I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS

Unit 3: Definitions, Theorems and Proofs

Grade 8 Chapter 7: Rational and Irrational Numbers

Induction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2

As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic

arxiv: v1 [math.cv] 14 Nov 2017

Chapter One. The Real Number System

Equations and Inequalities

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

Lesson 2 The Unit Circle: A Rich Example for Gaining Perspective

Primality Testing. 1 Introduction. 2 Brief Chronology of Primality Testing. CS265/CME309, Fall Instructor: Gregory Valiant

CHAPTER 4: EXPLORING Z

Properties of the Integers

February 13, Option 9 Overview. Mind Map

Divisibility. 1.1 Foundations

Garrett Z p. Few explicit parametrizations of algebraic closures of fields are known: not Q, for sure. But we do also know

Old and new algorithms for computing Bernoulli numbers

Probabilistic Aspects of the Integer-Polynomial Analogy

2Algebraic. foundations

1 Continued Fractions

1.1.1 Algebraic Operations

Solutions to Practice Final

3 The language of proof

GTPS Curriculum 6 th Grade Math. Topic: Topic 1- Numeration

Final Exam Study Guide Mathematical Thinking, Fall 2003

Homework #2 solutions Due: June 15, 2012

Ron Paul Curriculum Mathematics 8 Lesson List

A Guide to Arithmetic

Midterm Preparation Problems

Transcription:

1 STUDY IN EGYPTIN FRCTIONS Robert P. Schneider Whether operating with fingers, stones or hieroglyphic symbols, the ancient mathematician would have been in many respects as familiar with the integers and rational numbers as is the modern researcher. If we regard both written symbols and unwritten arrangements of objects to be forms of notation for numbers, then through the ancient notations and their related number systems flowed the same arithmetic properties associativity, commutativity, distributivity that we know so intimately today, having probed and extended these empirical laws using modern tools such as set theory and Peano s axioms. It is fascinating to contemplate that we share our base-ten number system and its arithmetic, almost as natural to us as sunlight and the air we breathe, with the scribes of ancient Egypt [1, p. 85]. We use different symbols to denote the numbers and operations, but our arithmetic was theirs as well. Our notation for fractions even mimics theirs with its two-tiered arrangement foreshadowing our numerator and denominator; however, the Egyptian notation for fractions leaves no space for numbers in the numerator, the position being filled by a hieroglyphic symbol meaning part [1, p. 93]. side from having special symbols to denote 2/3 and 3/4, the Egyptians always understood the numerator to be equal to unity in their fractions [4]. The representation of an improper fraction as the sum of distinct unit fractions, or fractions having numerators equal to one, is referred to as an Egyptian fraction [3]. I found the Egyptians use of fractions, as well as their multiplication and division algorithms [1, pp. 88-101], to be surprisingly subtle; in fact, certain questions that would

2 have been of interest to Egyptian mathematicians remain unanswered still. The Erdős- Straus conjecture, for example, concerns whether the fraction 4/n can be written as the sum of three unit fractions for every positive integer n [3]. While the conjecture is suggested by ancient mathematical tables, my own cursory investigation into the problem had me delving into polynomials, the law of quadratic reciprocity, Z-cyclic groups, hypergeometric series, continued fractions and other topics largely beyond the scope of ancient thinkers yet in the end, nearly all of my own findings could have been arrived at using Egyptian methods and notations. fter a false start searching for integer roots to quadratic polynomials, I began my investigation into the Erdős-Straus conjecture with the observation that 1 n = n + 1 n(n + 1) = 1 n + 1 + 1 n(n + 1). Then we have the general formula for decomposing the fraction /n having numerator equal to a positive integer n = n + 1 + n(n + 1). Using this identity for different cases, we find that 2/n can always be written as the sum of either one or two unit fractions, depending on whether n is even or odd; 3/n can always be written as the sum of either one or two unit fractions, except when n 1 (mod 3); and 4/n can always be written as the sum of one, two, or three unit fractions, except when n 1 (mod 4). In the noted cases n 1 (mod 3) and n 1 (mod 4), the above formula fails to yield unit fractions.

3 nother obvious tactic may be used to improve this result; if we partition into distinct positive integers, say = a 1 + a 2 + a 3 + +a k, then we might rewrite the problem in terms of smaller fractions that may be easier to solve or look up in a table n = a 1 n + a 2 n + a 3 n + + a k n. The simplest such partition yields the identity n = 1 n + 1 n. pplying this identity in the case = 4, n 1 (mod 4), we find 4 n = 1 n + 3 n. By the result cited above for = 3, the fraction 3/n on the right-hand side may be written as the sum of two unit fractions except when n 1 (mod 3). It follows then that 4/n may be written as the sum of three or fewer unit fractions unless both n 1 (mod 3) and n 1 (mod 4) hold true simultaneously, leaving only the case n 1 (mod 12) as requiring more than three unit fractions to represent 4/n using the above decomposition procedure. Therefore, 4/n can be written as the sum of three or fewer unit fractions in all cases when n 1 (mod 12), and the number of terms may be increased by decomposition to satisfy the statement of the Erdős-Straus conjecture [3] if fewer than three are produced. Furthermore, if there exists at least one divisor d 1 n such that d 1 1 (mod 12), we may write 4/d 1 as the sum of three unit fractions; then the product

4 4 n = 4 d 1 d 2 = 1 d 2 4 d 1 is also the sum of three unit fractions. I was not able to address whether it is generally possible for 4/n to be written as three unit fractions when n 1 (mod 12), only to show that such a representation cannot always be obtained by the methods outlined above. One part of my investigation into Egyptian fractions certainly lay beyond the reach of Egyptian mathematics; I used Euler s formula for continued fractions [5] and a recursive argument to extend the above methods for decomposing fractions, the proof of which I omit here, leading to the identity when x R +, a 0 = 1, b i = a i x+a i+1, 1 x k i = a x + a i+1 k=0 i=0 = b 0 b 1 1 b 1 + b 1 2 b 1 + b 2 3 1 + b 3 which holds when the infinite series converges. Yet only slight abuses of Egyptian notation are necessary to allow for the expression of such modern mathematical ideas. If he were to allow the introduction of infinite processes, the Egyptian scribe would not be far from the study of infinite geometric series, the Riemann zeta function, and other sums of unit fractions central to modern mathematics; in addition, the scribe might adjoin a miniature fraction to the whole number in the denominator of his unit fraction, giving birth to regular continued fractions [2] and brushing up against the theory of irrational numbers. Recognizing the Egyptians ingenuity in working with multiplication, division, and operations involving fractions, it seems that many of the arithmetic patterns studied in

5 number theory and other branches of modern mathematics topics such as finite geometric series, quadratic reciprocity, distribution of primes in arithmetic progressions and Goldbach s conjecture were in principle available for investigation by ancient minds. Moreover, certain patterns appear more naturally in one number system or notation than in another; perhaps talented scribes noticed and experimented with such patterns, rediscovering them again and again over the millennia, their unrecorded knowledge evaporating in history. References 1. Joseph, G. G. The Crest of the Peacock: Non-European Roots of Mathematics. Princeton & Oxford: Princeton University Press, 2011. 2. Continued fraction. Wikipedia: The Free Encyclopedia. Jan. 31, 2012 <http://en.wikipedia.org/wiki/continued_fraction>. 3. Egyptian fraction. Wikipedia: The Free Encyclopedia. Jan. 31, 2012 <http://en.wikipedia.org/wiki/egyptian_fraction>. 4. Egyptian numerals. Wikipedia: The Free Encyclopedia. Jan. 31, 2012 <http://en.wikipedia.org/wiki/egyptian_numerals>. 5. Euler s continued fraction formula. Wikipedia: The Free Encyclopedia. Jan. 31, 2012 <http://en.wikipedia.org/wiki/euler's_continued_fraction_formula>.