Algorithm to find out whether an input is a prime number or not

[hadi amiri 4]

Homework Statement

1- write an algorithm to find out whether an input is a prime number
or not.
2-write aa program to compute square root by Newton method
3-write an algorithm to show an input is perfect or not.
4-

Homework Equations

The Attempt at a Solution

 

[Mark44]

Homework Statement

1- write an algorithm to find out whether an input is a prime number
or not.
2-write aa program to compute square root by Newton method
3-write an algorithm to show an input is perfect or not.
4-

Homework Equations

The Attempt at a Solution

Before getting any help on this forum, you need to show what you have tried to do.

 

[Mene]

1. Algorithm to determine if a number is prime:
Step 1: Start
Step 2: Take input from the user and store it in a variable 'num'
Step 3: Initialize a variable 'flag' to 0
Step 4: If 'num' is less than 2, then print "Not a prime number" and go to Step 8
Step 5: Use a for loop to iterate from 2 to 'num'-1
Step 6: Inside the loop, check if 'num' is divisible by the current value of the loop variable. If yes, set 'flag' to 1 and break out of the loop.
Step 7: After the loop, check the value of 'flag'. If it is 1, then print "Not a prime number", else print "Prime number".
Step 8: Stop.

2. Program to compute square root using Newton's method:
Step 1: Start
Step 2: Take input from the user and store it in a variable 'num'
Step 3: Initialize a variable 'guess' to 'num'/2
Step 4: Initialize a variable 'diff' to 1
Step 5: Use a while loop to iterate until 'diff' is less than or equal to 0.0001
Step 6: Inside the loop, calculate the next guess using the formula: guess = (guess + 'num'/guess)/2
Step 7: Update 'diff' to the difference between 'num' and the square of 'guess'
Step 8: After the loop, print the final value of 'guess' as the square root of 'num'
Step 9: Stop.

3. Algorithm to determine if a number is perfect:
Step 1: Start
Step 2: Take input from the user and store it in a variable 'num'
Step 3: Initialize a variable 'sum' to 0
Step 4: Use a for loop to iterate from 1 to 'num'-1
Step 5: Inside the loop, check if 'num' is divisible by the current value of the loop variable. If yes, add the value to 'sum'.
Step 6: After the loop, check if 'sum' is equal to 'num'. If yes, then print "Perfect number", else print "Not a perfect number".
Step 7: Stop.