# smallest four digit prime number
deffind_prime(no):div=2divisors_count=0whilediv<=no//2:ifno%div==0:divisors_count+=1div+=1returndivisors_count==0givenNumber=1000whilegivenNumber>=1000:if (find_prime(givenNumber)):print("smallest prime number",givenNumber)breakgivenNumber=givenNumber+1
# Write the smallest and the Largest two digit prime number
givenNumber=100start=10whilestart<givenNumber:if (find_prime(start)):print("smallest prime number",start)breakstart=start+1whilegivenNumber>start:if(find_prime(givenNumber)):print("largest prime number",givenNumber)breakgivenNumber=givenNumber-1
# 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
Top comments (0)
Subscribe
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Top comments (0)