Real: It stores the floating point numbers.Ĭomplex: It is used for storing complex numbers. Integer: It can hold only integer values. MOD(OptimusPrime,Divisor) = 0) EXITĭivisor = Divisor + 2 END DO IF (Divisor*Divisor > OptimusPrime) THEN ! display prime PRINT *, OptimusPrime PRINT *, " " ! set range value Range = 100 ! evaluate for prime number DO OptimusPrime = 3, Range, 2ĭivisor = 3 DO ! not prime IF (Divisor*Divisor > OptimusPrime. StrLine1 = 'Prime numbers: ' ! display string PRINT *, strLine1 ! declare strings CHARACTER(LEN = 15) :: strLine1 IMPLICIT NONE ! declare integers INTEGER :: Range, OptimusPrime, Divisor
A composite number is defined as a number having more than two factors.I used the registered version of the Simply Fortran compiler, here: simplyfortran-3.0.msi, simplyfortran-2.35.msi also, try the online Fortran compiler. We should remember that 1 is neither a Prime number nor a composite number. Any Prime number greater than 40 is of the form \. This form is not appropriate for the first two Prime numbers.
We should know that every Prime number can be expressed in the form as \ or \ except the multiples of the first five prime numbers where \ is a natural number. Some of the Properties of Prime numbers include:ġ) Every number greater than 1 can be divided by at least one prime number.Ģ) Every even positive integer greater than 2 can be expressed as the sum of two Primes.Ĥ) 2 is the only even number which is Prime.ĥ) Two primes are always co prime to each other. Therefore, the Number of Prime between 1 to 100 is 25. Here, we can see that the total count of prime numbers is 25. So, we will list all the numbers which have only 2 factors : 1 and the number itself. We know that the factors of a Prime number are 1 and itself.
Prime numbers are defined as a number having only two positive integers as their factors. We will list all the prime numbers between 1 to 100 and count them to find the required answer.
Here, we will use the concept of Prime numbers to answer this question.
0 kommentar(er)
