Scribd
Upload
3 views5 pages

Programs

The document contains a collection of Python code snippets for various number-related checks and calculations, including determining if a number is prime, palindromic, Armstrong, magic, spy, and composite. It also includes implementations for generating Fibonacci and Tribonacci series, calculating factorials, finding prime factors, and checking for perfect and fascinating numbers. Each section prompts the user for input and outputs the result based on the specified criteria.

Uploaded by

Twinkle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views5 pages

Programs

The document contains a collection of Python code snippets for various number-related checks and calculations, including determining if a number is prime, palindromic, Armstrong, magic, spy, and composite. It also includes implementations for generating Fibonacci and Tribonacci series, calculating factorials, finding prime factors, and checking for perfect and fascinating numbers. Each section prompts the user for input and outputs the result based on the specified criteria.

Uploaded by

Twinkle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

# prime numberr

n = int(input("Enter a number:" ))
c=0
for i in range(1,n+1):
if n%i==0:
c=c+1
if c==2:
print(n," is prime number")
else:
print(n," is non-prime number")

# palindrome number without string


n = int(input("Enter a number:" ))
s=0
m=n
while n>0:
s=s*10+(n%10)
n=n//10
if s==m:
print(m," is palindromic number")
else:
print(m," is non-palindromic number")

# palindrome number string


n = int(input("Enter a number:" ))
s = str(n)
k = s[::-1]
if n==k:
print(n," is palindromic number")
else:
print(n," is non-palindromic number")

# palindrome number prime


n = int(input("Enter a number:" ))
c=0
for i in range(1,n+1): #prime check
if n%i==0:
c=c+1
s=0
m=n
while n>0: #reverse
s=s*10+(n%10)
n=n//10

c2=0
k=s
for i in range(1,k+1): #prime check
if k%i==0:
c2=c2+1
if c2==2 and c==2:
print("Palindromic Prime Number")
else:
print("Non Palindromic Prime Number")

# armstrong
# 153 = 1*1*1 + 5*5*5 + 3*3*3 = 153
n = int(input("Enter a number:" ))
m = n
s = 0
while n>0:
r = n % 10
s = s + r*r*r
n = n // 10
if s == m:
print(m," is armstrong number")
else:
print(m," is non armstrong number")

# magic number
# Example: 91=9+1=10=1+0=1
n = int(input("Enter a number:" ))
s=0
while n>0 or s>9:
if n==0:
n=s
s=0
r = n % 10
s = s + r
n = n // 10
if s == 1:
print("Magic number")
else:
print("Non-Magic number")

# spy number
# example 1124
# sum = 1+1+2+4 = 8
# product = 1*1*2*4 = 8
n = int(input("Enter a number:" ))
s=0 #sum
p=1 #product
while n>0:
r = n % 10
s = s + r
p = p * r
n = n // 10
if p == s:
print("Spy number")
else:
print("Non-spy number")

# fibonacci series
# 0 1 1 2 3 5 6 ...
n = int(input("Enter the number of terms:" ))
a,b=0,1
print(a,b,sep='\n')
for i in range(1,n-1):
c = a + b
print(c)
a = b
b = c

# tribonacci series
# 0 1 1 2 4 7 13 .....
n = int(input("Enter the number of terms:" ))
a,b,c=0,1,1
print(a,b,c,sep='\n')
for i in range(1,n-2):
d = a + b + c
print(d)
a = b
b = c
c = d

# factorial of a numberr
# 5! = 5x4x3x2x1 = 120
n = int(input("Enter a number:" ))
f = 1
for i in range(1,n+1):
f = f * i
print("Factorial: ",f)

# prime factors of a numbers


n = int(input("Enter a number: "))
print("The prime factors are :")
for i in range(1,n+1):
if n%i==0:
c=0
for j in range(1,i+1):
if i%j==0:
c=c+1
if c==2:
print(i)

# perfect number
# sum of the factors a number except the number itself
# factors of 6 = 1,2,3,6
# sum = 1+2+3
n = int(input("Enter a number: "))
sum = 0
for i in range(1,n):
if n%i==0:
sum=sum+i
if n==sum:
print(n,"is a perfect number")
else:
print(n,"is not a perfect number")

# fascinating number
n = int(input("Enter a number: "))
a = n*2
b= n*3
c = str(n)+str(a)+str(b)
flag=0
for i in c:
count=0
if i in "0123456789":
count+=1
if count>=2:
flag=1
break
if flag==1:
print("Not a fascinating number")
else:
print("A fascinating number")

#composite number
n = int(input("Enter a number: "))
c = 0
for i in range(1,n+1):
if n%i==0:
c=c+1
if c>2:
print("Composite number")
else:
print("Non-composite number")

#anamorphic number
import math
n = int(input("Enter a number: "))
q = n * n
c = 0
p = q
while p>0:
c+=1
p=p//10
c = c // 2
m = q % math.pow(10,c)
if m == n:
print(n,"is anamorphic number")
else:
print(n,"is not anamorphic number")

You might also like