#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/math-fundamentals/arithmetic-modulo/power-of-two-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/math-fundamentals/arithmetic-modulo/power-of-two-implementation

Repovive

Power of Two - Implementation - Arithmetic & Modulo | Math Fundamentals | Repovive

Repovive.

Math Fundamentals18 sections · 842 units13h total

Open in Course

Power of Two - Implementation

In pseudocode

Here's the complete solution:


function isPowerOfTwo(n)
    if n ≤ 0 then
        return false
    while n > 1
        if n mod 2 ≠ 0 then
            return false
        n := n / 2
    return true

Each division by $2$ reduces $n$ . If at any point $n$ is odd (modulo $2 \neq 0$ ), you know it's not a power of two. The loop runs at most $\log_2(n)$ times.