{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-05-26T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":1946,"title":"Fibonacci-Sum of Squares","description":"Given the Fibonacci sequence defined by the following recursive relation,\r\n\r\n* F(n) = F(n-1) + F(n-2)\r\n* where F(1) = 1 and F(1) = 1\r\n\r\ndetermine the sum of squares for the first \"n\" terms.\r\n\r\nFor example, n=5 --\u003e 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.\r\n\r\n* INPUT  n=5\r\n* OUTPUT S=40\r\n\r\n","description_html":"\u003cp\u003eGiven the Fibonacci sequence defined by the following recursive relation,\u003c/p\u003e\u003cul\u003e\u003cli\u003eF(n) = F(n-1) + F(n-2)\u003c/li\u003e\u003cli\u003ewhere F(1) = 1 and F(1) = 1\u003c/li\u003e\u003c/ul\u003e\u003cp\u003edetermine the sum of squares for the first \"n\" terms.\u003c/p\u003e\u003cp\u003eFor example, n=5 --\u0026gt; 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.\u003c/p\u003e\u003cul\u003e\u003cli\u003eINPUT  n=5\u003c/li\u003e\u003cli\u003eOUTPUT S=40\u003c/li\u003e\u003c/ul\u003e","function_template":"function S = FibSumSquares(n)\r\n  S = n;\r\nend","test_suite":"%%\r\nn = 5;\r\nS = 40;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 8;\r\nS = 714;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 11;\r\nS = 12816;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 15;\r\nS = 602070;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 21;\r\nS = 193864606;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 26;\r\nS = 23843770274;\r\nassert(isequal(FibSumSquares(n),S))","published":true,"deleted":false,"likes_count":10,"comments_count":4,"created_by":18441,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":1738,"test_suite_updated_at":"2017-05-23T15:39:51.000Z","rescore_all_solutions":false,"group_id":122,"created_at":"2013-10-19T23:17:50.000Z","updated_at":"2026-05-24T23:48:34.000Z","published_at":"2013-10-19T23:37:18.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven the Fibonacci sequence defined by the following recursive relation,\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eF(n) = F(n-1) + F(n-2)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ewhere F(1) = 1 and F(1) = 1\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003edetermine the sum of squares for the first \\\"n\\\" terms.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor example, n=5 --\u0026gt; 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eINPUT n=5\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOUTPUT S=40\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"problems":[{"id":1946,"title":"Fibonacci-Sum of Squares","description":"Given the Fibonacci sequence defined by the following recursive relation,\r\n\r\n* F(n) = F(n-1) + F(n-2)\r\n* where F(1) = 1 and F(1) = 1\r\n\r\ndetermine the sum of squares for the first \"n\" terms.\r\n\r\nFor example, n=5 --\u003e 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.\r\n\r\n* INPUT  n=5\r\n* OUTPUT S=40\r\n\r\n","description_html":"\u003cp\u003eGiven the Fibonacci sequence defined by the following recursive relation,\u003c/p\u003e\u003cul\u003e\u003cli\u003eF(n) = F(n-1) + F(n-2)\u003c/li\u003e\u003cli\u003ewhere F(1) = 1 and F(1) = 1\u003c/li\u003e\u003c/ul\u003e\u003cp\u003edetermine the sum of squares for the first \"n\" terms.\u003c/p\u003e\u003cp\u003eFor example, n=5 --\u0026gt; 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.\u003c/p\u003e\u003cul\u003e\u003cli\u003eINPUT  n=5\u003c/li\u003e\u003cli\u003eOUTPUT S=40\u003c/li\u003e\u003c/ul\u003e","function_template":"function S = FibSumSquares(n)\r\n  S = n;\r\nend","test_suite":"%%\r\nn = 5;\r\nS = 40;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 8;\r\nS = 714;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 11;\r\nS = 12816;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 15;\r\nS = 602070;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 21;\r\nS = 193864606;\r\nassert(isequal(FibSumSquares(n),S))\r\n\r\n%%\r\nn = 26;\r\nS = 23843770274;\r\nassert(isequal(FibSumSquares(n),S))","published":true,"deleted":false,"likes_count":10,"comments_count":4,"created_by":18441,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":1738,"test_suite_updated_at":"2017-05-23T15:39:51.000Z","rescore_all_solutions":false,"group_id":122,"created_at":"2013-10-19T23:17:50.000Z","updated_at":"2026-05-24T23:48:34.000Z","published_at":"2013-10-19T23:37:18.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven the Fibonacci sequence defined by the following recursive relation,\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eF(n) = F(n-1) + F(n-2)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ewhere F(1) = 1 and F(1) = 1\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003edetermine the sum of squares for the first \\\"n\\\" terms.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor example, n=5 --\u0026gt; 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eINPUT n=5\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOUTPUT S=40\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"errors":[],"facets":[[{"value":"All Things Fibonacci","count":1,"selected":false}],[{"value":"medium","count":1,"selected":false}]],"term":"tag:\"sum of squares\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}