1.1.3. Write a Program to find the Sum of all the Prime numbers of Fibonacci series of n numbers 12:19 Write a program to find the sum of all the prime numbers of fibonacci series of n numbers, where n is taken from the input. Each new term in the fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 At the time of execution, the program should print the message on the console as: Enter an integer value: For example, if the user gives the input as: Enter an integer value: 10 then the program should print the result as: Fibonacci numbers: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34] The prime numbers of fibonacci series: [2, 3, 5, 13] The sum of the prime numbers: 23
Question
1.1.3. Write a Program to find the Sum of all the Prime numbers of Fibonacci series of n numbers 12:19
Write a program to find the sum of all the prime numbers of fibonacci series of n numbers, where n is taken from the input.
Each new term in the fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 At the time of execution, the program should print the message on the console as: Enter an integer value: For example, if the user gives the input as: Enter an integer value: 10 then the program should print the result as: Fibonacci numbers: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34] The prime numbers of fibonacci series: [2, 3, 5, 13] The sum of the prime numbers: 23
Solution
Here is a Python program that accomplishes the task:
def fibonacci(n):
fib_series = [0, 1]
while len(fib_series) < n:
fib_series.append(fib_series[-1] + fib_series[-2])
return fib_series
def is_prime(num):
if num < 2:
return False
for i in range(2, num):
if num % i == 0:
return False
return True
def sum_of_prime_numbers(numbers):
prime_numbers = [num for num in numbers if is_prime(num)]
return sum(prime_numbers), prime_numbers
n = int(input("Enter an integer value: "))
fib_series = fibonacci(n)
sum_of_primes, primes = sum_of_prime_numbers(fib_series)
print("Fibonacci numbers:", fib_series)
print("The prime numbers of fibonacci series:", primes)
print("The sum of the prime numbers:", sum_of_primes)
This program first generates the Fibonacci series up to the nth number using the fibonacci function. Then it checks each number in the series to see if it's a prime number using the is_prime function. If it is, it's added to the prime_numbers list. Finally, it calculates the sum of all the prime numbers in the Fibonacci series using the sum_of_prime_numbers function.
Similar Questions
Problem StatementCreate a program that generates and prints the Fibonacci series up to a specified number 'N'. The Fibonacci series is a sequence of numbers in which each number is the sum of the two preceding numbers, starting with 0 and 1. Your program should take an integer input 'N' and display the Fibonacci series up to the Nth term using a while loop.Fibonacci series: 0, 1, 1, 2, 3, 5, 8,... Note: This question is one of the most asked questions in placements.Input format :The input consists of a positive integer N.Output format :The output displays the Fibonacci series up to the Nth term separated by space.Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ N ≤ 20The Fibonacci series starts from 0.Sample test cases :Input 1 :7Output 1 :0 1 1 2 3 5 8 Input 2 :1Output 2 :0 Input 3 :20Output 3 :0 1 1 2 3 5 8 13 21 34 55
Problem StatementYou have been given a series that follows a specific pattern. The odd-indexed terms, i.e. the 1st, 3rd, 5th, and so on, form a Fibonacci sequence. The even-indexed terms, i.e. the 2nd, 4th, 6th, and so on, are prime numbers arranged in ascending order. The series begins with the numbers 1, 2, 1, 3, 2, 5, 3, 7, 5, 11, 8, 13, 17, and so on.Your task is to write a program that can find the nth term in this series. The program should use control flow statements to alternately generate Fibonacci and prime numbers, depending on whether the term's index is odd or even.Input format :The input consists of an integer n.Output format :The output prints an integer representing the nth term of the given series.
create a C program to print Fibonacci series upto a specified number N using while loop.
Print Fibonacci numbers till nTake an input n and print Fibonacci numbers till n.Input FormatInteger input nConstraints0=n<=pow(10, 19)Output FormatFibonacci numbers till n.Sample input1Sample output0, 1, 1.ExplanationSample Input 01Sample Output 00, 1, 1.Sample Input 15Sample Output 10, 1, 1, 2, 3, 5.Sample Input 20Sample Output 20.Sample Input 34Sample Output 30, 1, 1, 2, 3.Sample Input 4100Sample Output 40, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89.Note:Your code must be able to print the sample output from the provided sample input. However, your code is run against multiple hidden test cases. Therefore, your code must pass these hidden test cases to solve the problem statement.LimitsTime Limit: 5.0 sec(s) for each input fileMemory Limit: 256 MBSource Limit: 1024 KBScoringScore is assigned if any testcase passes
A Fibonacci sequence is a sequence of numbers (called Fibonacci numbers)in which each number is the sum of the two preceding ones as following:1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, .
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.