Check if a Number is Prime in C

# Introduction

In this lab, we will learn how to check if a number is prime in C programming. The lab consists of three steps: reading an integer input from the user, testing divisibility from 2 to the square root of the number, and printing whether the number is prime or not. By the end of this lab, you will have a working program that can determine the primality of a given integer.

The lab starts by teaching how to read an integer input from the user using the `scanf()` function. Then, it introduces the prime number checking algorithm, which involves testing divisibility from 2 to the square root of the input number. If no divisors are found, the number is considered prime. Finally, the program prints the result, indicating whether the number is prime or not.