[AccessD] OT: Friday entertainment

Shamil Salakhetdinov shamil at users.mns.ru
Fri Sep 23 12:53:43 CDT 2005


> Should the chocolate go to Susan anyway?
Yes, of course.

> expressed as 10 to 3 based numbers
I was close to the clue experimenting with notation basis :(
But James found error in your sequence.
And I didn't expect there was one.
So the answer is:

10  = 10 (base 10)
11  = 10 (base 9)
12  = 10 (base 8)
13  = 10 (base 7)
14  = 10 (base 6)
20  = 10 (base 5)
22  = 10 (base 4)
101 =  10 (base 3)
1010 = 10 (base 2)

Thank you,
Shamil

----- Original Message ----- 
From: "Gustav Brock" <Gustav at cactus.dk>
To: <accessd at databaseadvisors.com>
Sent: Friday, September 23, 2005 9:17 PM
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
>
>
> -- 
> AccessD mailing list
> AccessD at databaseadvisors.com
> http://databaseadvisors.com/mailman/listinfo/accessd
> Website: http://www.databaseadvisors.com




More information about the AccessD mailing list