0
What else can I help you with?
How do you find prime no in gwbasic program?
10 input "enter a no."; n 20 for i = 1 to n 30 if n mod i = 0 then c = c +1 40 next i 50 if c = 2 then print "prime number" else print "not a prime number" 60 end
What is the largest prime no that is stored in 8 bit pattern?
Write your own prime number program and find out.
Prime numbers between 1 to 10 in microprocessor 8085?
program to find prime number in 8085 microprocessor
With a given big integer number which is the product of two prime numbers how do you find them?
First write a program to generate the prime number. After one prime number was generated, divide the big int number by the prime number. If the remainder is zero then quotient is the second prime number ( also it is important to check whether the quotient is prime number or not because sometimes you will get wrong answer). Repeat the process until you get the result.
How do you find the least prime number?
2 is the least prime number.
How do you find prime no in gwbasic program?
10 input "enter a no."; n 20 for i = 1 to n 30 if n mod i = 0 then c = c +1 40 next i 50 if c = 2 then print "prime number" else print "not a prime number" 60 end
What is the largest prime no that is stored in 8 bit pattern?
Write your own prime number program and find out.
An assembly language program that will take three decimal input and display minimum of them?
program that take three decimal number as input and find the largest among them in assembly language
How do you write a BASIC program to display whether the input number is prime or composite?
To write a BASIC program that checks if an input number is prime or composite, you can use a loop to test divisibility. First, prompt the user for a number and then check if it's less than 2 (which is neither prime nor composite). For numbers greater than 1, iterate from 2 to the square root of the number, checking if it divides evenly (using the modulus operator). If you find a divisor, the number is composite; otherwise, it's prime. Here's a simple example: INPUT "Enter a number: ", N IF N < 2 THEN PRINT "Neither prime nor composite": END IS_PRIME = TRUE FOR I = 2 TO SQR(N) IF N MOD I = 0 THEN IS_PRIME = FALSE EXIT FOR END IF NEXT I IF IS_PRIME THEN PRINT N; " is prime" ELSE PRINT N; " is composite"
Prime numbers between 1 to 10 in microprocessor 8085?
program to find prime number in 8085 microprocessor
Write a C program called MonthDays to find the number of days in a given month Test your code with different input values to demonstrate that your function is robust?
Write a C program called MonthDays to find the number of days in a given month Test your code with different input values to demonstrate that your function is robust?
Shell program to generate prime number between 1 and 50?
There are several shell programs available for download on the Internet that will generate prime numbers. The best way to find a prime number is through calculation, however.
With a given big integer number which is the product of two prime numbers how do you find them?
First write a program to generate the prime number. After one prime number was generated, divide the big int number by the prime number. If the remainder is zero then quotient is the second prime number ( also it is important to check whether the quotient is prime number or not because sometimes you will get wrong answer). Repeat the process until you get the result.
How do you write a VBnet program to find the prime numbers between 100 to 200?
VBnet program to find the prime numbers between 100 to 200?
Java source code to find prime number?
/* Program to Find whether number is Prime or Not. */ class PrimeNo{ public static void main(String args[]){ int num = Integer.parseInt(br.readLine()); int flag=0; for(int i=2;i
How do you find a fraction of a prime number?
Divide the prime number.
Write a c program to find given number is prime or not?
Yes, do write, or if you're too lazy to your homework, use google.
