Finding roots using bitmask

Just like the problem power of some number can be found in O(logn) how can we find certain roots of a given number through bit manipulation?

@tasfikrahman007
I am not sure of a bitmasking solution but you can definitely do it using binary search.
Other way to do it is using Newtons Method. Look it up once. It is a very interesting method to find the nth root of any number.

If my answer was able to answer your query, please mark the doubt as resolved.