Best Answer

Type your answer here... i think we should first enter 1 number then check it

Lvl 1

1

Q: Write an algorithm to check whether the given number is odd or even?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

You can write out this algorithm. This will then be programmed into the device to make determining prime numbers easier.

write a c++program by using if statement to read a number and check whether it is positive or negative

Find a prime number, add 2 to the number. Check if the new number is prime. IE : 3 is prime. 3+2 =5. 5 is prime. (3,5) are twin primes.

45

if it's square root is an integer, it is a square number.

Related questions

You can write out this algorithm. This will then be programmed into the device to make determining prime numbers easier.

Algorithm Step1: Read A, B, C Step2: If A > B is True, then check whether A > C, if yes then A is greatest otherwise C is greatest Step3: If A > B is False, then check whether B > C, if yes then B is greatest otherwise C is greatest Give the Flowchart Answer

write a c++program by using if statement to read a number and check whether it is positive or negative

Answe check for login

Perhaps you mean an automorphic number? Loop through a series of numbers - for example, all numbers from 1 to 10,000 - and check each of the numbers, whether the condition applies. The condition in this case is that if you square the number, the last digits represent the original number.

Avogadro's number is a constant. Therefore only one number is equal to Avogadro's number.

Check digits are determined (or derived) by a set algorithm using the digits of the account number.

write a program in C to check whether a given number is apalindrome or not

Take each number in turn, call it "n", and check whether it has any factors f, such that 1 < f < n. If it doesn't, it is a prime number.Take each number in turn, call it "n", and check whether it has any factors f, such that 1 < f < n. If it doesn't, it is a prime number.Take each number in turn, call it "n", and check whether it has any factors f, such that 1 < f < n. If it doesn't, it is a prime number.Take each number in turn, call it "n", and check whether it has any factors f, such that 1 < f < n. If it doesn't, it is a prime number.

1. sort desc, so a1 >= a2 >= a3 2. check if (a1*a1 == a2*a2 + a3*a3) then true

Find a prime number, add 2 to the number. Check if the new number is prime. IE : 3 is prime. 3+2 =5. 5 is prime. (3,5) are twin primes.

45