num=int(input("Enter an integer : "))if num>1 : for i in range(2,num):if(num%i)==0:print(num," is a prime number")breakelse:print(num," is a prime number")else:print(num," is a prime number")Output
Subscribe to:
Post Comments (Atom)
Python Program to find Fabonacci
fabtab={} def fabonacci(n): fabtab[0]=0 fabtab[1]=1 for i in range(2,n+1): fabtab[i]=fabtab[i-1]+fabtab[i-2] ...
-
#include< stdio.h > #include< stdlib.h > #include< conio.h > int arr[100], size=0; void insert_beg(); void insert_pos()... -
fabtab={} def fabonacci(n): fabtab[0]=0 fabtab[1]=1 for i in range(2,n+1): fabtab[i]=fabtab[i-1]+fabtab[i-2] ...
No comments:
Post a Comment