Given an integer n, determine whether it is a power of three. Return TRUE if it is, and FALSE otherwise.
An integer n is considered a power of three if there exists an integer x such that n ==3x.
Note: Could you solve it without using loops or recursion?
Constraints:
The key insight is that since 3 is a prime number, any power of ...