{"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":2721,"title":"Pandigital Factors (Based on Euler 491)","description":"A Pandigital Number is a number containing all of the digits from 0-9 inclusive, with the added stipulation that it does not have a leading zero.  Lower level pandigital numbers just contain the digits 0-X, where X is less than 9.\r\n\r\nWrite a MATLAB script that takes as input the number X, and another integer Y.  Determine how many pandigital numbers containing the digits 0-X are evenly divisible by Y.  For example, there are thirteen pandigital numbers containing 0-4 that are evenly divisible by 7:\r\n\r\n       43120\r\n       42301\r\n       41230\r\n       32410\r\n       31402\r\n       31024\r\n       30142\r\n       23401\r\n       24031\r\n       20314\r\n       14203\r\n       10234\r\n       10423\r\n\r\nThe number 03421 does not count.  Even though it contains all of the digits 0-4, it has a leading zero.  Therefore, the output of pandigit_factors(4,7) would be 13.  You do not need to output all of the numbers themselves, just how many of them there are.  Good luck!","description_html":"\u003cp\u003eA Pandigital Number is a number containing all of the digits from 0-9 inclusive, with the added stipulation that it does not have a leading zero.  Lower level pandigital numbers just contain the digits 0-X, where X is less than 9.\u003c/p\u003e\u003cp\u003eWrite a MATLAB script that takes as input the number X, and another integer Y.  Determine how many pandigital numbers containing the digits 0-X are evenly divisible by Y.  For example, there are thirteen pandigital numbers containing 0-4 that are evenly divisible by 7:\u003c/p\u003e\u003cpre\u003e       43120\r\n       42301\r\n       41230\r\n       32410\r\n       31402\r\n       31024\r\n       30142\r\n       23401\r\n       24031\r\n       20314\r\n       14203\r\n       10234\r\n       10423\u003c/pre\u003e\u003cp\u003eThe number 03421 does not count.  Even though it contains all of the digits 0-4, it has a leading zero.  Therefore, the output of pandigit_factors(4,7) would be 13.  You do not need to output all of the numbers themselves, just how many of them there are.  Good luck!\u003c/p\u003e","function_template":"function pf = pandigit_factors(x,y)\r\n  pf=x*y;\r\nend","test_suite":"%%\r\nx = 4;y=7;\r\ny_correct = 13;\r\nassert(isequal(pandigit_factors(x,y),y_correct));\r\n%%\r\nx = 3;y=3;\r\ny_correct = 18;\r\nassert(isequal(pandigit_factors(x,y),y_correct));\r\n%%\r\nx = 8;y=8;\r\ny_correct = 45360;\r\nassert(isequal(pandigit_factors(x,y),y_correct));\r\n%%\r\nj=[600 312 600 144 216 312 75 74 0 120 0 144 55];\r\nx=5;y=ceil(13*rand)\r\nassert(isequal(pandigit_factors(x,y),j(y)));\r\n%%\r\nx=1;y=10;\r\nassert(isequal(pandigit_factors(x,y),x));","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":42,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-12-05T17:20:24.000Z","updated_at":"2026-04-10T14:45:08.000Z","published_at":"2014-12-05T17:20:24.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\u003eA Pandigital Number is a number containing all of the digits from 0-9 inclusive, with the added stipulation that it does not have a leading zero. Lower level pandigital numbers just contain the digits 0-X, where X is less than 9.\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\u003eWrite a MATLAB script that takes as input the number X, and another integer Y. Determine how many pandigital numbers containing the digits 0-X are evenly divisible by Y. For example, there are thirteen pandigital numbers containing 0-4 that are evenly divisible by 7:\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[       43120\\n       42301\\n       41230\\n       32410\\n       31402\\n       31024\\n       30142\\n       23401\\n       24031\\n       20314\\n       14203\\n       10234\\n       10423]]\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\u003eThe number 03421 does not count. Even though it contains all of the digits 0-4, it has a leading zero. Therefore, the output of pandigit_factors(4,7) would be 13. You do not need to output all of the numbers themselves, just how many of them there are. Good luck!\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":{"errors":[],"problems":[{"id":2721,"title":"Pandigital Factors (Based on Euler 491)","description":"A Pandigital Number is a number containing all of the digits from 0-9 inclusive, with the added stipulation that it does not have a leading zero.  Lower level pandigital numbers just contain the digits 0-X, where X is less than 9.\r\n\r\nWrite a MATLAB script that takes as input the number X, and another integer Y.  Determine how many pandigital numbers containing the digits 0-X are evenly divisible by Y.  For example, there are thirteen pandigital numbers containing 0-4 that are evenly divisible by 7:\r\n\r\n       43120\r\n       42301\r\n       41230\r\n       32410\r\n       31402\r\n       31024\r\n       30142\r\n       23401\r\n       24031\r\n       20314\r\n       14203\r\n       10234\r\n       10423\r\n\r\nThe number 03421 does not count.  Even though it contains all of the digits 0-4, it has a leading zero.  Therefore, the output of pandigit_factors(4,7) would be 13.  You do not need to output all of the numbers themselves, just how many of them there are.  Good luck!","description_html":"\u003cp\u003eA Pandigital Number is a number containing all of the digits from 0-9 inclusive, with the added stipulation that it does not have a leading zero.  Lower level pandigital numbers just contain the digits 0-X, where X is less than 9.\u003c/p\u003e\u003cp\u003eWrite a MATLAB script that takes as input the number X, and another integer Y.  Determine how many pandigital numbers containing the digits 0-X are evenly divisible by Y.  For example, there are thirteen pandigital numbers containing 0-4 that are evenly divisible by 7:\u003c/p\u003e\u003cpre\u003e       43120\r\n       42301\r\n       41230\r\n       32410\r\n       31402\r\n       31024\r\n       30142\r\n       23401\r\n       24031\r\n       20314\r\n       14203\r\n       10234\r\n       10423\u003c/pre\u003e\u003cp\u003eThe number 03421 does not count.  Even though it contains all of the digits 0-4, it has a leading zero.  Therefore, the output of pandigit_factors(4,7) would be 13.  You do not need to output all of the numbers themselves, just how many of them there are.  Good luck!\u003c/p\u003e","function_template":"function pf = pandigit_factors(x,y)\r\n  pf=x*y;\r\nend","test_suite":"%%\r\nx = 4;y=7;\r\ny_correct = 13;\r\nassert(isequal(pandigit_factors(x,y),y_correct));\r\n%%\r\nx = 3;y=3;\r\ny_correct = 18;\r\nassert(isequal(pandigit_factors(x,y),y_correct));\r\n%%\r\nx = 8;y=8;\r\ny_correct = 45360;\r\nassert(isequal(pandigit_factors(x,y),y_correct));\r\n%%\r\nj=[600 312 600 144 216 312 75 74 0 120 0 144 55];\r\nx=5;y=ceil(13*rand)\r\nassert(isequal(pandigit_factors(x,y),j(y)));\r\n%%\r\nx=1;y=10;\r\nassert(isequal(pandigit_factors(x,y),x));","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":42,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-12-05T17:20:24.000Z","updated_at":"2026-04-10T14:45:08.000Z","published_at":"2014-12-05T17:20:24.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\u003eA Pandigital Number is a number containing all of the digits from 0-9 inclusive, with the added stipulation that it does not have a leading zero. Lower level pandigital numbers just contain the digits 0-X, where X is less than 9.\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\u003eWrite a MATLAB script that takes as input the number X, and another integer Y. Determine how many pandigital numbers containing the digits 0-X are evenly divisible by Y. For example, there are thirteen pandigital numbers containing 0-4 that are evenly divisible by 7:\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[       43120\\n       42301\\n       41230\\n       32410\\n       31402\\n       31024\\n       30142\\n       23401\\n       24031\\n       20314\\n       14203\\n       10234\\n       10423]]\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\u003eThe number 03421 does not count. Even though it contains all of the digits 0-4, it has a leading zero. Therefore, the output of pandigit_factors(4,7) would be 13. You do not need to output all of the numbers themselves, just how many of them there are. Good luck!\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\"}]}"}],"term":"group:\"Magic Numbers III\" difficulty_rating_bin:medium group:\"Project Euler IV\"","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":"group:\"Magic Numbers III\" difficulty_rating_bin:medium group:\"Project Euler IV\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"group":[["group:\"Magic Numbers III\"","","\"","Magic Numbers III","\""],["group:\"Project Euler IV\"","","\"","Project Euler IV","\""]],"difficulty_rating_bin":[["difficulty_rating_bin:medium","","","medium",""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2bd8\u003e":["Magic Numbers III","Project Euler IV"],"#\u003cMathWorks::Search::Field:0x00007fd6372d2b38\u003e":["medium"]},"filters":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2098\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2e58\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fd6372d2db8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fd6372d2d18\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fd6372d2c78\u003e":"group:\"Magic Numbers III\" difficulty_rating_bin:medium group:\"Project Euler IV\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2c78\u003e":"group:\"Magic Numbers III\" difficulty_rating_bin:medium group:\"Project Euler IV\""},"queried_facets":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2bd8\u003e":["Magic Numbers III","Project Euler IV"],"#\u003cMathWorks::Search::Field:0x00007fd6372d2b38\u003e":["medium"]}},"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":"group:\"Magic Numbers III\" difficulty_rating_bin:medium group:\"Project Euler IV\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"group":[["group:\"Magic Numbers III\"","","\"","Magic Numbers III","\""],["group:\"Project Euler IV\"","","\"","Project Euler IV","\""]],"difficulty_rating_bin":[["difficulty_rating_bin:medium","","","medium",""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2bd8\u003e":["Magic Numbers III","Project Euler IV"],"#\u003cMathWorks::Search::Field:0x00007fd6372d2b38\u003e":["medium"]},"filters":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2098\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2e58\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fd6372d2db8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fd6372d2d18\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fd6372d2c78\u003e":"group:\"Magic Numbers III\" difficulty_rating_bin:medium group:\"Project Euler IV\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2c78\u003e":"group:\"Magic Numbers III\" difficulty_rating_bin:medium group:\"Project Euler IV\""},"queried_facets":{"#\u003cMathWorks::Search::Field:0x00007fd6372d2bd8\u003e":["Magic Numbers III","Project Euler IV"],"#\u003cMathWorks::Search::Field:0x00007fd6372d2b38\u003e":["medium"]}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":2721,"difficulty_rating":"easy-medium"}]}}