Day 14 – Looping

04811

1.Find the number is prime or not
A prime number is only divisible by 1 and the number itself. 

no = int(input("Enter no. "))
div = 2
while div<no:
    if no%div == 0:
        print("Not Prime")
        break
    div+=1
else:
    print("Prime")
no = int(input("Enter no. "))
div = 2
while div<no:
    if no%div == 0:
        print("Not Prime")
        break
    div+=1
else:
    print("Prime")
no = int(input("Enter no. "))
div = 2
while div<no:
    if no%div == 0:
        print("Not Prime")
        break
    div+=1
else:
    print("Prime")

Enter fullscreen mode Exit fullscreen mode 

Enter no. 13
Prime
Enter no. 12
Not Prime
Enter no. 13
Prime
Enter no. 12
Not Prime
Enter no. 13
Prime
Enter no. 12
Not Prime

Enter fullscreen mode Exit fullscreen mode

2.Reverse a number
A reverse number refers to the number obtained by reversing the digits of a given number. 

def reverse_a_no(no):
    reverse = 0
    while no>0:
        rem = no%10
        reverse = (reverse*10) + rem
        no//=10 #no=no//10
    return reverse
no=int(input("Enter the number:"))
reversed_no = reverse_a_no(no)
print("Reverse Number:",reversed_no)
def reverse_a_no(no):
    reverse = 0
    while no>0:
        rem = no%10
        reverse = (reverse*10) + rem
        no//=10 #no=no//10
    return reverse

no=int(input("Enter the number:"))
reversed_no = reverse_a_no(no)
print("Reverse Number:",reversed_no)
def reverse_a_no(no):
    reverse = 0
    while no>0:
        rem = no%10
        reverse = (reverse*10) + rem
        no//=10 #no=no//10
    return reverse

no=int(input("Enter the number:"))
reversed_no = reverse_a_no(no)
print("Reverse Number:",reversed_no)

Enter fullscreen mode Exit fullscreen mode 

Enter the number:345
Reverse Number: 543
Enter the number:345
Reverse Number: 543
Enter the number:345
Reverse Number: 543

Enter fullscreen mode Exit fullscreen mode

3.Check the reversed number is prime or not
To check if the reverse of a given number is prime, we need to:
Reverse the number.
Check if the reversed number is prime. 

def reverse_a_no(no):
    reverse = 0
    while no>0:
        rem = no%10
        reverse = (reverse*10) + rem
        no//=10 #no=no//10
    return reverse
no = int(input("Enter no. ")) 
reversed_no = reverse_a_no(no) #31 71
print(reversed_no)
def find_prime(no):
    div = 2
    while div<no: 
        if no%div == 0:
            return False
            break
        div+=1 #3
    else:
        return True
result1 = find_prime(no)
print(result1)
result2 = find_prime(reversed_no)
print(result2)
if result1 == result2:
    print("EMIRP number")
else:
    print("not EMIRP number")
def reverse_a_no(no):
    reverse = 0
    while no>0:
        rem = no%10
        reverse = (reverse*10) + rem
        no//=10 #no=no//10
    return reverse

no = int(input("Enter no. ")) 
reversed_no = reverse_a_no(no) #31 71
print(reversed_no)
def find_prime(no):
    div = 2
    while div<no: 
        if no%div == 0:
            return False
            break
        div+=1 #3
    else:
        return True

result1 = find_prime(no)
print(result1)
result2 = find_prime(reversed_no)
print(result2)

if result1 == result2:
    print("EMIRP number")
else:
    print("not EMIRP number")
def reverse_a_no(no):
    reverse = 0
    while no>0:
        rem = no%10
        reverse = (reverse*10) + rem
        no//=10 #no=no//10
    return reverse

no = int(input("Enter no. ")) 
reversed_no = reverse_a_no(no) #31 71
print(reversed_no)
def find_prime(no):
    div = 2
    while div<no: 
        if no%div == 0:
            return False
            break
        div+=1 #3
    else:
        return True

result1 = find_prime(no)
print(result1)
result2 = find_prime(reversed_no)
print(result2)

if result1 == result2:
    print("EMIRP number")
else:
    print("not EMIRP number")

Enter fullscreen mode Exit fullscreen mode 

Enter no. 13
31
True
True
EMIRP number
Enter no. 23
32
True
False
not EMIRP number
Enter no. 13
31
True
True
EMIRP number
Enter no. 23
32
True
False
not EMIRP number
Enter no. 13
31
True
True
EMIRP number
Enter no. 23
32
True
False
not EMIRP number

Enter fullscreen mode Exit fullscreen mode

4.Find a Perfect Number:
A number is considered perfect if the sum of its divisors (excluding the number itself) equals the number. 

def find_perfect(no):
    total = 0
    div = 1
    while div<no:
        if no%div==0:
            total = total + div
        div+=1
    else:
        if total == no:
            return True
        else:
            return False
no = int(input("Enter no. "))
result = find_perfect(no)
if result == True:
    print("Perfect Number")
else:
    print("Not Perfect Number")
def find_perfect(no):
    total = 0
    div = 1
    while div<no:
        if no%div==0:
            total = total + div
        div+=1
    else:
        if total == no:
            return True
        else:
            return False


no = int(input("Enter no. "))
result = find_perfect(no)
if result == True:
    print("Perfect Number")
else:
    print("Not Perfect Number")
def find_perfect(no):
    total = 0
    div = 1
    while div<no:
        if no%div==0:
            total = total + div
        div+=1
    else:
        if total == no:
            return True
        else:
            return False


no = int(input("Enter no. "))
result = find_perfect(no)
if result == True:
    print("Perfect Number")
else:
    print("Not Perfect Number")

Enter fullscreen mode Exit fullscreen mode 

Enter no. 6
Perfect Number
Enter no. 7
Not Perfect Number
Enter no. 6
Perfect Number
Enter no. 7
Not Perfect Number
Enter no. 6
Perfect Number
Enter no. 7
Not Perfect Number

Enter fullscreen mode Exit fullscreen mode

5.Find square of an input number and sum of digits of that square root number 

def square(no):
    return no**2
no=int(input("Enter the number:"))
result=square(no)
def sum_of_digits(num):
        sum=0
        while num>0:
            sum=sum+num%10
            num=num//10
        return sum
if result<10:
    print("sum_of_digits:",result)
else:
    final_result=sum_of_digits(result)
    if final_result<10:
        print("sum_of_digits:",final_result) 
    else:
        final_result=sum_of_digits(final_result)
        print("sum_of_digits:",final_result)
def square(no):
    return no**2

no=int(input("Enter the number:"))
result=square(no)

def sum_of_digits(num):
        sum=0
        while num>0:
            sum=sum+num%10
            num=num//10
        return sum

if result<10:
    print("sum_of_digits:",result)
else:
    final_result=sum_of_digits(result)
    if final_result<10:
        print("sum_of_digits:",final_result) 
    else:
        final_result=sum_of_digits(final_result)
        print("sum_of_digits:",final_result)
def square(no):
    return no**2

no=int(input("Enter the number:"))
result=square(no)

def sum_of_digits(num):
        sum=0
        while num>0:
            sum=sum+num%10
            num=num//10
        return sum

if result<10:
    print("sum_of_digits:",result)
else:
    final_result=sum_of_digits(result)
    if final_result<10:
        print("sum_of_digits:",final_result) 
    else:
        final_result=sum_of_digits(final_result)
        print("sum_of_digits:",final_result)

Enter fullscreen mode Exit fullscreen mode 

Enter the number:7
sum_of_digits: 4
Enter the number:5 
sum_of_digits: 7
Enter the number:7
sum_of_digits: 4
Enter the number:5 
sum_of_digits: 7
Enter the number:7
sum_of_digits: 4
Enter the number:5 
sum_of_digits: 7

Enter fullscreen mode Exit fullscreen mode

6.Harshad number:
The sum of the digits of a number and divide the number by that sum, the result is an integer. 

def sum_of_digits(num):
        sum=0
        while num>0:
            sum=sum+num%10
            num=num//10
        return sum
no = int(input("Enter no. "))
result = sum_of_digits(no)
if no%result==0:
    print("Harshad Number")
else:
    print("Not Harshad Number")
def sum_of_digits(num):
        sum=0
        while num>0:
            sum=sum+num%10
            num=num//10
        return sum

no = int(input("Enter no. "))
result = sum_of_digits(no)
if no%result==0:
    print("Harshad Number")
else:
    print("Not Harshad Number")
def sum_of_digits(num):
        sum=0
        while num>0:
            sum=sum+num%10
            num=num//10
        return sum

no = int(input("Enter no. "))
result = sum_of_digits(no)
if no%result==0:
    print("Harshad Number")
else:
    print("Not Harshad Number")

Enter fullscreen mode Exit fullscreen mode 

Enter no. 12
Harshad Number
Enter no. 13
Not Harshad Number
Enter no. 12
Harshad Number
Enter no. 13
Not Harshad Number
Enter no. 12
Harshad Number
Enter no. 13
Not Harshad Number

Enter fullscreen mode Exit fullscreen mode

7.Automorphic number
Check if a number’s square ends with the same number. 

def find_square(no):
    return no**2
no=int(input("Enter the number:"))
result=find_square(no)
def find_automorphic(result):
    rem=result%10
    return rem
rem=find_automorphic(result)
if no==rem:
    print("Automorphic number")
else:
    print("Not Automorphic number")   
def find_square(no):
    return no**2
no=int(input("Enter the number:"))
result=find_square(no)

def find_automorphic(result):
    rem=result%10
    return rem
rem=find_automorphic(result)

if no==rem:
    print("Automorphic number")
else:
    print("Not Automorphic number")   
def find_square(no):
    return no**2
no=int(input("Enter the number:"))
result=find_square(no)

def find_automorphic(result):
    rem=result%10
    return rem
rem=find_automorphic(result)

if no==rem:
    print("Automorphic number")
else:
    print("Not Automorphic number")

Enter fullscreen mode Exit fullscreen mode 

Enter the number:5
Automorphic number
Enter the number:7
Not Automorphic number
Enter the number:5
Automorphic number
Enter the number:7
Not Automorphic number
Enter the number:5
Automorphic number
Enter the number:7
Not Automorphic number

Enter fullscreen mode Exit fullscreen mode

8.Find a fibonacci series:
Generate the Fibonacci sequence up to a given number. 

def find_fibonacci(num):
    no1=0
    no2=1
    sum=0
    while sum<=num:
        print(sum, end=" ")
        no1 = no2
        no2 = sum 
        sum = no1 + no2
num=int(input("Enter the number: ")) 
result=find_fibonacci(num)      
def find_fibonacci(num):
    no1=0
    no2=1
    sum=0
    while sum<=num:
        print(sum, end=" ")
        no1 = no2
        no2 = sum 
        sum = no1 + no2

num=int(input("Enter the number: ")) 
result=find_fibonacci(num)      
def find_fibonacci(num):
    no1=0
    no2=1
    sum=0
    while sum<=num:
        print(sum, end=" ")
        no1 = no2
        no2 = sum 
        sum = no1 + no2

num=int(input("Enter the number: ")) 
result=find_fibonacci(num)

Enter fullscreen mode Exit fullscreen mode 

Enter the number: 10
0 1 1 2 3 5 8
Enter the number: 10
0 1 1 2 3 5 8
Enter the number: 10
0 1 1 2 3 5 8

Enter fullscreen mode Exit fullscreen mode

原文链接：Day 14 – Looping

展开阅读全文
© 版权声明
文章版权声明 1、本网站名称：拾光赋
2、本站永久网址：https://www.blogs.ink
3、本网站的文章部分内容可能来源于网络，仅供大家学习与参考，如有侵权，请联系站长QQ：805375623进行删除处理。
4、本站一切资源不代表本站立场，并不代表本站赞同其观点和对其真实性负责。
5、本站一律禁止以任何方式发布或转载任何违法的相关信息，访客发现请向站长举报
6、本站资源大多存储在云盘，如发现链接失效，请联系我们我们会第一时间更新。

THE END
Python（EN）
# python# payilagam# looping# while
喜欢就支持一下吧
点赞11 分享
A good idea without action is worth nothing.
如果没有切实执行，再好的点子也是徒劳
kity的头像-拾光赋
相关推荐
评论 抢沙发

请登录后发表评论

    暂无评论内容

kity的头像-拾光赋
今日剩余 5.7%
本周剩余 43.7%
本月剩余 13.1%
本年剩余 76.5%
最近评论
Vito的头像-拾光赋

Vito5个月前2

你就是我心中的那首忐忑，总是让我惊心动魄
Jason.Meng的头像-拾光赋钻石会员

Jason.Meng徽章-人气大使-拾光赋5个月前2

总是会在人生的不同阶段反复爱上大佬的文章~
每日一言
A good idea without action is worth nothing.
如果没有切实执行，再好的点子也是徒劳