1) True

story
2) Shows what dinner w -
/
Mr. Almeida is like .

twhy ?

of billions of kiwifruit each

There are tens produced each
year ,
but
has a maximum of about 2,500 seeds .
If we sorted them all ,

throwing them into bins based the #

of seeds some would be in the
upon AT -
bin
• .

Sanne
÷#
o
O
,

of o
bag I
"
lol lol
- -
- -

' 9000 ooo ooo ?

O
, ,
1 2 2500

holes but each hole

IF : then there are ntl pigeons ,
n
,

has at The last fact implies that there at

most one
pigeon .
are

that there were htt This is

most n
pigeons ,
but we
presumed . a

false and the principle is true

contradiction ,
so our supposition is .

We have to find bias where two numbers

being in
any
the same bin makes the statement true .
Coiner :

11,115 ,
12 COZ , ,
I 3,93 ,
I 4 , 83,125,73 ,
463

whichever severe draw from II. 2 lit into of

place
one
We we ,
- - -

matches two in
the above bins its label We must
put one

six
.

bin by the above principle .

Construct bins fo ,
1807
,
11,1817 ,
- - - -

,
1179,3593 and argue as above .
 Consider bins : fl ,
2
,
- - -
103 Any two numbers in

the bin have the

111,12 203
-

- - -
same
, ,

that
-

@
property their
'
difference is less than 10 .

191,92 ,
- - - -

,
too }
with 11 numbers and

have to numbers the

place two in
ten bins ,
we

same bin .

the
We consider
two cases : There is a
person
at
party within
at the has at least friend Then has
friends ,
o -
everyone party one .
everyone
in -2} fi each of
a number of friends in the sets fo , 1,2 , -- -
or
,
2
,
-- - -

n -

}
I

of these collections
which have n -
l
spaces Placing . n
people into one

bated upon
how
many friends they have forces there to be at least

two people with the same number of friends .

* My p
D
' -
-

R fl

Etty - o e

El
lol lol
Ld
-
- -
-

O n-2
,

make the bins here what forces two points

It's tricky to :

to have an integer -
valued midpoint ? Both x - and
y
- coordinates

be the both both odd

must same
parity ,
even ar .

There are four bins fever event fever , oddf Todd , even
} ,
todd ,
odd}
, ,
- ,

the
two points
five
in
into which we place points in IR ? .
but any

amid pt integer
ihez)
same bin have .
( ×x .
thats an .
 eg .
0 ,
fl ,
2,77 ,
12415} are X; but El 1,23
,
is
_wt .

↳
eg .
S ( El , 3,537--1+3+5
= 9
we make bins of
possible valves of S ( Xi ) :

The lowest is
S (8) =
O ,
and the largest is S ( 17.8.93 ) = 24

Presuming that all valves between o and 24 a re

possible ,

( fewer helps our

argument ) that leaves Placing 26 25 bins .

sets in these bins means that , by the Pigeonhole principle ,

some two sets share a sum .

( This one is admittedly just a proof by contradiction ) .

then every color has different number of colors in each

Supposing
a
.

Pick blue How blue

required ?
squares are
:
one
many
row ,
say
.

with its rows .

we'd need at least Otl t - - -

t 14 '4z = = Los blue

the other colors , we'd need

Considering 3 105=315
.

squares .

total But we
only have 15.15 = 225
squares
squares
.

let t =
"
the number of aspirin consumed by the end of the
;

and all
"
ith
day previous days .

and that the

we know that 421 and Ezo ⇐ 45
,
30

tzo all lie in the integers fi 457

-
- -

-4 I
.
,
valves , ,
-
-
-

other valves ft ; +143-7=0 =fE -114 -4+14 , stat 147

Consider
-
- -

,
30 ,
,

that t , -114 15 and Ezo -114=59

we know I .

elements of 4-43-7=9 Off -1147?? lie in IL 595

the 60
-

,
- -

,
Then
.

of these 60 repeat a valve As the ti are

Thus some
.

with
distinct ,
so are the t ; +14 , and the overlap must occur

the start and of the

some ti =
-4 -114 with it j . These are
day
consecutive sequence
of
days .