“Think Like a Programmer: Divisors and Prime Numbers with Flowcharts”

1.Divisors of given number

Flow Chart:

• In python :

num = 100
div = 2
while div < num:
    if num % div == 0:
        print(div)
    div = div + 1

Output :

• In JavaScript :

let num = 100;
let div = 2;

while (div < num) {
    if (num % div === 0) {
        console.log(div);
    }
    div = div + 1;
}

• In Java

public class Main {
    public static void main(String[] args) {
        int num = 100;
        int div = 2;

        while (div < num) {
            if (num % div == 0) {
                System.out.println(div);
            }
            div = div + 1;
        }
    }
}

2.Count Divisors Of Given Number :

Flow Chart :

• In python :

num = 100
div = 2
count=0
while div < num:
    if num % div == 0:
        print(div)
        count=count+1
    div = div + 1
print("divisors count : ",count)

Output:

• In JavaScript :

let num = 100;
let div = 2;
let count = 0;

while (div < num) {
    if (num % div === 0) {
        console.log(div);
        count = count + 1;
    }
    div = div + 1;
}

console.log(count);

• In Java :

public class Main {
    public static void main(String[] args) {
        int num = 100;
        int div = 2;
        int count = 0;

        while (div < num) {
            if (num % div == 0) {
                System.out.println(div);
                count = count + 1;
            }
            div = div + 1;
        }

        System.out.println(count);
    }
}

3.Prime Number:

Flow Chart:

• In Python :

num = 49
div = 2
flag = True

while div < num // 2:
    if num % div == 0:
        flag = False
        print("not prime")
        break
    div = div + 1

if flag:
    print("prime")

output:

• In JavaScript

let num = 49;
let i = 2;
let flag = true;

while (i <= Math.sqrt(num)) {
    if (num % i === 0) {
        flag = false;
        break;
    }
    i++;
}

if (flag) {
    console.log("prime");
} else {
    console.log("not prime");
}

• In Java :

public class Main {
    public static void main(String[] args) {
        int num = 49;
        int i = 2;
        boolean flag = true;

        while (i <= Math.sqrt(num)) {
            if (num % i == 0) {
                flag = false;
                break;
            }
            i++;
        }

        if (flag) {
            System.out.println("prime");
        } else {
            System.out.println("not prime");
        }
    }
}

Comments

[Payilagam]

Good! Keep it up!