Question

hey guys, ☺

write a program to find if the given integer is a prime number or not.​

Answer 1

Answer:

Enter a positive integer: 29 29 is a prime number. In the program, a for loop is iterated from i = 2 to i < n/2 . If n is perfectly divisible by i , n is not a prime number. In this case, flag is set to 1, and the loop is terminated using the break statement.

Explanation:

PLEASE MARK AS BRAINLIST ANSWER

Answer 2

Answer:

HEY PIHU ,

WHAT'S UP

HIW TO USE TELEGRAM

SINCE I HAD DOWNLOADED IT BUT DONT KNOW WHAT TO DO ..........

Explanation:

To prove whether a number is a prime number, first try dividing it by 2, and see if you get a whole number. If you do, it can't be a prime number. If you don't get a whole number, next try dividing it by prime numbers: 3, 5, 7, 11 (9 is divisible by 3) and so on, always dividing by a prime number (see table below).