How do you check a prime number in qbasic?

Answer 1

Cls

input "enter the no. You want to check", a

if a <=0 then print "only natural nos allowed"

if a <=0 end

let m = a - 1

for i = m to 2 step -1

if a mod i = 0 then print "not prime"

if a mod i = 0 then end

next i

print "prime"

end

Answer 2

In QBasic, you can check if a number is prime by iterating through all numbers from 2 to the square root of the number and checking if the number is divisible by any of them. If the number is divisible by any number other than 1 and itself, it is not prime. You can implement this logic using a FOR loop and an IF statement in QBasic to determine if a given number is prime.