{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.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-06T00: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":44065,"title":"Number of even divisors of a given number","description":"Given a Number n, return the number of its even divisors without listing them.\r\n\r\nexample:\r\n\r\nn=14 ; EvenDivisors={2,14} ; y=2\r\n\r\nn=68 ; EvenDivisors={2,34,4,68} ; y=4\r\n\r\nSimilar problems are: \u003chttps://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\u003e \u003chttps://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\u003e\r\n\r\nn=64 ; EvenDivisors={2,4,8,16,32} ; y=5","description_html":"\u003cp\u003eGiven a Number n, return the number of its even divisors without listing them.\u003c/p\u003e\u003cp\u003eexample:\u003c/p\u003e\u003cp\u003en=14 ; EvenDivisors={2,14} ; y=2\u003c/p\u003e\u003cp\u003en=68 ; EvenDivisors={2,34,4,68} ; y=4\u003c/p\u003e\u003cp\u003eSimilar problems are: \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\"\u003ehttps://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\u003c/a\u003e \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\"\u003ehttps://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\u003c/a\u003e\u003c/p\u003e\u003cp\u003en=64 ; EvenDivisors={2,4,8,16,32} ; y=5\u003c/p\u003e","function_template":"function y = countEvenDivisors(x)\r\n  y = 0;\r\nend","test_suite":"1\r\n%%\r\nfiletext = fileread('countEvenDivisors.m');\r\nassert(isempty(strfind(filetext, 'sqrt')))\r\nassert(isempty(strfind(filetext, 'for')))\r\n2\t\r\n%%\r\nn= 6880 * 2;\r\ny_correct = 24;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n3\t\r\n%%\r\nn= 5050 * 2;\r\ny_correct = 12;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n4 \t\r\n%%\r\nn= 76576501;\r\ny_correct = 0;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n5\t\r\n%%\r\nn= 74 * 2;\r\ny_correct = 4;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n6\t\r\n%%\r\nn=14^8 *2 ;\r\ny_correct = 81;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":2,"created_by":115733,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":52,"test_suite_updated_at":"2017-02-13T23:29:19.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2017-02-13T23:22:48.000Z","updated_at":"2026-03-09T08:39:00.000Z","published_at":"2017-02-13T23:29:19.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 a Number n, return the number of its even divisors without listing them.\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\u003eexample:\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\u003en=14 ; EvenDivisors={2,14} ; y=2\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\u003en=68 ; EvenDivisors={2,34,4,68} ; y=4\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\u003eSimilar problems are:\u003c/w:t\u003e\u003c/w:r\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/42791-number-of-divisors-of-a-given-number\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt;\u003c/w:t\u003e\u003c/w:r\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/1025-divisors-of-an-integer\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt;\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\u003en=64 ; EvenDivisors={2,4,8,16,32} ; y=5\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":44071,"title":"Smallest n, for n! to have m trailing zero digits","description":"For given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! to have at least \"m\" trailing zeros, what is the smallest \"n\" ?\r\nExample: factorial(10) = 3628800 factorial(9) = 362880 In order to have 2 trailing zeros on factorial, the smallest n is 10.\r\nOptional: Can you make an efficient algorithm for a very large m?","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; 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: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 102px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 51px; transform-origin: 407px 51px; 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: 378.5px 8px; transform-origin: 378.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! to have at least \"m\" trailing zeros, what is the smallest \"n\" ?\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: 376px 8px; transform-origin: 376px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eExample: factorial(10) = 3628800 factorial(9) = 362880 In order to have 2 trailing zeros on factorial, the smallest n is 10.\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: 205px 8px; transform-origin: 205px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eOptional: Can you make an efficient algorithm for a very large m?\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function n = factorialForZeros(m)\r\n  n = 1000;\r\nend","test_suite":"%%\r\nfiletext = fileread('factorialForZeros.m');\r\nillegal = contains(filetext, 'str2num') || contains(filetext, 'regexp') || ...\r\n          contains(filetext, 'switch') || contains(filetext, 'elseif'); \r\nassert(~illegal)\r\n\r\n%%\r\nm = 1;\r\nn_correct = 5;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 2;\r\nn_correct = 10;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 6;\r\nn_correct = 25;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 5;\r\nn_correct = 25;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 4;\r\nn_correct = 20;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n \r\n%%\r\nm = 156;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 155;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n \r\n%%\r\nm = 154;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 153;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 152;\r\nn_correct = 620;\r\nassert(isequal(factorialForZeros(m),n_correct))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":115733,"edited_by":223089,"edited_at":"2023-01-07T09:00:18.000Z","deleted_by":null,"deleted_at":null,"solvers_count":61,"test_suite_updated_at":"2023-01-07T09:00:18.000Z","rescore_all_solutions":false,"group_id":673,"created_at":"2017-02-14T01:10:18.000Z","updated_at":"2026-03-20T13:48:37.000Z","published_at":"2017-02-14T01:10:18.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\u003eFor given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! to have at least \\\"m\\\" trailing zeros, what is the smallest \\\"n\\\" ?\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\u003eExample: factorial(10) = 3628800 factorial(9) = 362880 In order to have 2 trailing zeros on factorial, the smallest n is 10.\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\u003eOptional: Can you make an efficient algorithm for a very large m?\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":44065,"title":"Number of even divisors of a given number","description":"Given a Number n, return the number of its even divisors without listing them.\r\n\r\nexample:\r\n\r\nn=14 ; EvenDivisors={2,14} ; y=2\r\n\r\nn=68 ; EvenDivisors={2,34,4,68} ; y=4\r\n\r\nSimilar problems are: \u003chttps://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\u003e \u003chttps://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\u003e\r\n\r\nn=64 ; EvenDivisors={2,4,8,16,32} ; y=5","description_html":"\u003cp\u003eGiven a Number n, return the number of its even divisors without listing them.\u003c/p\u003e\u003cp\u003eexample:\u003c/p\u003e\u003cp\u003en=14 ; EvenDivisors={2,14} ; y=2\u003c/p\u003e\u003cp\u003en=68 ; EvenDivisors={2,34,4,68} ; y=4\u003c/p\u003e\u003cp\u003eSimilar problems are: \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\"\u003ehttps://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\u003c/a\u003e \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\"\u003ehttps://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\u003c/a\u003e\u003c/p\u003e\u003cp\u003en=64 ; EvenDivisors={2,4,8,16,32} ; y=5\u003c/p\u003e","function_template":"function y = countEvenDivisors(x)\r\n  y = 0;\r\nend","test_suite":"1\r\n%%\r\nfiletext = fileread('countEvenDivisors.m');\r\nassert(isempty(strfind(filetext, 'sqrt')))\r\nassert(isempty(strfind(filetext, 'for')))\r\n2\t\r\n%%\r\nn= 6880 * 2;\r\ny_correct = 24;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n3\t\r\n%%\r\nn= 5050 * 2;\r\ny_correct = 12;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n4 \t\r\n%%\r\nn= 76576501;\r\ny_correct = 0;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n5\t\r\n%%\r\nn= 74 * 2;\r\ny_correct = 4;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n6\t\r\n%%\r\nn=14^8 *2 ;\r\ny_correct = 81;\r\nassert(isequal(countEvenDivisors(n),y_correct))\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":2,"created_by":115733,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":52,"test_suite_updated_at":"2017-02-13T23:29:19.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2017-02-13T23:22:48.000Z","updated_at":"2026-03-09T08:39:00.000Z","published_at":"2017-02-13T23:29:19.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 a Number n, return the number of its even divisors without listing them.\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\u003eexample:\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\u003en=14 ; EvenDivisors={2,14} ; y=2\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\u003en=68 ; EvenDivisors={2,34,4,68} ; y=4\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\u003eSimilar problems are:\u003c/w:t\u003e\u003c/w:r\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/42791-number-of-divisors-of-a-given-number\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://www.mathworks.com/matlabcentral/cody/problems/42791-number-of-divisors-of-a-given-number\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt;\u003c/w:t\u003e\u003c/w:r\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/1025-divisors-of-an-integer\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://www.mathworks.com/matlabcentral/cody/problems/1025-divisors-of-an-integer\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt;\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\u003en=64 ; EvenDivisors={2,4,8,16,32} ; y=5\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":44071,"title":"Smallest n, for n! to have m trailing zero digits","description":"For given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! to have at least \"m\" trailing zeros, what is the smallest \"n\" ?\r\nExample: factorial(10) = 3628800 factorial(9) = 362880 In order to have 2 trailing zeros on factorial, the smallest n is 10.\r\nOptional: Can you make an efficient algorithm for a very large m?","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; 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: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 102px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 51px; transform-origin: 407px 51px; 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: 378.5px 8px; transform-origin: 378.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! to have at least \"m\" trailing zeros, what is the smallest \"n\" ?\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: 376px 8px; transform-origin: 376px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eExample: factorial(10) = 3628800 factorial(9) = 362880 In order to have 2 trailing zeros on factorial, the smallest n is 10.\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: 205px 8px; transform-origin: 205px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eOptional: Can you make an efficient algorithm for a very large m?\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function n = factorialForZeros(m)\r\n  n = 1000;\r\nend","test_suite":"%%\r\nfiletext = fileread('factorialForZeros.m');\r\nillegal = contains(filetext, 'str2num') || contains(filetext, 'regexp') || ...\r\n          contains(filetext, 'switch') || contains(filetext, 'elseif'); \r\nassert(~illegal)\r\n\r\n%%\r\nm = 1;\r\nn_correct = 5;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 2;\r\nn_correct = 10;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 6;\r\nn_correct = 25;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 5;\r\nn_correct = 25;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 4;\r\nn_correct = 20;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n \r\n%%\r\nm = 156;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 155;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n \r\n%%\r\nm = 154;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 153;\r\nn_correct = 625;\r\nassert(isequal(factorialForZeros(m),n_correct))\r\n\r\n%%\r\nm = 152;\r\nn_correct = 620;\r\nassert(isequal(factorialForZeros(m),n_correct))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":115733,"edited_by":223089,"edited_at":"2023-01-07T09:00:18.000Z","deleted_by":null,"deleted_at":null,"solvers_count":61,"test_suite_updated_at":"2023-01-07T09:00:18.000Z","rescore_all_solutions":false,"group_id":673,"created_at":"2017-02-14T01:10:18.000Z","updated_at":"2026-03-20T13:48:37.000Z","published_at":"2017-02-14T01:10:18.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\u003eFor given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! to have at least \\\"m\\\" trailing zeros, what is the smallest \\\"n\\\" ?\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\u003eExample: factorial(10) = 3628800 factorial(9) = 362880 In order to have 2 trailing zeros on factorial, the smallest n is 10.\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\u003eOptional: Can you make an efficient algorithm for a very large m?\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:\"factorisation\"","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:\"factorisation\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"factorisation\"","","\"","factorisation","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f6cafb275a0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f6cafb27500\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f6cafb26ba0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f6cafb278c0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f6cafb27780\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f6cafb276e0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f6cafb27640\u003e":"tag:\"factorisation\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f6cafb27640\u003e":"tag:\"factorisation\""},"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:\"factorisation\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"factorisation\"","","\"","factorisation","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f6cafb275a0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f6cafb27500\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f6cafb26ba0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f6cafb278c0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f6cafb27780\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f6cafb276e0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f6cafb27640\u003e":"tag:\"factorisation\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f6cafb27640\u003e":"tag:\"factorisation\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44065,"difficulty_rating":"easy-medium"},{"id":44071,"difficulty_rating":"medium"}]}}