· · ·

70INT LAMBEAU'S OFFICE -- DAY

The office is more crowded than usual. TOM and THREE of LAMBEAU'S COLLEAGUES including the esteemed ALEXANDER PEKEC are in the room. Will sits at a work-station which projects a proof of his [Will's] onto the chalkboard. Lambeau stands beside the projected image at the board arguing with Pekec, a foreign mathematician. The image is of a Ramses graph binary tree.

LAMBEAU

Alexander, I know your theory. The

boy is updating, he's strategy

stealing...

PEKEC

With a Ramses graph on the binary tree--

LAMBEAU

--But what he's doing, he's attaching

an edge to the adjacent vertex. He

can always failsafe to either side--

PEKEC

Maker can. This is not new, Gerry!

Pekec starts writing lines beside Will's proof on the board.

PEKEC (cont'd)

--but I can always garbage out

(writes frantically)

All the way to "N" to the minus one.

LAMBEAU

No, there's a limit.

PEKEC

The limit is not found!

(turns to Will)

The limit is not found.

WILL

But I can always go to the other side.

PEKEC

There is no proof--

Lambeau can no longer contain himself.

LAMBEAU

--Maker builds "K" to the "N." N is

three to the K times--

PEKEC

--But--

WILL

Look, I wrote it down.

They turn to Will who places his proof on the projector. The image is cast over their faces. It reads:

As Pekec reads and the realization dawns on him:

WILL (cont'd)

It's just simpler this way.