{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-05-26T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":44316,"title":"Pandigital Multiples of 11 (based on Project Euler 491)","description":"A \"Pandigital number of order X\" is one that contains all of the numbers from 0 to X, but with no leading zeroes. If X\u003e9, the cycle 0-9 repeats itself. For example, 2310 is a Pandigital number of order 3 (0-3), while 120345678901 is a Pandigital number of order 11, with the \"01\" at the end of the number representing 10 and 11, respectively (10 and 11 mod 10, essentially). 0321 is not a Pandigital number, as it has a leading zero.\r\n\r\nGiven a number X, determine how many pandigital numbers of that order are divisible by 11.  You do not need to return the numbers themselves, just how many of them there are.","description_html":"\u003cp\u003eA \"Pandigital number of order X\" is one that contains all of the numbers from 0 to X, but with no leading zeroes. If X\u0026gt;9, the cycle 0-9 repeats itself. For example, 2310 is a Pandigital number of order 3 (0-3), while 120345678901 is a Pandigital number of order 11, with the \"01\" at the end of the number representing 10 and 11, respectively (10 and 11 mod 10, essentially). 0321 is not a Pandigital number, as it has a leading zero.\u003c/p\u003e\u003cp\u003eGiven a number X, determine how many pandigital numbers of that order are divisible by 11.  You do not need to return the numbers themselves, just how many of them there are.\u003c/p\u003e","function_template":"function y = pandigitalby11(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nx = 2;y_correct = 0;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nx = 3;y_correct = 6;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nx = 7;y_correct = 4032;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\np6=pandigitalby11(6);\r\np8=pandigitalby11(8);\r\np9=pandigitalby11(9);\r\n\r\nassert(p8\u003ep6);\r\nassert(p9\u003ep8);\r\n\r\nf6=factor(p6);\r\nf8=factor(p8);\r\nf9=factor(p9);\r\nf9e1=f9(end-1);\r\n\r\nassert(p6\u003e256);\r\nassert(max(f9)\u003cmax(f8));\r\nassert(f9e1\u003emax(f6));\r\nassert(numel(f9)\u003enumel(f8));\r\n%%\r\nx = 11;y_correct = 9072000;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nx = 14;y_correct = 3216477600;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nassert(isequal(pandigitalby11(16),222911740800))","published":true,"deleted":false,"likes_count":5,"comments_count":15,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":55,"test_suite_updated_at":"2017-10-23T01:32:05.000Z","rescore_all_solutions":false,"group_id":35,"created_at":"2017-09-12T15:26:05.000Z","updated_at":"2026-04-18T11:13:17.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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003eA \\\"Pandigital number of order X\\\" is one that contains all of the numbers from 0 to X, but with no leading zeroes. If X\u0026gt;9, the cycle 0-9 repeats itself. For example, 2310 is a Pandigital number of order 3 (0-3), while 120345678901 is a Pandigital number of order 11, with the \\\"01\\\" at the end of the number representing 10 and 11, respectively (10 and 11 mod 10, essentially). 0321 is not a Pandigital number, as it has a leading zero.\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\u003eGiven a number X, determine how many pandigital numbers of that order are divisible by 11. You do not need to return the numbers themselves, just how many of them there are.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"problems":[{"id":44316,"title":"Pandigital Multiples of 11 (based on Project Euler 491)","description":"A \"Pandigital number of order X\" is one that contains all of the numbers from 0 to X, but with no leading zeroes. If X\u003e9, the cycle 0-9 repeats itself. For example, 2310 is a Pandigital number of order 3 (0-3), while 120345678901 is a Pandigital number of order 11, with the \"01\" at the end of the number representing 10 and 11, respectively (10 and 11 mod 10, essentially). 0321 is not a Pandigital number, as it has a leading zero.\r\n\r\nGiven a number X, determine how many pandigital numbers of that order are divisible by 11.  You do not need to return the numbers themselves, just how many of them there are.","description_html":"\u003cp\u003eA \"Pandigital number of order X\" is one that contains all of the numbers from 0 to X, but with no leading zeroes. If X\u0026gt;9, the cycle 0-9 repeats itself. For example, 2310 is a Pandigital number of order 3 (0-3), while 120345678901 is a Pandigital number of order 11, with the \"01\" at the end of the number representing 10 and 11, respectively (10 and 11 mod 10, essentially). 0321 is not a Pandigital number, as it has a leading zero.\u003c/p\u003e\u003cp\u003eGiven a number X, determine how many pandigital numbers of that order are divisible by 11.  You do not need to return the numbers themselves, just how many of them there are.\u003c/p\u003e","function_template":"function y = pandigitalby11(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nx = 2;y_correct = 0;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nx = 3;y_correct = 6;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nx = 7;y_correct = 4032;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\np6=pandigitalby11(6);\r\np8=pandigitalby11(8);\r\np9=pandigitalby11(9);\r\n\r\nassert(p8\u003ep6);\r\nassert(p9\u003ep8);\r\n\r\nf6=factor(p6);\r\nf8=factor(p8);\r\nf9=factor(p9);\r\nf9e1=f9(end-1);\r\n\r\nassert(p6\u003e256);\r\nassert(max(f9)\u003cmax(f8));\r\nassert(f9e1\u003emax(f6));\r\nassert(numel(f9)\u003enumel(f8));\r\n%%\r\nx = 11;y_correct = 9072000;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nx = 14;y_correct = 3216477600;\r\nassert(isequal(pandigitalby11(x),y_correct))\r\n%%\r\nassert(isequal(pandigitalby11(16),222911740800))","published":true,"deleted":false,"likes_count":5,"comments_count":15,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":55,"test_suite_updated_at":"2017-10-23T01:32:05.000Z","rescore_all_solutions":false,"group_id":35,"created_at":"2017-09-12T15:26:05.000Z","updated_at":"2026-04-18T11:13:17.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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003eA \\\"Pandigital number of order X\\\" is one that contains all of the numbers from 0 to X, but with no leading zeroes. If X\u0026gt;9, the cycle 0-9 repeats itself. For example, 2310 is a Pandigital number of order 3 (0-3), while 120345678901 is a Pandigital number of order 11, with the \\\"01\\\" at the end of the number representing 10 and 11, respectively (10 and 11 mod 10, essentially). 0321 is not a Pandigital number, as it has a leading zero.\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\u003eGiven a number X, determine how many pandigital numbers of that order are divisible by 11. You do not need to return the numbers themselves, just how many of them there are.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"errors":[],"facets":[[{"value":"Cody5:Hard","count":1,"selected":false},{"value":"Project Euler IV","count":1,"selected":false}],[{"value":"medium","count":1,"selected":false}]],"term":"tag:\"lots of beta testing\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}