You could compute the logarithm of the number to the base 3 and see if the result is an integer.
Dave On Sep 21, 12:22 pm, Anshya Aggarwal <[email protected]> wrote: > how to find that whether the given number was of the form 3^n. ( i.e. 3 to > the power n). > one way is to recursively divide the number by 3 and check the remainder. > Is there any other way using bit manipulation or anything else?? > > -- > Anshya Aggarwal --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
