Problem 1946. Fibonacci-Sum of Squares

• Created by Chris Cleveland
• Appears in 3 groups

×

By solving this problem, you will make progress in the following group(s)

Introduction to MATLAB

• 23 Problems
• 8297 Finishers

M3 Challenge Problem Group

• 20 Problems
• 20 Finishers

Programování - Cody

• 12 Problems
• 461 Finishers

Like (10)

Difficulty:

(6717)

Rate

• Solve Later   
• Add To GroupÂ

Given the Fibonacci sequence defined by the following recursive relation,

• F(n) = F(n-1) + F(n-2)
• where F(1) = 1 and F(1) = 1

determine the sum of squares for the first "n" terms.

For example, n=5 --> 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.

• INPUT n=5
• OUTPUT S=40

Solve

Solution Stats

47.03% Correct | 52.97% Incorrect

• 3455 Solutions
• 1485 Solvers

Last Solution submitted on Feb 26, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers1485

Suggested Problems

• Weighted average

  6675 Solvers

• Project Euler: Problem 3, Largest prime factor

  1593 Solvers

• Implement simple rotation cypher

  1083 Solvers

• Array of Ones

  458 Solvers

• Area Conversion 2

  681 Solvers