Dhruvesh Patel
Dhruvesh Patel
def prime(n):
count = 0
for i in range(1,n+1):
if n % i == 0:
count = count + 1
if count == 2:
return 1
else:
return 0
n = int(input("enter a number: "))
D = prime(n)
if D == 1:
print(n,"is prime number")
else:
print(n,"is composite number")
output:
enter a number: 2
2 is prime number
def pal(str):
if (str == str[::-1]):
print("Yes, it is Palindrome")
else:
print(" it is not Palindrome")
Yes, it is Palindrome
def fact(n):
if n == 1 or n == 0:
return 1
else:
return(n * fact(n-1))
def fact(r):
if r == 1 or r == 0:
return 1
else:
return(r * fact(r-1))
n = int(input("enter n : "))
r = int(input("enter r : "))
D = fact(n)
K = fact(r)
dif = int(n-r)
F = fact(dif) #here dif is (n-r)
npr = (D/F)
print("npr is =", npr)
ncr = (npr/K)
print("ncr is =", ncr)
output:
enter n : 8
enter r : 4
npr is = 1680.0
ncr is = 70.0