perplexus.info :: Games : Always greater

Home > Games

Always greater (Posted on 2007-04-14)

Two players play a game in which they alternate calling out positive integers ≤ N, according to:

The first player must always call out odd numbers.

The second player must always call out even numbers.

Each player must call out a number greater than the previously called number (except, obviously, the very first time).

The player who cannot call out a number loses.

How many different possible games are there? And, if we count a turn each time a player calls out a number, how many different K-turns games are there?

Note: the game is not very fun to play (why?) but the puzzles are interesting!

Submitted by Federico Kereki

Rating: 3.5000 (2 votes)

Solution: (Hide)

See the answer at Nick's Mathematical Puzzles.

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
A Combinatorics Approach	Gamer	2007-04-16 01:32:28
A boring game	Old Original Oskar!	2007-04-15 13:37:05
Solution to the second question	Dej Mar	2007-04-14 16:06:04
solution	Charlie	2007-04-14 15:12:01
Answer to the first question	Dej Mar	2007-04-14 13:57:00
Top limit?	brianjn	2007-04-14 11:39:28

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (13)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info