I suggest you write an outer loop, that loops through all the numbers from 1 to 50. Call the variable that controls the loop something like "number".Then, initially assume the number is a prime (with a variable such as "isprime"); and write another loop that compares whether the number is divisible by any number from 2 to number-1. Call the controlling variable "factor". If number is divisible by factor, then it is not a prime, and you can exit the loop.
At the end of the inner loop, if the variable "isprime" is still true, then you print the number.
This would require some computer knowledge. It can make it easier to find out the prime numbers without figuring it out in your head.
Oh, what a lovely request! In FoxPro, you can create a program to print all prime numbers from 1 to 100 by using a loop to check each number for divisibility only by 1 and itself. If it meets this criteria, you can print it out on the screen. Remember, every number is unique and special, just like a happy little tree in a vast forest.
You can use int i; for (i = 10; i <= 50; i += 2) {//print i} as a program to print even numbers between 10 and 50.
VBnet program to find the prime numbers between 100 to 200?
fdsgfhgdfhgdf
This would require some computer knowledge. It can make it easier to find out the prime numbers without figuring it out in your head.
Oh, what a lovely request! In FoxPro, you can create a program to print all prime numbers from 1 to 100 by using a loop to check each number for divisibility only by 1 and itself. If it meets this criteria, you can print it out on the screen. Remember, every number is unique and special, just like a happy little tree in a vast forest.
Q.1 Write a program to print first ten odd natural numbers. Q.2 Write a program to input a number. Print their table. Q.3 Write a function to print a factorial value.
You can use int i; for (i = 10; i <= 50; i += 2) {//print i} as a program to print even numbers between 10 and 50.
VBnet program to find the prime numbers between 100 to 200?
#include
fdsgfhgdfhgdf
First, create a for loop from a,1 to 50. Inside of that create another for loop b,2 to a-1. If a/b=int(a/b) then you know it is not prime
Since there is an infinite set of prime numbers the answer would be infinity.
This is a homework question and does not deserve an answer because you will learn nothing other than being lazy.
you do this 10 print "0112358132134" use the whole of the thing
By learning how to program on C+.