Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Easy, Next in series.

0 views
Skip to first unread message

Brandon Johnson

unread,
Aug 9, 1995, 3:00:00 AM8/9/95
to
Here's an easy one for you all. I found it in a game and it had me
stumped until I found the right answer, through trial and error. After
knowing the answer it seemed really simple.

What is the next it the sequence?

O T T F F S S _

Brandon Johnson
'who knows this is easy but still liked it.'

EKrampitz

unread,
Aug 9, 1995, 3:00:00 AM8/9/95
to
E


O ne
T wo
T hree
F our
F ive
S ix
S even

Timothy E Vaughan

unread,
Aug 10, 1995, 3:00:00 AM8/10/95
to
In article <40b012$6...@mars.dsu.edu>, Bran...@is.state.sd.us

(Brandon Johnson) writes:
|> Here's an easy one for you all. I found it in a game and it had me
|> stumped until I found the right answer, through trial and error. After
|> knowing the answer it seemed really simple.
|>
|> What is the next it the sequence?
|>
|> O T T F F S S _

Next in the sequence will be flames and messages saying
"Read the FAQ before posting."

ObPuz: Suppose that you wrote down all the sequence puzzles that
have been posted to rec.puzzles. Can you predict the next member
of the sequence? More importantly, can you show that the sequence
is FINITE?

Cheers,

Tim

Karen L Lingel

unread,
Aug 10, 1995, 3:00:00 AM8/10/95
to

In article <40cs8o$2...@senator-bedfellow.MIT.EDU>, tvau...@athena.mit.edu (Timothy E Vaughan) writes:
>ObPuz: Suppose that you wrote down all the sequence puzzles that
>have been posted to rec.puzzles. Can you predict the next member
>of the sequence? More importantly, can you show that the sequence
>is FINITE?

I can prove the sequence is circular and thus INfinite. The proof
is to keep reading this newsgroup for all eternity, watching the
sequence sequence recirculating.


Chris Cole

unread,
Aug 10, 1995, 3:00:00 AM8/10/95
to
In article <40b012$6...@mars.dsu.edu> Bran...@is.state.sd.us (Brandon Johnson) writes:
>Here's an easy one for you all. I found it in a game and it had me
>stumped until I found the right answer, through trial and error. After
>knowing the answer it seemed really simple.
>
>What is the next it the sequence?
>
> O T T F F S S _

This question is in the rec.puzzles archive:
==> series/series.06.p <==
Z, O, T, T, F, F, S, S, E, N?

==> series/series.06.s <==
T. The name of the integers starting with zero.
********************************************
Instructions for Accessing the rec.puzzles Archive

INTRODUCTION

The rec.puzzles Archive is a list of puzzles, categorized by subject
area. Each puzzle includes a solution, compiled from various sources,
which is supposed to be definitive.

EMAIL

To request a puzzle, send a message to archive...@questrel.com like:

return_address your_name@your_site.your_domain
send requested_puzzle_name

For example, if your net address is "mic...@disneyland.com", to request
"geometry/duck.and.fox.p", send the message:

return_address mic...@disneyland.com
send duck.and.fox

To request the index, use:

send index

To request multiple puzzles, use several "send" lines in a message.
Please refrain from requesting the entire archive via email. Use FTP.

FTP

The entire archive is also accessible via anonymous FTP, from any site
which maintains archives of the newsgroups news.answers or
rec.answers. One such site is rtfm.mit.edu, where the archive is in
the directory /pub/usenet/news.answers/puzzles/archive. The file
part01 contains the index. The remaining files contain alternating
problem text and solution text for all the puzzles.

Some other FTP sites are:

ftp://ftp.cs.ruu.nl/pub/NEWS.ANSWERS/puzzles/archive
ftp://ftp.uu.net/usenet/news.answers/puzzles/archive
Compressed plain text.
ftp://ftp.cis.ksu.edu/pub/mirrors/news.answers/puzzles/archive
Compressed plain text.
ftp://gaia.ucs.orst.edu/pub/mirrors/rtfm.mit.edu/pub/usenet/news.answers/puzzles/archive

GOPHER

From the global home page, the menu choices to access the archives
at "cs.ttu.edu" are:
North America/USA/Texas/Texas Tech University, Computer Sciences
/Entertainment/Games/Puzzles
To access "uni-hohenheim.de" your menu choices are:
Europe/Germany/University of Hohenheim/Lots of Interesting Stuff
/FAQ Frequently Asked Questions/rec/puzzles/archive

WEB

http://alpha.acast.nova.edu/puzzles.html
Linked to the gopher server immediately above.
http://xraysgi.ims.uconn.edu:8080
By keyword as well as subject.
http://einstein.et.tudelft.nl/~arlet/puzzles/index.html
Unknown date; partially HTMLized.

THE rec.puzzles ORACLE

This is a group of rec.puzzles regulars, who are familiar with the
rec.puzzles archive, and who will find your answer there if it exists,
or maybe compose an original answer if they are interested enough!
At any rate, they promise to respond to your question within two days,
and perhaps save you the embarrassment of posting a well-worn
question. They will respond within two days even if they do not know
the answer to your question.

To query the rec.puzzles oracle, send email containing your question
to the following address:

puzzle...@questrel.com

se...@lehigh.edu

unread,
Aug 10, 1995, 3:00:00 AM8/10/95
to
In article <40b012$6...@mars.dsu.edu>, Bran...@is.state.sd.us (Brandon Johnson)

writes:
>Here's an easy one for you all. I found it in a game and it had me
>stumped until I found the right answer, through trial and error. After
>knowing the answer it seemed really simple.
>
>What is the next it the sequence?
>
> O T T F F S S _
>
>Brandon Johnson
>'who knows this is easy but still liked it.'
>

That's easy!
(see below)

OTTFFSS E


(1,2,3,4,5,6,7,8) :)

Thanks...it was fun to get one right for a change

-Sarai


______________________________________________________________________
| Sarai Spohn | Some say the world will end in fire |
| Taylor College | Some say in ice |
| Lehigh University | From what I've tasted of desire |
| Bethlehem Pa USA | I hold with those who favor fire |
| | But if it had to perish twice |

0 new messages