[AccessD] OT: Friday entertainment

Hi James and Shamil

You are so right, sorry. Proves my inexperience with 3-based numbers!! And that this list knows just about everything.

Anyway, this is only for fun! 
(Are you listening Susan? Or are you trying how to match pi and some chocolate pieces?)

/gustav

>>> James at fcidms.com 23-09-2005 19:47:56 >>>
Gustav

Well, I don't eat chocolate so Susan is welcome to it. But, you can't have
31 in base 3, that's why the 101 (3^2*1 + 3*0 + 1).
Anyway, thanks for the diversion.

James 

-----Original Message-----
From: accessd-bounces at databaseadvisors.com 
[mailto:accessd-bounces at databaseadvisors.com] On Behalf Of Gustav Brock
Sent: Friday, September 23, 2005 1:18 PM
To: accessd at databaseadvisors.com 
Subject: Re: [AccessD] OT: Friday entertainment

Hi James

Great! That's it: 1010.

The sequence is right. It's 10 (ten) expressed as 10 to 3 based numbers and
the requested is the binary (2) based expression.
The only remaining item I can think of would be 1 based which is a joke as
that should be ten 1's: 
1111111111 - which equals just counting your fingers.

Should the chocolate go to Susan anyway?

/gustav

>>> James at fcidms.com 23-09-2005 19:00:54 >>>
Are you sure that sequence is correct? The only one I've seen that matches
would be:

10 11 12 13 14 20 22 101 1010

James Barash 

-----Original Message-----
From: accessd-bounces at databaseadvisors.com 
[mailto:accessd-bounces at databaseadvisors.com] On Behalf Of Gustav Brock
Sent: Friday, September 23, 2005 7:07 AM
To: accessd at databaseadvisors.com 
Subject: Re: [AccessD] OT: Friday entertainment

Hi all

We still have this open:

3. What is the next number in this series:
  10 11 12 13 14 20 22 31 ?

It's quite clever in fact. A true nerd thing suited for any programmer.
A hint: The requested item is the last one possible ...(?!!)

/gustav