>>>>I need to create algorithm (based on an integer number) that by applying some formula or equation to this number I can identify if the number belongs to group 1, 2, or 3 or any combination of them (e.g. 1 and 2, 1 and 3, 1 and 2 and 3, 2 and 3)
>>>>For example, number 8 would indicate belonging to all three groups (since I can divide this number by the group number without a remainder.
>>>>Any suggestions?
>>>
>>>It just occured to me that the answer is very simple.
>>
>>
>>Is this about your options ? (from yesterday)
>>
>>Then the groups are just bits. Test witth BitTest()
>>
>>And belonging to all three groups = 7
>
>Yes, this is a follow up to the options thread from yesterday. But I can't seem to grasp how to apply BitTest() to this issue. I can't understand how the value of 7 by using BitTest() indicates that 7 belongs to all three groups? Could you please explain?


option1 is 2^0 , ie 0 or 1
option2 is 2^1 , ie 0 or 2
option3 is 2^2 , ie 0 or 4


So, if all options are set, you get 4+2+1 = 7

n = 7

hasOption1 = bittest(n, 0)  && is bit 0 set  ?

hasOption2 = bittest(n, 1) && is bit 1 set ?

hasOption3 = bittest(n, 2) && is bit 2 set ?

If n is 5 ( 1+4) then it's option1 and option3