{"id":433133,"date":"2018-10-05T01:03:09","date_gmt":"2018-10-05T01:03:09","guid":{"rendered":"https:\/\/essaypaper.org\/fibonacci-series-and-prime-factorisation\/"},"modified":"2018-10-24T08:53:11","modified_gmt":"2018-10-24T08:53:11","slug":"fibonacci-series-and-prime-factorisation-2","status":"publish","type":"post","link":"https:\/\/www.benedictsol.com\/blogs\/fibonacci-series-and-prime-factorisation-2\/","title":{"rendered":"Fibonacci series and prime factorisation"},"content":{"rendered":"

Fibonacci series and prime factorisation<\/strong>
\nDescription
\nWe have to do this without using recurrence
\nusing only for,if,while, do loop
\nProblem 1: EVEN FIBONACCIS
\nIn mathematics the sequence Fn of Fibonacci numbers is defined by the recurrence relation: Fn = Fn-1 + Fn-2 where F0 = 0 and F1 = 1
\nIn other words, every Fibonacci number is the sum of the previous two Fibonacci numbers with the first two Fibonacci numbers defined as 0 and 1. Here are the first 10 numbers of the Fibonacci sequence.
\n0, 1, 1, 2, 3, 5, 8, 13, 21, 34
\nIn this problem, given an input integer X (from the user) you have to output the sum of all even Fibonacci numbers below X.
\nFor example, if X = 35 then the sum of all even Fibonacci numbers below X is 44.
\nIf X = 34 then the sum of all even Fibonacci numbers below X is 10. Sample input and outputs follow.
\nSample Input and Output 1
\nEnter max limit
\n100
\nThe sum of all even fibonaccis before 100 is: 44
\nSample Input and Output 2
\nEnter max limit
\n34
\nThe sum of all even fibonaccis before 34 is: 10
\nProblem 2: PRIME FACTORS
\nIn this problem, given an input integer X (from the user) you have to output all of its prime factors as well as the minimum and maximum prime factors separately. Sample input and outputs follow.
\nSample Input and Output 1
\nEnter an Integer:
\n78
\nPrime Factorization: 2 x 3 x 13 Minimum: 2, Maximum: 13
\nSample Input and Output 2
\nEnter an Integer:
\n4620
\nPrime Factorization: 2 x 2 x 3 x 5 x 7 x 11 Minimum: 2, Maximum: 11
\nPrime factorization of an integer is breaking the integer down into a set of prime numbers which multiply together to result in the original integer.
\nFor example, the prime factorization of 28 is 2 x 2 x 7. The prime factorization of 321 is 3 x 107.<\/p>\n","protected":false},"excerpt":{"rendered":"

Fibonacci series and prime factorisation Description We have to do this without using recurrence using only for,if,while, do loop Problem 1: EVEN FIBONACCIS In mathematics the sequence Fn of Fibonacci numbers is defined by the recurrence relation: Fn = Fn-1 Read More …<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[15],"tags":[],"class_list":["post-433133","post","type-post","status-publish","format-standard","hentry","category-essay-paper-writing"],"_links":{"self":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/433133","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/comments?post=433133"}],"version-history":[{"count":0,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/433133\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/media?parent=433133"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/categories?post=433133"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/tags?post=433133"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}