# 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

2Activity

×

0 of .

Results for: No results containing your search query

P. 1

Sum ConstructionsRatings: (0)|Views: 549|Likes: 0

Published by Jacob Richey

Sum Constructions

Sum Constructions

See more

See less

https://www.scribd.com/doc/116166293/Sum-Constructions

01/01/2014

text

original

SUM CONSTRUCTIONS

JACOB RICHEY

This investigation comes out of the following Purdue Problem of the Week (Problem 6,Fall 2012):For which numbers

r

∈

(0

,

1) is

{

k

∈

F

r

k

:

F

is a subset of the non-negative integers

}

=[0

,

11

−

r

]?The question only attracted my eye because it suggests an interesting generalization of the“unit fractions” problem I’ve been working on for some time: instead of considering onlysums of unit fractions, why not try to form a general theory of sum constructions? Thatis, given a set of positive reals, which reals can be written as a (perhaps inﬁnite) sum of those numbers?The Purdue POW question is not so hard to answer: the two sets are equal for any

r

∈

[1

/

2

,

1), and unequal for any

r <

1

/

2. To prove the former, ﬁrst note that for any

r

∈

[

12

,

1) and

n

∈

N

,

∞

i

=

n

+1

r

i

=

r

n

+1

1

−

r

≥

r

n

, since

r

n

+1

1

−

r

≥

r

n

⇐⇒

r

≥

1

−

r

⇐⇒

r

≥

12

. (1)That is, each term is less than or equal to the sum of all the remaining terms (past thatone). Now ﬁx

x

∈

[0

,

11

−

r

],

>

0, and pick

N

so that

r

n

1

−

r

<

∀

n > N

. This last choiceis possible since lim

n

→∞

r

n

1

−

r

= 0. Now approach

x

greedily - that is, take at each stepthe largest possible

r

k

so that the remainder

x

−

r

k

1

−

r

k

2

−

...

is non-negative. Oneissue presents itself: what if we are going along greedily, when suddenly we can’t getto

x

, even if we take all the remaining terms? If this did happen, i.e.

∃

M

such that

x

−

r

k

1

−

...

−

r

k

M

−

1

−

∞

j

=

k

M

+1

r

j

<

0 and

x

−

r

k

1

−

...

−

r

k

M

−

1

−

r

k

M

<

0, then we wouldhave

r

k

M

>

∞

j

=

k

M

+1

r

j

, which contradicts (1). This issue - where any term of a sequenceexceeds the sum of all the terms past it - will come into play later.It remains to show that we can come within

of

x

: if the greedy algorithm on

x

terminatesin ﬁnitely many steps then we are done. So suppose it never terminates: then consider theexpansion out to

k

N

≥

N

, so that the remainder satisﬁes

x

−

r

k

1

−

...

−

r

k

N

≤

∞

j

=

N

+1

r

j

=

r

N

+1

1

−

r

<

r

N

1

−

r

=

, the desired result.Therefore, we can converge on any

x

using a base

r

∈

[1

/

2

,

1). To see that any

r <

1

/

2doesn’t work, we need only produce a single unconstructable point. We have already donethe work for this: for in this case, each term in the sequence is

greater

than the sum of

1

2 JACOB RICHEY

Figure 1.

Blue:

11

−

r

; Red:

1

−

2

r

(1

−

r

)

3

; Green = Blue - Redall the remaining terms, so that the issue we conisdered above will actually occur. Forexample, given

r <

1

/

2, the entire interval (

r

1

−

r

,

1) is not constructable, since for any

x

inthat interval, 1 is too big, but all of the remaining terms together are still too small.A natural question arises: which numbers

x

∈

[0

,

11

−

r

] can be constructed, given

r <

1

/

2?It is easier to ﬁrst show a (surprisingly) large set of numbers which are not constructible;to do so, we’ll use a generalization of the issue we discovered in answering the problem of the week.For, the interval (

r

1

−

r

,

1) is completely inconstructible - similarly, the intervals (

r

2

1

−

r

,r

)

,

(

r

3

1

−

r

,r

2

),or in general, all the intervals (

r

i

+1

1

−

r

,r

i

) are not constructable. Together, all these intervalsgive us

∞

i

=0

r

i

−

r

i

+1

1

−

r

=

11

−

r

∞

i

=0

(

r

i

−

2

r

i

+1

) =

1

−

2

r

(1

−

r

)

2

of unconstructable length.But wait: there’s more! We can generalize further: the intervals (1 +

r

2

1

−

r

,

1 +

r

)

,

(1 +

r

+

r

3

1

−

r

,

1 +

r

+

r

2

), or in general, (1 +

r

+

...

+

r

k

−

1

+

r

k

+1

1

−

r

,

1 +

r

+

...

+

r

k

) are allnot constructable by similar reasoning. These two methods can be combined, so that ingeneral, for any

i

≥

0

,k

≥

1, the interval (

r

i

+

...

+

r

i

+

k

−

2

+

r

i

+

k

1

−

r

,r

i

+

...

+

r

i

+

k

−

1

) cannotbe constructed. It is easy to see that each of these intervals is non-empty; to see that theyare all disjoint is slightly harder. Both are left as exercises for the reader.Together, these intervals give us a total unconstructable length of:

L

=

∞

k

=1

∞

i

=0

(

i

+

k

−

1

j

=

i

r

j

−

i

+

k

−

2

j

=

i

r

j

−

r

i

+

k

1

−

r

)

L

=

∞

k

=1

∞

i

=0

(

r

i

−

r

i

+

k

1

−

r

−

r

i

−

r

i

+

k

−

1

1

−

r

−

r

i

+

k

1

−

r

)

SUM CONSTRUCTIONS

3

L

=

11

−

r

∞

k

=1

∞

i

=0

(

r

i

+

k

−

1

−

2

r

i

+

k

1

−

r

)

L

=

11

−

r

∞

k

=1

r

k

−

1

∞

i

=0

(

r

i

−

2

r

i

+1

)

L

=

1

−

2

r

(1

−

r

)

2

∞

k

=1

r

k

−

1

L

=

1

−

2

r

(1

−

r

)

3

So there is a signiﬁcant part of [0

,

11

−

r

] that is not constructible. (Plots of the constructibleand unconstructible length are given in ﬁgure 1.) What about what is left over? Iseverything not in one of these intervals constructible? We can prove a result about the setof numbers that are constructible, though ﬁrst we need a lemma:

Lemma:

For any

r

∈

(0

,

1

/

2), if a number

x

is constructible by geometric terms in

r

, thenthe construction must be greedy, and hence unique.

Pf:

Suppose there exists

x

=

∞

n

=1

r

s

n

that isn’t a greedy construction, i.e.

∃

n,

n j

=1

r

s

j

≤

x

and

n

−

1

j

=1

r

s

j

+

r

s

n

−

1

≤

x

. Then

x

=

∞

j

=1

r

s

j

=

n

−

1

j

=1

r

s

j

+

∞

j

=

n

r

s

j

≤

n

−

1

j

=1

r

s

j

+

∞

j

=0

r

s

n

+

j

<

n

−

1

j

=1

r

s

j

+

r

s

n

−

1

≤

x

by assumption; then

x < x

, a contradiction.

Now we can prove the main theorem:

Theorem:

For any

r

∈

(0

,

1

/

2), the set

C

=

{

k

∈

F

r

k

:

F

is a subset of the non-negativeintegers

}

contains no open intervals.

Pf:

Suppose there was an interval

I

⊂

C

, and ﬁx

x

∈

I

. If

x

has ﬁnite construction,

x

=

r

p

1

+

...

+

r

p

n

, pick

N > n

so that

x

+

r

N

∈

I

; then nothing in the non-empty interval(

x

+

r

N

+1

1

−

r

,x

+

r

N

)

⊂

I

is constructible. For, by the lemma, any number

y

in this intervalmust have construction beginning with

y

=

r

p

1

+

...

+

r

p

n

+

r

N

+1

+

r

N

+2

+

...

, the greedyconstruction. This value is exactly the left endpoint; and any additional

r

k

we add will begreater than or equal to

r

N

, taking us out of the interval.If

x

has an inﬁnite construction,

x

=

∞

j

=1

r

s

j

, we divide into two cases.

- 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