DEV Community

Sivakumar Mathiyalagan
Sivakumar Mathiyalagan

Posted on

python-exercises

# smallest four digit prime number


def find_prime(no):
    div = 2
    divisors_count = 0

    while div <= no//2:
        if no % div == 0:
            divisors_count += 1
        div += 1

    return divisors_count == 0

givenNumber = 1000

while givenNumber >= 1000:
    if (find_prime(givenNumber)):
        print("smallest prime number", givenNumber)
        break
![ ](https://dev-to-uploads.s3.amazonaws.com/uploads/articles/8uc0afb1lvycntrath2t.png)
    givenNumber = givenNumber+1
Enter fullscreen mode Exit fullscreen mode


# Write the smallest and the Largest two digit prime number

givenNumber = 100
start = 10

while start < givenNumber:
    if (find_prime(start)):
        print("smallest prime number", start)
        break
    start = start+1

while givenNumber > start:
    if(find_prime(givenNumber)):
        print("largest prime number", givenNumber)
        break
    givenNumber = givenNumber - 1
Enter fullscreen mode Exit fullscreen mode


# I am a two digit prime number and the sum of my digits is 10. I am also one of the factors of 57. Who am I?

def find_prime(no):
    div = 2
    divisors_count = 0

    while div <= no//2:
        if no % div == 0:
            divisors_count += 1
        div += 1

    return divisors_count == 0

start = 10


while start < 100:
    if (find_prime(start)):
        sum =0
        sum = sum + start % 10 + start // 10
        if(sum ==10 and  57 % start == 0):
            print("i am that two digit number",start)
            break
    start = start+1

Enter fullscreen mode Exit fullscreen mode

Top comments (0)