{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-16T00:12:35.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-04-16T00: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":44311,"title":"Number of Even Elements in Fibonacci Sequence","description":"Find how many even Fibonacci numbers are available in the first d numbers.\r\n\r\nConsider the following first 14 numbers\r\n\r\n  1 1 2 3 5 8 13 21 34 55 89 144 233 377 ...\r\n\r\n4 of them are even. ","description_html":"\u003cp\u003eFind how many even Fibonacci numbers are available in the first d numbers.\u003c/p\u003e\u003cp\u003eConsider the following first 14 numbers\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1 1 2 3 5 8 13 21 34 55 89 144 233 377 ...\r\n\u003c/pre\u003e\u003cp\u003e4 of them are even.\u003c/p\u003e","function_template":"function y = evenFibo(d)\r\n  y = x;\r\nend","test_suite":"%%\r\nd = 14;\r\ny_correct = 4;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 20;\r\ny_correct = 6;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 50;\r\ny_correct = 16;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 100;\r\ny_correct = 33;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 150;\r\ny_correct = 50;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 200;\r\ny_correct = 66;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 500;\r\ny_correct = 166;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 1000;\r\ny_correct = 333;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 1e4;\r\ny_correct = 3333;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 2e4;\r\ny_correct = 6666;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 3e5;\r\ny_correct = 1e5;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 6e6;\r\ny_correct = 2e6;\r\nassert(isequal(evenFibo(d),y_correct))\r\n% \r\n% %%\r\n% d = 9223372036854775807;\r\n% y_correct = 3074457345618258432;\r\n% assert(isequal(evenFibo(d),y_correct))\r\n","published":true,"deleted":false,"likes_count":21,"comments_count":9,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":1661,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":35,"created_at":"2017-09-11T12:36:15.000Z","updated_at":"2026-04-20T21:18:53.000Z","published_at":"2017-10-16T01:50:58.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\u003eFind how many even Fibonacci numbers are available in the first d numbers.\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\u003eConsider the following first 14 numbers\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[1 1 2 3 5 8 13 21 34 55 89 144 233 377 ...]]\u003e\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\u003e4 of them are even.\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\"}]}"},{"id":44310,"title":"Digit concentration in Champernowne's constant","description":"Consider the first 50 digits of Champernowne's constant\r\n \r\n    0.12345678910111213141516171819202122232425262728293...\r\n  \r\nThere are two zeros (do not count the left side of \".\" (integer part) ) in this series. So the digit concentration for 0 for the first 50 digits is = 2 / 50 = 0.04.\r\n\r\nAlso the number of '2' (x) digit is counted as 13. So the digit concentration of number '2' for the first 50 (d) digit is = 13/50 = 0.26\r\n\r\nCalculate the digit concentration of number x for the first d digit of constant.\r\n","description_html":"\u003cp\u003eConsider the first 50 digits of Champernowne's constant\u003c/p\u003e\u003cpre\u003e    0.12345678910111213141516171819202122232425262728293...\u003c/pre\u003e\u003cp\u003eThere are two zeros (do not count the left side of \".\" (integer part) ) in this series. So the digit concentration for 0 for the first 50 digits is = 2 / 50 = 0.04.\u003c/p\u003e\u003cp\u003eAlso the number of '2' (x) digit is counted as 13. So the digit concentration of number '2' for the first 50 (d) digit is = 13/50 = 0.26\u003c/p\u003e\u003cp\u003eCalculate the digit concentration of number x for the first d digit of constant.\u003c/p\u003e","function_template":"function concentration = digitCon(d,x)\r\n  y = x;\r\nend","test_suite":"%%\r\nd = 1;\r\nx = 1;\r\ny_correct = 1;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 10;\r\nx = 5;\r\ny_correct = 0.1000;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 10;\r\nx = 1;\r\ny_correct = 0.2000;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 20;\r\nx = 9;\r\ny_correct = 0.0500;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n\r\n%%\r\nd = 50;\r\nx = 0;\r\ny_correct = 0.0400;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 50;\r\nx = 2;\r\ny_correct = 0.2600;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1000;\r\nx = 9;\r\ny_correct = 0.0670;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e4;\r\nx = 8;\r\ny_correct = 0.0747;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e5;\r\nx = 7;\r\ny_correct = 0.0864;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e6;\r\nx = 6;\r\ny_correct = 0.0935;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e6;\r\nx = 5;\r\ny_correct = 0.0937;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 2e6;\r\nx = 4;\r\ny_correct = 0.0903;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 2000124;\r\nx = 3;\r\ny_correct = 0.1162;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)","published":true,"deleted":false,"likes_count":5,"comments_count":1,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":143,"test_suite_updated_at":"2017-10-25T07:12:47.000Z","rescore_all_solutions":true,"group_id":35,"created_at":"2017-09-11T10:35:46.000Z","updated_at":"2026-04-18T10:53:53.000Z","published_at":"2017-10-16T01:50:58.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\u003eConsider the first 50 digits of Champernowne's constant\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[    0.12345678910111213141516171819202122232425262728293...]]\u003e\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\u003eThere are two zeros (do not count the left side of \\\".\\\" (integer part) ) in this series. So the digit concentration for 0 for the first 50 digits is = 2 / 50 = 0.04.\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\u003eAlso the number of '2' (x) digit is counted as 13. So the digit concentration of number '2' for the first 50 (d) digit is = 13/50 = 0.26\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\u003eCalculate the digit concentration of number x for the first d digit of constant.\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\"}]}"},{"id":54430,"title":"factorial","description":"There are really some cody problems related to factorial of n, e.g., 42667, 45184, 46054, and etc. It is interesting to ask why dont we just write the number n! down and do any kind of analysis later.\r\nSo this problem asks you to write it down as:\r\ninput 3:   write  3!=6\r\ninput 5:  write 5!=120\r\nbut n may be as large as 100 or even more.  Write the result with no spaces.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 162px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 81px; transform-origin: 407px 81px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eThere are really some cody problems related to factorial of n, e.g., \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://www.mathworks.com/matlabcentral/cody/problems/42267-factorial-of-a-number-x\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003e42667\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e, \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://www.mathworks.com/matlabcentral/cody/problems/45184-factorial\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003e45184\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e, \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003e46054\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e, and etc. It is interesting to ask why dont we just write the number n! down and do any kind of analysis later.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eSo this problem asks you to write it down as:\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003einput 3:   write  3!=6\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003einput 5:  write 5!=120\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003ebut n may be as large as 100 or even more.  Write the result with no spaces.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = factorial2(x)\r\n    \r\nend","test_suite":"%%\r\nfiletext = fileread('factorial2.m');\r\nillegal = contains(filetext, 'assignin') || contains(filetext, 'assert') ...\r\n    || contains(filetext, 'java') || contains(filetext, 'py'); \r\nassert(~illegal);\r\nassert(isempty(strfind(filetext, 'regexp')),'regexp() forbidden');\r\n%%\r\nx = 0;\r\ny_correct = '0!=1';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 1;\r\ny_correct = '1!=1';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 4;\r\ny_correct = '4!=24';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 10;\r\ny_correct = '10!=3628800';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 100;\r\ny_correct = '100!=93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 1000;\r\ny_correct = '1000!=402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000';\r\nassert(isequal(factorial2(x),y_correct))\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":2197980,"edited_by":2197980,"edited_at":"2022-05-03T22:58:06.000Z","deleted_by":null,"deleted_at":null,"solvers_count":10,"test_suite_updated_at":"2022-05-03T13:40:27.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2022-05-03T13:38:41.000Z","updated_at":"2022-05-03T22:58:06.000Z","published_at":"2022-05-03T13:38:41.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThere are really some cody problems related to factorial of n, e.g., \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/42267-factorial-of-a-number-x\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e42667\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/45184-factorial\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e45184\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e46054\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, and etc. It is interesting to ask why dont we just write the number n! down and do any kind of analysis later.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eSo this problem asks you to write it down as:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003einput 3:   write  3!=6\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003einput 5:  write 5!=120\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ebut n may be as large as 100 or even more.  Write the result with no spaces.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":44311,"title":"Number of Even Elements in Fibonacci Sequence","description":"Find how many even Fibonacci numbers are available in the first d numbers.\r\n\r\nConsider the following first 14 numbers\r\n\r\n  1 1 2 3 5 8 13 21 34 55 89 144 233 377 ...\r\n\r\n4 of them are even. ","description_html":"\u003cp\u003eFind how many even Fibonacci numbers are available in the first d numbers.\u003c/p\u003e\u003cp\u003eConsider the following first 14 numbers\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1 1 2 3 5 8 13 21 34 55 89 144 233 377 ...\r\n\u003c/pre\u003e\u003cp\u003e4 of them are even.\u003c/p\u003e","function_template":"function y = evenFibo(d)\r\n  y = x;\r\nend","test_suite":"%%\r\nd = 14;\r\ny_correct = 4;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 20;\r\ny_correct = 6;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 50;\r\ny_correct = 16;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 100;\r\ny_correct = 33;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 150;\r\ny_correct = 50;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 200;\r\ny_correct = 66;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 500;\r\ny_correct = 166;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 1000;\r\ny_correct = 333;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 1e4;\r\ny_correct = 3333;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 2e4;\r\ny_correct = 6666;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 3e5;\r\ny_correct = 1e5;\r\nassert(isequal(evenFibo(d),y_correct))\r\n\r\n%%\r\nd = 6e6;\r\ny_correct = 2e6;\r\nassert(isequal(evenFibo(d),y_correct))\r\n% \r\n% %%\r\n% d = 9223372036854775807;\r\n% y_correct = 3074457345618258432;\r\n% assert(isequal(evenFibo(d),y_correct))\r\n","published":true,"deleted":false,"likes_count":21,"comments_count":9,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":1661,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":35,"created_at":"2017-09-11T12:36:15.000Z","updated_at":"2026-04-20T21:18:53.000Z","published_at":"2017-10-16T01:50:58.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\u003eFind how many even Fibonacci numbers are available in the first d numbers.\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\u003eConsider the following first 14 numbers\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[1 1 2 3 5 8 13 21 34 55 89 144 233 377 ...]]\u003e\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\u003e4 of them are even.\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\"}]}"},{"id":44310,"title":"Digit concentration in Champernowne's constant","description":"Consider the first 50 digits of Champernowne's constant\r\n \r\n    0.12345678910111213141516171819202122232425262728293...\r\n  \r\nThere are two zeros (do not count the left side of \".\" (integer part) ) in this series. So the digit concentration for 0 for the first 50 digits is = 2 / 50 = 0.04.\r\n\r\nAlso the number of '2' (x) digit is counted as 13. So the digit concentration of number '2' for the first 50 (d) digit is = 13/50 = 0.26\r\n\r\nCalculate the digit concentration of number x for the first d digit of constant.\r\n","description_html":"\u003cp\u003eConsider the first 50 digits of Champernowne's constant\u003c/p\u003e\u003cpre\u003e    0.12345678910111213141516171819202122232425262728293...\u003c/pre\u003e\u003cp\u003eThere are two zeros (do not count the left side of \".\" (integer part) ) in this series. So the digit concentration for 0 for the first 50 digits is = 2 / 50 = 0.04.\u003c/p\u003e\u003cp\u003eAlso the number of '2' (x) digit is counted as 13. So the digit concentration of number '2' for the first 50 (d) digit is = 13/50 = 0.26\u003c/p\u003e\u003cp\u003eCalculate the digit concentration of number x for the first d digit of constant.\u003c/p\u003e","function_template":"function concentration = digitCon(d,x)\r\n  y = x;\r\nend","test_suite":"%%\r\nd = 1;\r\nx = 1;\r\ny_correct = 1;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 10;\r\nx = 5;\r\ny_correct = 0.1000;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 10;\r\nx = 1;\r\ny_correct = 0.2000;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 20;\r\nx = 9;\r\ny_correct = 0.0500;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n\r\n%%\r\nd = 50;\r\nx = 0;\r\ny_correct = 0.0400;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 50;\r\nx = 2;\r\ny_correct = 0.2600;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1000;\r\nx = 9;\r\ny_correct = 0.0670;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e4;\r\nx = 8;\r\ny_correct = 0.0747;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e5;\r\nx = 7;\r\ny_correct = 0.0864;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e6;\r\nx = 6;\r\ny_correct = 0.0935;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 1e6;\r\nx = 5;\r\ny_correct = 0.0937;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 2e6;\r\nx = 4;\r\ny_correct = 0.0903;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)\r\n\r\n%%\r\nd = 2000124;\r\nx = 3;\r\ny_correct = 0.1162;\r\nassert(abs(digitCon(d,x)-y_correct) \u003c 1e-4)","published":true,"deleted":false,"likes_count":5,"comments_count":1,"created_by":8703,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":143,"test_suite_updated_at":"2017-10-25T07:12:47.000Z","rescore_all_solutions":true,"group_id":35,"created_at":"2017-09-11T10:35:46.000Z","updated_at":"2026-04-18T10:53:53.000Z","published_at":"2017-10-16T01:50:58.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\u003eConsider the first 50 digits of Champernowne's constant\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[    0.12345678910111213141516171819202122232425262728293...]]\u003e\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\u003eThere are two zeros (do not count the left side of \\\".\\\" (integer part) ) in this series. So the digit concentration for 0 for the first 50 digits is = 2 / 50 = 0.04.\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\u003eAlso the number of '2' (x) digit is counted as 13. So the digit concentration of number '2' for the first 50 (d) digit is = 13/50 = 0.26\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\u003eCalculate the digit concentration of number x for the first d digit of constant.\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\"}]}"},{"id":54430,"title":"factorial","description":"There are really some cody problems related to factorial of n, e.g., 42667, 45184, 46054, and etc. It is interesting to ask why dont we just write the number n! down and do any kind of analysis later.\r\nSo this problem asks you to write it down as:\r\ninput 3:   write  3!=6\r\ninput 5:  write 5!=120\r\nbut n may be as large as 100 or even more.  Write the result with no spaces.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 162px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 81px; transform-origin: 407px 81px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eThere are really some cody problems related to factorial of n, e.g., \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://www.mathworks.com/matlabcentral/cody/problems/42267-factorial-of-a-number-x\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003e42667\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e, \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://www.mathworks.com/matlabcentral/cody/problems/45184-factorial\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003e45184\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e, \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003e46054\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003e, and etc. It is interesting to ask why dont we just write the number n! down and do any kind of analysis later.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eSo this problem asks you to write it down as:\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003einput 3:   write  3!=6\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003einput 5:  write 5!=120\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003ebut n may be as large as 100 or even more.  Write the result with no spaces.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = factorial2(x)\r\n    \r\nend","test_suite":"%%\r\nfiletext = fileread('factorial2.m');\r\nillegal = contains(filetext, 'assignin') || contains(filetext, 'assert') ...\r\n    || contains(filetext, 'java') || contains(filetext, 'py'); \r\nassert(~illegal);\r\nassert(isempty(strfind(filetext, 'regexp')),'regexp() forbidden');\r\n%%\r\nx = 0;\r\ny_correct = '0!=1';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 1;\r\ny_correct = '1!=1';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 4;\r\ny_correct = '4!=24';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 10;\r\ny_correct = '10!=3628800';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 100;\r\ny_correct = '100!=93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000';\r\nassert(isequal(factorial2(x),y_correct))\r\n%%\r\nx = 1000;\r\ny_correct = '1000!=402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000';\r\nassert(isequal(factorial2(x),y_correct))\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":2197980,"edited_by":2197980,"edited_at":"2022-05-03T22:58:06.000Z","deleted_by":null,"deleted_at":null,"solvers_count":10,"test_suite_updated_at":"2022-05-03T13:40:27.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2022-05-03T13:38:41.000Z","updated_at":"2022-05-03T22:58:06.000Z","published_at":"2022-05-03T13:38:41.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThere are really some cody problems related to factorial of n, e.g., \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/42267-factorial-of-a-number-x\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e42667\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/45184-factorial\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e45184\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e46054\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, and etc. It is interesting to ask why dont we just write the number n! down and do any kind of analysis later.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eSo this problem asks you to write it down as:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003einput 3:   write  3!=6\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003einput 5:  write 5!=120\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ebut n may be as large as 100 or even more.  Write the result with no spaces.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"term":"tag:\"big number\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"big number\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"big number\"","","\"","big number","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f3034ef8538\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f3034ef8498\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f3034ef7bd8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f3034ef87b8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f3034ef8718\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f3034ef8678\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f3034ef85d8\u003e":"tag:\"big number\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f3034ef85d8\u003e":"tag:\"big number\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"cody-search","password":"78X075ddcV44","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"big number\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"big number\"","","\"","big number","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f3034ef8538\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f3034ef8498\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f3034ef7bd8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f3034ef87b8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f3034ef8718\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f3034ef8678\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f3034ef85d8\u003e":"tag:\"big number\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f3034ef85d8\u003e":"tag:\"big number\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44311,"difficulty_rating":"easy-medium"},{"id":44310,"difficulty_rating":"medium"},{"id":54430,"difficulty_rating":"medium"}]}}