i got this problem in book *foudations of algorithm:* Rules: start from number 1, you can (1) mutiple it by 2 for any time (2) divide it by 3 for any time Example: 13=1*2*2*2*2/3*2*2*2/3 . Question: is there a nature number n that cannot be produced following the above rules?
it seems negative to me,but don't know how to proof. maybe somebody would be interested enough to help --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
