08.08.2013 Views

Ex06 - Cs.ioc.ee

Ex06 - Cs.ioc.ee

Ex06 - Cs.ioc.ee

SHOW MORE
SHOW LESS

Transform your PDFs into Flipbooks and boost your revenue!

Leverage SEO-optimized Flipbooks, powerful backlinks, and multimedia content to professionally showcase your products and significantly increase your reach.

Concrete Mathematics, Lesson 6: Exercises<br />

Exercise 3.13<br />

Silvio Capobianco<br />

Revised: October 24, 2012<br />

Let α and β be positive reals. Prove that the following are equivalent:<br />

1. Spec α and Spec β partition the positive integers, i.e., every positive<br />

integer n belongs to exactly one betw<strong>ee</strong>n Spec α and Spec β.<br />

2. α and β are irrational and 1/α + 1/β = 1.<br />

Solution. We recall that, for a positive real x, the number N(x, n) of elements<br />

in Spec x not greater than n satisfies<br />

<br />

n + 1<br />

N(x, n) = − 1<br />

x<br />

Suppose that point 2 is satisfied. Then α and β, being irrational, must be<br />

different (otherwise α = β = 2). Also, (n + 1)/α is not an integer (because<br />

α is irrational) and<br />

<br />

n + 1<br />

N(α, n) = =<br />

α<br />

n + 1<br />

α −<br />

<br />

n + 1<br />

and similarly for (n + 1)/β. Hence,<br />

<br />

1 1<br />

n + 1 n + 1<br />

N(α, n) + N(β, n) = + (n + 1) −<br />

+<br />

α β<br />

α β<br />

By hypothesis, 1/α + 1/β = 1. Then the rightmost term in open parentheses<br />

is the sum of the fractional parts of two non-integer numbers whose sum<br />

1<br />

α


is an integer, and is therefore equal to 1. Therefore N(α, n) + N(β, n) =<br />

n + 1 − 1 = n for every positive integer n: then also, for every n, either<br />

N(α, n+1) = N(α, n)+1 and N(β, n+1) = N(β, n), or N(α, n+1) = N(α, n)<br />

and N(β, n + 1) = N(β, n) + 1, that is, each integer larger than 1 goes into<br />

exactly one of the two spectra. As 1/α + 1/β = 1 and α = β, one of them is<br />

smaller than 2 and the other is greater, and n = 1 goes into the spectrum of<br />

the former: this allows us to conclude that Spec α and Spec β partition the<br />

positive integers.<br />

On the other hand, suppose that point 1 holds. Then the difference<br />

betw<strong>ee</strong>n N(α, n) and (n + 1)/α − {(n + 1)/α} is at most 1, and similar for<br />

N(β, n): therefore, for every positive integer n, we have:<br />

<br />

1 1<br />

n = + (n + 1) − 1 + a bounded quantity<br />

α β<br />

that is, <br />

1 − 1<br />

<br />

1<br />

− n =<br />

α β<br />

1 1<br />

+<br />

α β<br />

− 1 + a bounded quantity<br />

By hypothesis, this equality must hold whatever n is: since α and β are<br />

constant, this is only possible if 1/α + 1/β = 1. In turn, this implies that α<br />

and β are either both rational or both irrational.<br />

Suppose, for the sake of contradiction, that they are both rational: then<br />

there exist integers a, b, m such that α = m/a and β = m/b. (We are doing<br />

a thing slightly different than usual, reducing α and β to common numerator<br />

instead of common denominator. This is not a problem, since it is equivalent<br />

to reduce 1/α and 1/β to common denominator.)<br />

Then m = ⌊aα⌋ = ⌊bβ⌋ occurs in both Spec α and Spec β. This means<br />

that Spec α and Spec β do not form a partition of the positive integers: which<br />

goes against the hypothesis of point 1.<br />

But the actual situation is even worse than that! Since 1/α + 1/β = 1,<br />

α and β are both greater than 1: therefore m must be greater than 1, and<br />

m − 1 is a positive integer. But<br />

⌊(a − 1)α⌋ = ⌊m − α⌋ = m + ⌊−α⌋ = m − ⌈α⌉ ≤ m − 2<br />

which together with ⌊aα⌋ = m implies m − 1 ∈ Spec α. Similarly, m − 1 ∈<br />

Spec β. Therefore, if α and β are rational, then Spec α and Spec β don’t even<br />

cover the positive integers.<br />

2


Exercise 4.7<br />

Ten people numbered 1 to 10 are lined up in a circle as in the Josephus<br />

problem, and every mth person is executed. (The value of m may be much<br />

larger than 10.) Prove that the first thr<strong>ee</strong> people to go cannot be 10, k, and<br />

k + 1 (in this order), for any k.<br />

Solution. If 10 is the first to go, then m is a multiple of 10. If k is the second<br />

one to go, then m ≡ k ( mod 9), which is just another way of saying that k<br />

is choosen after counting m people in circle starting from 1. The third time,<br />

we start from k + 1 ( mod 9) in a circle of eight people, and want him to be<br />

chosen: this means m ≡ 1 ( mod 8). But if m is a multiple of 10, then m is<br />

even, and if m ≡ 1 ( mod 8), then m is odd: there is no integer which is both<br />

even and odd.<br />

3

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!