# Welcome back

## Find a book, put up your feet, stay awhile

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more

Download

Standard view

Full view

of .

Look up keyword

Like this

Share on social networks

0Activity

×

0 of .

Results for: No results containing your search query

P. 1

Unit FractionsRatings: (0)|Views: 26|Likes: 0

Published by Jacob Richey

See more

See less

https://www.scribd.com/doc/98245592/Unit-Fractions

06/26/2012

text

original

Sums of Unit Fractions

We investigate sums of so called “unit fractions,” the numbers

1

n

for positive integer

n

. The firstsimple question we might ask is, can each (positive) rational number

pq

be written as a finite sum of distinct unit fractions? For example,

1514

1

114

,

310

15

110

, and

43

1

15

115

117

1255

1256

165280

. To show that it is possible, we first need to come up with amethod for determining these constructions. The method we’ll use is the

greedy method

, where wedecompose a number into unit fractions by approaching it with the largest unit fraction we still haveavailable (since we are to use distinct unit fractions in the decomposition). The greedy algorithm givesus a sequence of unit fractions, as well as a sequence of remainders (the sum of the first so many unitfractions in our sequence is the approximation to the number). For example, if we are try to construct

r

0

5

3, we would have

x

0

1 and

r

1

2

3, then

x

1

1

2 and

r

2

2

3

1

2

1

6, so that

x

2

1

6and

r

0

5

3

x

0

x

1

x

2

1

1

2

1

6. We’ll call the

k

th

remainder

r

k

and the

k

th

greedy unit fraction

x

k

. What we need to show is that for any rational number

r

0

, the greedy algorithm terminates (that is,

x

k

0 for some

k

). To do that, we need to get a better picture of what the greedy algorithm actually looks like. In particular, we’ll first look at the set of rationals

r

Ε

0,1

: these are the rational numbers

AB

where

A

B

. In this case,

i

Ε

0,

A

with

B

i

mod

A

, so we can write

B

u A

i

for some

u

Ε

, so that

r

Au A

i

. We have the following short lemma:Lemma: If

r

k

r

Au A

i

as described, then

x

k

x

1

u

1

.Proof: The greedy algorithm asks us to take the largest unit fraction possible without surpassing theremainder: we have

x

1

r

1

since

r

1

r

1

r

1

1

r

0, while

r

1

r

1

1

r

r

1

1

0. That is,

x

is the largest unit fraction that does not exceed

r

(the next largest unit fraction

does

exceed

r

). Now, if

r

Au A

i

, we have

x

u A

i A

1

u

i A

1

u

1

1

, the desired result.

Now we can prove that the greedy algorithm terminates on any positive rational number less thanone, another lemma on the way to a proof that the algorithm terminates on

any

rational number.Lemma 1: The greedy algorithm terminates on any rational

r

Ε

0,1

.Proof: Write

r

k

A

k

u

k

A

k

i

k

for positive integers

A

k

,

u

k

and

i

k

with 0

i

k

A

k

k

0. Apply thegreedy algorithm to

r

: we obtain a sequence

x

0

,

x

1

,...

of unit fractions and a sequence

r

0

,

r

1

,

r

2

,...

of remainders, and from the sequence of

r

’s, sequences

A

0

,...

,

u

0

,...

,and

i

0

,...

. Since

A

0

isfinite, it suffices to show that

A

k

A

k

1

k

0, so that the sequence of

A

’s would have to end in a0, the desired result. We have that each remainder

r

k

A

k

u

k

A

k

i

k

, so that by our lemma,

x

k

1

u

k

1

and

r

k

1

r

k

x

k

A

k

i

k

u

k

1

u

k

A

k

i

k

. This gives us the recursion

A

k

1

A

k

i

k

on the sequence of

A

’s: inparticular, we have that

i

k

0

k

, so that

A

k

1

A

k

i

k

A

k

.

Now we need some way to extend this idea to construct any rational number

r

. We know it is possi-ble to get “near” any rational number, since

k

1

1

k

: that is, there’s no rational number we can’tsurpass. The question is, how do we hit a given “large” rational number exactly? Imagine we have areally large number, like 1,000,000. Using just the unit fractions, it’ll take a very long time to get there- the sum

k

1

n

1

k

grows with log

n

, so it we would have to go out to around

e

10

6

10

434294

. For a while, we’ll just be taking all the big unit fractions we can get our hands on:

x

0

1,

x

1

1

2,... Then, when we finally get “in range” of the target, apply Lemma 1 to the remainder. What could go wrong with this approach? It could be that when we try to apply Lemma 1, we need aunit fraction

x

k

that has already been used in the first part of the decomposition. For example, if

r

2, we might first take

x

0

1and

x

1

1

2 to get “in range” (within .5) of the target. But then thegreedy algorithm would ask us to take 1/2 again, which we’ve already used! The way to do it is to go alittle further before invoking lemma 1: we should have taken

x

0

1,

x

1

1

2,and

x

2

1

3, thenapplied lemma 1 to 1/6 to obtain 2

1

1

2

1

3

1

6. The solution is simple: we switch over tolemma 1 when taking the next largest unused unit fraction puts us past the mark. We will show thatsuch a point occurs (that

N

,

x

N

1

i

r

i

,

x

j

1

j

j

N

), and that invoking lemma 1 afterthis point doesn’t give us any duplicates. Theorem 1: The greedy algorithm on any positive rational number terminates.Proof: Fix

r

Ε

. If

r

1, apply lemma 1. If

r

1, take

x

0

1

done. Assume

r

1. Then let

x

k

1

k

so long as

x

1

x

2

...

x

k

r

. Suppose

N

0,

x

1

...

x

N

r

. But then we wouldhave

r

1

1

2

1

3

...

1

n

n

0, a contradiction. Pick the smallest such

N

, and call it

L

. That is, 1

1

2

...

1

L

1

r

1

1

2

...

1

L

, so that

r

Ε

1

...

1

L

1

,1

...

1

L

. Then

r

L

1

r

1

...

1

L

1

Ε

0,

1

L

. Since

L

1,

1

L

1

r

L

1

1. We can now safely apply lemma 1 to the remainder

r

L

1

, since it is less than 1 and all of the unit fractions

1,1

2,...,1

L

1

are greater than

r

L

1

, so there is no chance of us needing them again.

So any rational number is constructable with finitely many distinct unit fractions. What if we are only allowed to use some unit fractions, but not all of them? If we truncate the natural numbers at any point, and take the tail end - that is, the set

n

,

n

1,...

for some positive integer

n

- the greedy algorithm on this set still works by the same method as before, only now lemma 1 will apply torationals less than 1

n

instead of those less than 1. We’ll see shortly that if we take the set

n

,2

n

,3

n

,4

n

,5

n

,...

a

:

a

0mod

n

for any positive integer

n

, we can construct any rational

2

Unit Fractions.nb

number, drawing unit fractions only from this set. This offers a general question about sets like this:letting

S

a

,

b

s

Ε

:

s

a

mod

b

, what subset of

can we construct with finite sums of distinct unitfractions, whose denominators have only elements of

S

a

,

b

for fixed

a

and

b

? Theorem 2: We can construct all of

using

S

0,

n

n

Ε

.Proof: Fix

r

Ε

and

n

Ε

. Now we apply Theorem 1 to the number

n

r

, so that

n

r

x

1

x

2

...

x

k

1

d

1

...

1

d

k

, a sum of distinct unit fractions. Now we divide by

n

toobtain

r

1

n d

1

1

n d

2

...

1

n d

k

, a sum of distinct unit fractions whose denominatorsare all 0mod

n

, the desired result.

Note that the sets

S

0,

n

have asymptotic density 1

n

, so that we can have sets with arbitrarily smallasymptotic density that will still construct all of

. A natural question to ask is, is there a density 0 setthat will construct

? Erds has proved that taking the set of squares union the set of primes, we canconstruct any rational number: this set has density 0, and so answers our question. We offer a differ-ent density 0 set which also constructs the rationals.“Proof:” The idea is to construct a set

S

as a union of countably many sets

S

i

, each a subset of adifferent “block” of

,

B

i

. That is, we want families of sets with the following properties:1.

B

i

,

B

i

B

j

i

,

j

2.

S

i

B

i

i

3.

s

Ε

S

i

1

s

1

i

4.

i

1

n

S

i

max

B

n

n

These last two conditions reveal our plan. We want to construct the number

r

using this set by having the elements of

S

i

take the place of 1

i

in the greedy decomposition, and we want the density of the whole thing to be arbitrarily small (smaller than any 1

n

). We can accomplish this by building the

S

i

’s recursively as follows. For our base case, let

S

1

1

,and

B

1

1

. Then 1

1

1 and 1

1 as desired. Now suppose we have constructed

S

k

and

B

k

for some

k

Ε

with the desired properties, and let max

B

k

a

. We now apply the greedy algorithm as in Theorem 1 (with the set

1,2,3,...,

a

, i.e.

truncated at

a

) to the number

1

k

1

,and obtain a finite sequence of distinct unit fractions that sum to it: call this sequence

x

1

,...,

x

N

with

x

1

x

2

...

x

N

. Now we define

S

k

1

1

x

1

,1

x

2

,...,1

x

N

and

B

k

1

b

:

a

1

b

max

k

1

N

i

1

k

1

S

i

,1

x

N

.Property 1 follows from the definition of the sets

B

k

. Property 2 is satisfied because

x

1

...

x

N

, so1

x

1

...

1

x

N

max

B

k

1

, while Theorem 1 requires each of the 1

x

k

a

k

. Property 3 issatisfied by Theorem 1. Finally, we have that

Unit Fractions.nb

3

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

© Copyright 2015 Scribd Inc.

Language:

Choose the language in which you want to experience Scribd:

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Password Reset Email Sent

Join with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

By joining, you agree to our

read free for one month

Personalized recommendationsbased on books you love

Syncing across all your devices

Join with Facebook

or Join with EmailSorry, we are unable to log you in via Facebook at this time. Please try again later.

Already a member? Sign in.

By joining, you agree to our

to download

Personalized recommendationsbased on books you love

Syncing across all your devices

Continue with Facebook

Sign inJoin with emailSorry, we are unable to log you in via Facebook at this time. Please try again later.

By joining, you agree to our

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd