| Title: | Brain Bogglers |
| Notice: | BRAIN_BOGGLERS is, like, back in business, totally |
| Moderator: | BUSY::SLAB |
| Created: | Mon Jul 13 1987 |
| Last Modified: | Mon Jun 02 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 1441 |
| Total number of notes: | 13981 |
| T.R | Title | User | Personal Name | Date | Lines |
|---|---|---|---|---|---|
| 345.1 | answer???????? | MDVAX1::HAYDEN | Fri Apr 01 1988 11:12 | 23 | |
| 345.2 | I don't know if it's as simple as .1 says | VIDEO::OSMAN | type video::user$7:[osman]eric.vt240 | Fri Apr 01 1988 17:13 | 20 |
| 345.3 | but they are used consecutively, 0-9 | MDVAX1::HAYDEN | A Smith & Wesson beats 4 of a kind | Mon Apr 04 1988 11:36 | 6 |
| 345.4 | 4446::OSMAN | Eric Osman, dtn 226-7122 | Fri Apr 25 1997 16:41 | 32 | |
Let me ask this another way:
Suppose Digital buys keyboards from Microsoft. Each kbd Microsoft
ships includes numeral decals in the box, consisting of
0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9
We here at Digital label the first keyboard "0", the second "1",
counting consecutively.
So, of course, after labeling the first keyboard "0", we'll have these
decals left:
0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9
And after labeling the second keyboard "1", we'll have these left:
0,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9
0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9
Here are the boggler questions:
o Find a simple way to show that, although there are so many decals
left over, that at some point, if keyboards were purchased
indefinitely, we'd reach a numerical label we couldn't create given
the decals available.
o Find the exact point at which we'd get stuck.
/Eric ([email protected] 25-Apr-1997)
| |||||
| 345.5 | CSC32::MACGREGOR | Colorado: the TRUE mid-west | Fri Apr 25 1997 18:24 | 8 | |
/Eric was labeling his VCR tapes again 8^)
As someone who pondered that same thought while labeling my tapes once,
I can tell you that the number is going to be quite large.
Marc (who will try and think of an answer this weekend)
| |||||
| 345.6 | BUSY::SLAB | Act like you own the company | Fri Apr 25 1997 19:50 | 4 | |
I'd be willing to bet that edp can write a program that's Binder/2
lines long which will solve this problem in Binder/100 minutes.
| |||||