Computing prime numbers, factorials, and Fibonacci series
We can find out if a number is prime by checking its divisibility with all the numbers less than it. If a number is only divisible by 1 and itself, then it’s a prime number. We can compute prime numbers in a given range using the for loop twice as follows:
lower = 2 upper = 100 for num in range (lower, upper+1): for i in range(2, num): if(num % i) == 0: break else: print(num)
The output is as follows:
>>> %Run -c $EDITOR_CONTENT 2 3 5 7 … 97
We can also compute the factorial of a number. The factorial of 0 and 1 is 1. For the rest of the integers, the multiplication of all the integers from 1 to that integer is factorial. Let’s write a simple program that computes the factorial...