Question

How to find the consecutive prime numbers which sum of them equal to N in Python

Answer 1

import math

def isPrime(n) :
    if (n == 0 or n == 1) :
        return False
    
    i = 2
    while (i <= math.sqrt(n)) :
        if (n % i == 0) :
            return False
        i += 1
    
    return True

def findConsecutivePrimeSumEqualTo(n) :
    sum = 0
    i = 2
    
    while (i < n) :
        if (isPrime(i)) :
            print(str(i) + " ", end ="")
            sum += i
            if (sum == n) :
                break
            if (sum > n) :
                print("Not Found")
                break
        i += 1
        
findConsecutivePrimeSumEqualTo(41)




'''
run:

2 3 5 7 11 13 

'''

 

70+ SQL courses for beginners and professionals