Tap here to switch tabs
Problem
Submissions

Problem: Power of Three

Power of Three asks whether a given integer is exactly three raised to an integer power. Return TRUE or FALSE, without using loops or recursion.

Statement

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== 3^x.

Note: Could you solve it without using loops or recursion?

Constraints:

  • −231≤-2^{31} \leq n ≤231−1\leq 2^{31} - 1

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Power of Three

Power of Three asks whether a given integer is exactly three raised to an integer power. Return TRUE or FALSE, without using loops or recursion.

Statement

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== 3^x.

Note: Could you solve it without using loops or recursion?

Constraints:

  • −231≤-2^{31} \leq n ≤231−1\leq 2^{31} - 1