Not a fibonacci series

Jeff Kinz jkinz at kinz.org
Wed Feb 25 14:57:00 EST 2004


On Wed, Feb 25, 2004 at 02:40:01PM -0500, Greg Rundlett wrote:
> If I have four options:
> a)
> b)
> c)
> d)
> and none are mutually exclusive, then there are 15 possible 
> combinations.  Assigning a value to each:
> a = 1, b=2, c=4, d=8, the unique combination can be assigned a code by 
> summing the values
> No. 	Combination
> 	Code
> 1 > 	a 	1
> 2 > 	b 	2
> 3 > 	c 	4
> 4 > 	d 	8
> 5 > 	a, b 	3
> 6 > 	a, c 	5
> 7 > 	a, d 	9
> 8 > 	b, c 	6
> 9 > 	b, d 	10
> 10 > 	c, d 	12
> 11 > 	a, b, c 	7
> 12 > 	a, b, d 	11
> 13 > 	a, c, d 	13
> 14 > 	b, c, d 	14
> 15 > 	a, b, c, d 	15


heh, heh, - four positions, values from 0 to 15 inclusive.  Sounds like
a four bit, binary number to me.  :-)

   d, c, b, a = 1111(base 2) = 15 (base 10)

> 
> 
> 
> What is this type of problem referred to?  I know it's not a fibonacci 
> series.  Anyone know of good examples of processing this info 
> programmatically?
> 
> You may ask:  What the hell is a fibonacci series?  
> http://www.textism.com/bucket/fib.html
> 
> Thanks,
> Greg
> 
> -- 
> Greg Rundlett
> Chief Technology Officer
> Knowledge Institute
> creators of the Business Utility Zone Gateway
> at www.buzgate.org
> (603) 642-4720
> greg at buzgate.org
> At the source of every error which is blamed on the computer you will find
> at least two human errors, including the error of blaming it on the computer.
> 

-- 
Jeff Kinz, Open-PC, Emergent Research,  Hudson, MA.  
"jkinz at kinz.org" is copyright 2003.  
Use is restricted. Any use is an acceptance of the offer at
http://www.kinz.org/policy.html.



More information about the gnhlug-discuss mailing list