Check if a Number is Divisible by 2 and 3 in C

January 03, 2026

C Program to Check Prime Number Using Efficient Logic

Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design. Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

✅ CHECK IF A NUMBER IS DIVISIBLE BY 2 AND 3 IN C

#include <stdio.h>

int main() {
    int num;

    printf("Enter a number:\n");
    scanf("%d", &num);

    if (num % 2 == 0 && num % 3 == 0) {
        printf("%d is perfectly divisible by both 2 and 3.\n", num);
    } else {
        printf("%d is NOT divisible by both 2 and 3.\n", num);
    }

    return 0;
}

🧠 Explanation:

This program checks whether a given number is divisible by both 2 and 3.

It uses num % 2 == 0 to check divisibility by 2.
And num % 3 == 0 to check divisibility by 3.
If both are true, it prints that the number is divisible by both.

🖥️ Sample Output:

Enter a number:
12
12 is perfectly divisible by both 2 and 3.

🔑 Keywords:

C program to check divisibility, modulus operator, if condition, logical AND, basic C program.

Search This Blog

1PRINTF

Featured

C Program to Check Prime Number Using Efficient Logic