Skip to content

problem2.md

Latest commit

 

History

History
12 lines (9 loc) · 340 Bytes

problem2.md

File metadata and controls

12 lines (9 loc) · 340 Bytes

Problem 2: Logarithmic Divisibility (Power of Three)

Problem Statement

Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there exists an integer x such that n == 3^x.

Input Format

  • An integer n.

Example

Input: n = 27
Output: True