{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2025-12-14T01:33:56.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":"2025-12-14T00: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":2319,"title":"Pandigital number n°1 (Inspired by Project Euler 32)","description":"A little warm-up to begin...\r\n\r\nAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\r\n\r\nFor example, the 5-digit number 15234, is 1 through 5 pandigital.\r\n\r\nGiven a positive integer find whether it is a pandigital number.\r\n\r\n","description_html":"\u003cp\u003eA little warm-up to begin...\u003c/p\u003e\u003cp\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\u003c/p\u003e\u003cp\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\u003c/p\u003e\u003cp\u003eGiven a positive integer find whether it is a pandigital number.\u003c/p\u003e","function_template":"function flag = is_pandigital(x)\r\nflag=2;\r\nend","test_suite":"%%\r\nx = 1;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 0;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 100;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 123;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 1203;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 5432;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 54321;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 2361457879;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 1234567809;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 987654321;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":5390,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":114,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-13T22:49:33.000Z","updated_at":"2026-03-09T20:20:18.000Z","published_at":"2014-05-13T22:55:20.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 little warm-up to begin...\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\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\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\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\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 positive integer find whether it is a pandigital number.\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":1084,"title":"Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)","description":"Given a number _n_, return the terminal value of the number chain formed by summing the square of the digits. According to the Project Euler problem, this number chain always terminates with either 1 or 89.\r\n\r\nProject Euler Problem 92: \u003chttp://projecteuler.net/problem=92 Link\u003e","description_html":"\u003cp\u003eGiven a number \u003ci\u003en\u003c/i\u003e, return the terminal value of the number chain formed by summing the square of the digits. According to the Project Euler problem, this number chain always terminates with either 1 or 89.\u003c/p\u003e\u003cp\u003eProject Euler Problem 92: \u003ca href=\"http://projecteuler.net/problem=92\"\u003eLink\u003c/a\u003e\u003c/p\u003e","function_template":"function y = digits_squared_chain(x)\r\n  y = 1;\r\nend","test_suite":"%%\r\nassert(digits_squared_chain(649) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(79) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(608) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(487) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(739) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(565) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(68) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(383) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(379) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(203) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(632) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(391) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(863) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(13) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(100) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(236) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(293) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(230) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(31) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(806) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(623) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(7) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(13) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(836) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(954) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(567) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(388) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(789) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(246) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(787) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(311) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(856) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(143) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(873) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(215) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(995) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(455) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(948) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(875) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(788) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(722) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(250) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(227) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(640) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(835) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(965) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(726) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(689) == 89)\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":3,"created_by":134,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":256,"test_suite_updated_at":"2012-12-05T06:42:14.000Z","rescore_all_solutions":false,"group_id":27,"created_at":"2012-12-03T06:49:33.000Z","updated_at":"2026-03-26T09:05:10.000Z","published_at":"2012-12-05T06:42:14.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\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, return the terminal value of the number chain formed by summing the square of the digits. According to the Project Euler problem, this number chain always terminates with either 1 or 89.\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\u003eProject Euler Problem 92:\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=\\\"http://projecteuler.net/problem=92\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLink\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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":1106,"title":"I've got the power! (Inspired by Project Euler problem 29)","description":"Consider all integer combinations of a^b and b^a for the integer values 2 ≤ a ≤ 4 and 2 ≤ b ≤ 5:\r\n\r\n    2^2=4,  2^3=8,   2^4=16,  2^5=32\r\n    3^2=9,  3^3=27,  3^4=81,  3^5=243\r\n    4^2=16, 4^3=64,  4^4=256, 4^5=1024\r\n    5^2=25, 5^3=125, 5^4=625\r\n\r\nIf they are then placed in numerical order, with any repeats removed, we get the following sequence of 14 distinct terms:\r\n\r\n4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024\r\n\r\nGiven two values for x and y, find the unique, sorted sequence given by the values a^b and b^a for 2≤a≤x and 2≤b≤y.","description_html":"\u003cp\u003eConsider all integer combinations of a^b and b^a for the integer values 2 ≤ a ≤ 4 and 2 ≤ b ≤ 5:\u003c/p\u003e\u003cpre\u003e    2^2=4,  2^3=8,   2^4=16,  2^5=32\r\n    3^2=9,  3^3=27,  3^4=81,  3^5=243\r\n    4^2=16, 4^3=64,  4^4=256, 4^5=1024\r\n    5^2=25, 5^3=125, 5^4=625\u003c/pre\u003e\u003cp\u003eIf they are then placed in numerical order, with any repeats removed, we get the following sequence of 14 distinct terms:\u003c/p\u003e\u003cp\u003e4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024\u003c/p\u003e\u003cp\u003eGiven two values for x and y, find the unique, sorted sequence given by the values a^b and b^a for 2≤a≤x and 2≤b≤y.\u003c/p\u003e","function_template":"function z = euler029(x,y)\r\n  z = x+y;\r\nend","test_suite":"%%\r\nassert(isequal(euler029(5,5),[4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125]));\r\n%%\r\nassert(isequal(euler029(4,15),[4\t8\t9\t16\t25\t27\t32\t36\t49\t64\t81\t100\t121\t125\t128\t144\t169\t196\t216\t225\t243\t256\t343\t512\t625\t729\t1000\t1024\t1296\t1331\t1728\t2048\t2187\t2197\t2401\t2744\t3375\t4096\t6561\t8192\t10000\t14641\t16384\t19683\t20736\t28561\t32768\t38416\t50625\t59049\t65536\t177147\t262144\t531441\t1048576\t1594323\t4194304\t4782969\t14348907\t16777216\t67108864\t268435456\t1073741824]));\r\n%%\r\nassert(isequal(euler029(10,10),[4,8,9,16,25,27,32,36,49,64,81,100,125,128,216,243,256,343,512,625,729,1000,1024,1296,2187,2401,3125,4096,6561,7776,10000,15625,16384,16807,19683,32768,46656,59049,65536,78125,100000,117649,262144,279936,390625,531441,823543,1000000,1048576,1679616,1953125,2097152,4782969,5764801,9765625,10000000,10077696,16777216,40353607,43046721,60466176,100000000,134217728,282475249,387420489,1000000000,1073741824,3486784401,10000000000]));\r\n%%\r\na=ceil(rand*80)+2\r\nb=ceil(rand*80)+2\r\nassert(isequal(euler029(a,b),euler029(b,a)))\r\n%%\r\nassert(isequal(euler029(30,2),[4,8,9,16,25,32,36,49,64,81,100,121,128,144,169,196,225,256,289,324,361,400,441,484,512,529,576,625,676,729,784,841,900,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216,33554432,67108864,134217728,268435456,536870912,1073741824]))","published":true,"deleted":false,"likes_count":2,"comments_count":3,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":143,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-07T17:27:47.000Z","updated_at":"2026-03-09T19:34:22.000Z","published_at":"2012-12-07T17:27:47.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 all integer combinations of a^b and b^a for the integer values 2 ≤ a ≤ 4 and 2 ≤ b ≤ 5:\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[    2^2=4,  2^3=8,   2^4=16,  2^5=32\\n    3^2=9,  3^3=27,  3^4=81,  3^5=243\\n    4^2=16, 4^3=64,  4^4=256, 4^5=1024\\n    5^2=25, 5^3=125, 5^4=625]]\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\u003eIf they are then placed in numerical order, with any repeats removed, we get the following sequence of 14 distinct terms:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024\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\u003eGiven two values for x and y, find the unique, sorted sequence given by the values a^b and b^a for 2≤a≤x and 2≤b≤y.\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":2320,"title":"Pandigital number n°2 (Inspired by Project Euler 32)","description":"After Problem 2319.\r\nAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\r\nFor example, the 5-digit number 15234, is 1 through 5 pandigital.\r\nFind the number of pandigital numbers in a given interval [xlower,xupper] (inclusive if it is not explicit enough).\r\nThe test suite is simple here, but how to compute this number with BIG interval (pandigital number length \u003e 7) in Cody time?\r\nFor example, between 58755 and 99899923?","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: 192px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 96px; transform-origin: 407px 96px; vertical-align: baseline; \"\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: 15px 8px; transform-origin: 15px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAfter\u003c/span\u003e\u003c/span\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: 2px 8px; transform-origin: 2px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"/#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eProblem 2319\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: 2px 8px; transform-origin: 2px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e.\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: 257px 8px; transform-origin: 257px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\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: 204.5px 8px; transform-origin: 204.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\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: 343px 8px; transform-origin: 343px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFind the number of pandigital numbers in a given interval [xlower,xupper] (inclusive if it is not explicit enough).\u003c/span\u003e\u003c/span\u003e\u003c/div\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: 370.5px 8px; transform-origin: 370.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe test suite is simple here, but how to compute this number with BIG interval (pandigital number length \u0026gt; 7) in Cody time?\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: 143.5px 8px; transform-origin: 143.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor example, between 58755 and 99899923?\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = pandigital_nb(xlower, xupper)\r\n  y=xupper-xlower;\r\nend","test_suite":"%%\r\nxl = 1;\r\nxu = 10\r\ny_correct = 1;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 10;\r\nxu = 99;\r\ny_correct = 2;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 100;\r\nxu = 999;\r\ny_correct = 6;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 1000;\r\nxu = 9999;\r\ny_correct = 24;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 10000;\r\nxu = 99999;\r\ny_correct = 120;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 1;\r\nxu = 999;\r\ny_correct = 9;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 1;\r\nxu = 9999;\r\ny_correct = 33;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 100000;\r\nxu = 999999;\r\ny_correct = 720;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":5390,"edited_by":223089,"edited_at":"2022-08-09T08:36:16.000Z","deleted_by":null,"deleted_at":null,"solvers_count":68,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-14T08:11:36.000Z","updated_at":"2026-03-10T00:41:57.000Z","published_at":"2014-05-14T08:12:54.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\u003eAfter\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=\\\"\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eProblem 2319\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\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\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\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\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\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\u003eFind the number of pandigital numbers in a given interval [xlower,xupper] (inclusive if it is not explicit enough).\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\u003eThe test suite is simple here, but how to compute this number with BIG interval (pandigital number length \u0026gt; 7) in Cody time?\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\u003eFor example, between 58755 and 99899923?\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\"}]}"},{"id":1082,"title":"Lychrel Number Test (Inspired by Project Euler Problem 55)","description":"The task for this problem is to create a function that takes a number _n_ and tests if it might be a Lychrel number. This is, return |true| if the number satisfies the criteria stated below.\r\n\r\n*From Project Euler:* \u003chttp://projecteuler.net/problem=55 Link\u003e\r\n\r\nIf we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\r\n\r\nNot all numbers produce palindromes so quickly. For example,\r\n\r\n349 + 943 = 1292,\r\n1292 + 2921 = 4213\r\n4213 + 3124 = 7337\r\n\r\nThat is, 349 took three iterations to arrive at a palindrome.\r\n\r\nAlthough no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).\r\n\r\nSurprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.","description_html":"\u003cp\u003eThe task for this problem is to create a function that takes a number \u003ci\u003en\u003c/i\u003e and tests if it might be a Lychrel number. This is, return \u003ctt\u003etrue\u003c/tt\u003e if the number satisfies the criteria stated below.\u003c/p\u003e\u003cp\u003e\u003cb\u003eFrom Project Euler:\u003c/b\u003e \u003ca href=\"http://projecteuler.net/problem=55\"\u003eLink\u003c/a\u003e\u003c/p\u003e\u003cp\u003eIf we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\u003c/p\u003e\u003cp\u003eNot all numbers produce palindromes so quickly. For example,\u003c/p\u003e\u003cp\u003e349 + 943 = 1292,\r\n1292 + 2921 = 4213\r\n4213 + 3124 = 7337\u003c/p\u003e\u003cp\u003eThat is, 349 took three iterations to arrive at a palindrome.\u003c/p\u003e\u003cp\u003eAlthough no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).\u003c/p\u003e\u003cp\u003eSurprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.\u003c/p\u003e","function_template":"function tf = islychrel(n)\r\n  tf = false;\r\nend","test_suite":"%%\r\nassert(islychrel(3763));\r\n\r\n%%\r\nassert(islychrel(5943));\r\n\r\n%%\r\nassert(islychrel(4709));\r\n\r\n%%\r\nassert(~islychrel(3664));\r\n\r\n%%\r\nassert(~islychrel(3692));\r\n\r\n%%\r\nassert(islychrel(196));\r\n\r\n%%\r\nassert(islychrel(8619));\r\n\r\n%%\r\nassert(islychrel(9898));\r\n\r\n%%\r\nassert(islychrel(9344));\r\n\r\n%%\r\nassert(islychrel(9884));\r\n\r\n%%\r\nassert(islychrel(4852));\r\n\r\n%%\r\nassert(islychrel(7491));\r\n\r\n%%\r\nassert(~islychrel(5832));\r\n\r\n%%\r\nassert(~islychrel(7400));\r\n\r\n%%\r\nassert(~islychrel(2349));\r\n\r\n%%\r\nassert(~islychrel(7349));\r\n\r\n%%\r\nassert(~islychrel(9706));\r\n\r\n%%\r\nassert(~islychrel(8669));\r\n\r\n%%\r\nassert(~islychrel(863));\r\n\r\n%%\r\nassert(~islychrel(5979));\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":4,"created_by":134,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":111,"test_suite_updated_at":"2012-12-06T06:32:48.000Z","rescore_all_solutions":false,"group_id":44,"created_at":"2012-12-02T06:02:08.000Z","updated_at":"2026-02-07T16:07:23.000Z","published_at":"2012-12-04T20:00:30.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\u003eThe task for this problem is to create a function that takes a number\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e and tests if it might be a Lychrel number. This is, return\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003etrue\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e if the number satisfies the criteria stated below.\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eFrom Project Euler:\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=\\\"http://projecteuler.net/problem=55\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLink\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eIf we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\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\u003eNot all numbers produce palindromes so quickly. For example,\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\u003e349 + 943 = 1292, 1292 + 2921 = 4213 4213 + 3124 = 7337\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\u003eThat is, 349 took three iterations to arrive at a palindrome.\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\u003eAlthough no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).\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\u003eSurprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.\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":2606,"title":"Decrypt the  cypher using XOR encryption (for beginners)","description":"Inspired by Project Euler n°59\r\n\r\nEach character on a computer is assigned a unique code and the preferred standard is ASCII \r\n(American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, \r\nand lowercase k = 107.\r\nA basic encryption method is to take a text file or a sentence, convert the bytes to ASCII, then XOR each byte with a given \r\nvalue, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the \r\ncipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.\r\n    \r\nYour task has been made easy, as the encryption key consists only of a upper case character (different in every tests). \r\nYou must know that the original text contains common FRENCH words about MATLAB.\r\n\r\nDecrypt the message and find the sum of the ASCII values in the original text.","description_html":"\u003cp\u003eInspired by Project Euler n°59\u003c/p\u003e\u003cp\u003eEach character on a computer is assigned a unique code and the preferred standard is ASCII \r\n(American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, \r\nand lowercase k = 107.\r\nA basic encryption method is to take a text file or a sentence, convert the bytes to ASCII, then XOR each byte with a given \r\nvalue, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the \r\ncipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.\u003c/p\u003e\u003cp\u003eYour task has been made easy, as the encryption key consists only of a upper case character (different in every tests). \r\nYou must know that the original text contains common FRENCH words about MATLAB.\u003c/p\u003e\u003cp\u003eDecrypt the message and find the sum of the ASCII values in the original text.\u003c/p\u003e","function_template":"function y = XOR_cypher(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nx=[15 3 22 14 3 0 236 98 39 49 54 98 55 44 98 46 35 44 37 35 37 39 98 38 39 98 42 35 55 54 98 44 43 52 39 35 55];\r\ny_correct=3360;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[29 40 184 57 63 122 186 122 23 27 14 22 27 24 118 122 44 53 47 41 122 42 53 47 44 63 32 122 59 52 59 54 35 41 63 40 122 62 63 41 122 62 53 52 52 179 63 41 116];\r\ny_correct=4783;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[28 33 41 53 54 43 60 35 117 121 47 48 42 44 56 53 48 42 60 35 121 60 45 121 52 54 61 176 53 48 42 60 35 121 47 54 42 121 61 54 55 55 176 60 42 121 56 47 60 58 121 20 24 13 21 24 27 119];\r\ny_correct=5667;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[11 39 50 42 39 36 124 102 42 35 102 42 39 40 33 39 33 35 102 34 51 102 37 39 42 37 51 42 102 53 37 47 35 40 50 47 55 51 35];\r\ny_correct=3666;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[27 36 62 57 58 62 36 34 107 40 35 36 56 34 57 107 6 42 63 39 42 41 107 46 63 107 59 42 56 107 27 50 63 35 36 37 107 116];\r\ny_correct=3547;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":5390,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":66,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":32,"created_at":"2014-09-27T10:32:11.000Z","updated_at":"2026-03-19T21:22:18.000Z","published_at":"2014-09-27T10:33: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\",\"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\u003eInspired by Project Euler n°59\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\u003eEach character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107. A basic encryption method is to take a text file or a sentence, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the cipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.\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\u003eYour task has been made easy, as the encryption key consists only of a upper case character (different in every tests). You must know that the original text contains common FRENCH words about MATLAB.\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\u003eDecrypt the message and find the sum of the ASCII values in the original text.\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":2323,"title":"Pandigital number n°3 (Inspired by Project Euler 32)","description":"After Problem 2319 and 2320.\r\n\r\nAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE. For example, the 5-digit number 15234, is 1 through 5 pandigital.\r\n\r\nThe product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital ([391867254]).\r\n\r\nFind the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital (n is given in input).\r\n\r\nHINT1: Some products can be obtained in more than one way so be sure to only include it once in your sum.\r\n\r\nHINT2: All in good time...  \r\n\r\n","description_html":"\u003cp\u003eAfter Problem 2319 and 2320.\u003c/p\u003e\u003cp\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE. For example, the 5-digit number 15234, is 1 through 5 pandigital.\u003c/p\u003e\u003cp\u003eThe product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital ([391867254]).\u003c/p\u003e\u003cp\u003eFind the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital (n is given in input).\u003c/p\u003e\u003cp\u003eHINT1: Some products can be obtained in more than one way so be sure to only include it once in your sum.\u003c/p\u003e\u003cp\u003eHINT2: All in good time...\u003c/p\u003e","function_template":"function y = pandigital_sum(n)\r\n  y = x;\r\nend","test_suite":"%%\r\nx = 3;\r\ny_correct = [];\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 4;\r\ny_correct = 12;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 5;\r\ny_correct = 52;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 6;\r\ny_correct = 162;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 7;\r\ny_correct = []; % Strange no ?\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n\r\n%%\r\nx = 8;\r\ny_correct = 13458;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n\r\n\r\n%% You obtain the Project Euler n°32 solution with n=9\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":3,"created_by":5390,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":43,"test_suite_updated_at":"2019-10-23T23:21:29.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-15T10:08:43.000Z","updated_at":"2025-12-19T11:41:31.000Z","published_at":"2014-05-15T10:20:54.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\u003eAfter Problem 2319 and 2320.\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\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE. For example, the 5-digit number 15234, is 1 through 5 pandigital.\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\u003eThe product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital ([391867254]).\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\u003eFind the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital (n is given in input).\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\u003eHINT1: Some products can be obtained in more than one way so be sure to only include it once in your sum.\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\u003eHINT2: All in good time...\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":1095,"title":"Circular Primes (based on Project Euler, problem 35)","description":"The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.\r\n\r\nThere are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.\r\n\r\nGiven a number x, write a MATLAB script that will tell you the number of circular primes less than or equal to x as well as a sorted list of what the circular prime numbers are.","description_html":"\u003cp\u003eThe number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.\u003c/p\u003e\u003cp\u003eThere are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.\u003c/p\u003e\u003cp\u003eGiven a number x, write a MATLAB script that will tell you the number of circular primes less than or equal to x as well as a sorted list of what the circular prime numbers are.\u003c/p\u003e","function_template":"function [how_many what_numbers]=circular_prime(x)\r\n    how_many=3;\r\n    what_numbers=[2 3 5];\r\nend","test_suite":"%%\r\n[y numbers]=circular_prime(197)\r\nassert(isequal(y,16)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197]))\r\n%%\r\n[y numbers]=circular_prime(100)\r\nassert(isequal(y,13)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97]))\r\n%%\r\n[y numbers]=circular_prime(250)\r\nassert(isequal(y,17)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199]))\r\n%%\r\n[y numbers]=circular_prime(2000)\r\nassert(isequal(y,27)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931]))\r\n%%\r\n[y numbers]=circular_prime(10000)\r\nassert(isequal(y,33)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931 3119 3779 7793 7937 9311 9377]))\r\n%%\r\n[y numbers]=circular_prime(54321)\r\nassert(isequal(y,38)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931 3119 3779 7793 7937 9311 9377 11939 19391 19937 37199 39119]))\r\n","published":true,"deleted":false,"likes_count":10,"comments_count":6,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":651,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-05T18:02:09.000Z","updated_at":"2026-02-15T10:48:53.000Z","published_at":"2012-12-05T18:02:09.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\u003eThe number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.\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\u003eThere are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.\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, write a MATLAB script that will tell you the number of circular primes less than or equal to x as well as a sorted list of what the circular prime numbers 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":{"errors":[],"problems":[{"id":2319,"title":"Pandigital number n°1 (Inspired by Project Euler 32)","description":"A little warm-up to begin...\r\n\r\nAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\r\n\r\nFor example, the 5-digit number 15234, is 1 through 5 pandigital.\r\n\r\nGiven a positive integer find whether it is a pandigital number.\r\n\r\n","description_html":"\u003cp\u003eA little warm-up to begin...\u003c/p\u003e\u003cp\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\u003c/p\u003e\u003cp\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\u003c/p\u003e\u003cp\u003eGiven a positive integer find whether it is a pandigital number.\u003c/p\u003e","function_template":"function flag = is_pandigital(x)\r\nflag=2;\r\nend","test_suite":"%%\r\nx = 1;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 0;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 100;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 123;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 1203;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 5432;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 54321;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 2361457879;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 1234567809;\r\ny_correct = false;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n%%\r\nx = 987654321;\r\ny_correct = true;\r\nassert(isequal(is_pandigital(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":5390,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":114,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-13T22:49:33.000Z","updated_at":"2026-03-09T20:20:18.000Z","published_at":"2014-05-13T22:55:20.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 little warm-up to begin...\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\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\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\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\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 positive integer find whether it is a pandigital number.\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":1084,"title":"Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)","description":"Given a number _n_, return the terminal value of the number chain formed by summing the square of the digits. According to the Project Euler problem, this number chain always terminates with either 1 or 89.\r\n\r\nProject Euler Problem 92: \u003chttp://projecteuler.net/problem=92 Link\u003e","description_html":"\u003cp\u003eGiven a number \u003ci\u003en\u003c/i\u003e, return the terminal value of the number chain formed by summing the square of the digits. According to the Project Euler problem, this number chain always terminates with either 1 or 89.\u003c/p\u003e\u003cp\u003eProject Euler Problem 92: \u003ca href=\"http://projecteuler.net/problem=92\"\u003eLink\u003c/a\u003e\u003c/p\u003e","function_template":"function y = digits_squared_chain(x)\r\n  y = 1;\r\nend","test_suite":"%%\r\nassert(digits_squared_chain(649) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(79) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(608) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(487) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(739) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(565) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(68) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(383) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(379) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(203) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(632) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(391) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(863) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(13) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(100) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(236) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(293) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(230) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(31) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(806) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(623) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(7) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(13) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(836) == 1)\r\n\r\n%%\r\nassert(digits_squared_chain(954) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(567) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(388) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(789) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(246) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(787) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(311) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(856) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(143) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(873) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(215) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(995) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(455) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(948) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(875) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(788) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(722) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(250) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(227) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(640) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(835) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(965) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(726) == 89)\r\n\r\n%%\r\nassert(digits_squared_chain(689) == 89)\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":3,"created_by":134,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":256,"test_suite_updated_at":"2012-12-05T06:42:14.000Z","rescore_all_solutions":false,"group_id":27,"created_at":"2012-12-03T06:49:33.000Z","updated_at":"2026-03-26T09:05:10.000Z","published_at":"2012-12-05T06:42:14.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\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, return the terminal value of the number chain formed by summing the square of the digits. According to the Project Euler problem, this number chain always terminates with either 1 or 89.\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\u003eProject Euler Problem 92:\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=\\\"http://projecteuler.net/problem=92\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLink\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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":1106,"title":"I've got the power! (Inspired by Project Euler problem 29)","description":"Consider all integer combinations of a^b and b^a for the integer values 2 ≤ a ≤ 4 and 2 ≤ b ≤ 5:\r\n\r\n    2^2=4,  2^3=8,   2^4=16,  2^5=32\r\n    3^2=9,  3^3=27,  3^4=81,  3^5=243\r\n    4^2=16, 4^3=64,  4^4=256, 4^5=1024\r\n    5^2=25, 5^3=125, 5^4=625\r\n\r\nIf they are then placed in numerical order, with any repeats removed, we get the following sequence of 14 distinct terms:\r\n\r\n4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024\r\n\r\nGiven two values for x and y, find the unique, sorted sequence given by the values a^b and b^a for 2≤a≤x and 2≤b≤y.","description_html":"\u003cp\u003eConsider all integer combinations of a^b and b^a for the integer values 2 ≤ a ≤ 4 and 2 ≤ b ≤ 5:\u003c/p\u003e\u003cpre\u003e    2^2=4,  2^3=8,   2^4=16,  2^5=32\r\n    3^2=9,  3^3=27,  3^4=81,  3^5=243\r\n    4^2=16, 4^3=64,  4^4=256, 4^5=1024\r\n    5^2=25, 5^3=125, 5^4=625\u003c/pre\u003e\u003cp\u003eIf they are then placed in numerical order, with any repeats removed, we get the following sequence of 14 distinct terms:\u003c/p\u003e\u003cp\u003e4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024\u003c/p\u003e\u003cp\u003eGiven two values for x and y, find the unique, sorted sequence given by the values a^b and b^a for 2≤a≤x and 2≤b≤y.\u003c/p\u003e","function_template":"function z = euler029(x,y)\r\n  z = x+y;\r\nend","test_suite":"%%\r\nassert(isequal(euler029(5,5),[4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125]));\r\n%%\r\nassert(isequal(euler029(4,15),[4\t8\t9\t16\t25\t27\t32\t36\t49\t64\t81\t100\t121\t125\t128\t144\t169\t196\t216\t225\t243\t256\t343\t512\t625\t729\t1000\t1024\t1296\t1331\t1728\t2048\t2187\t2197\t2401\t2744\t3375\t4096\t6561\t8192\t10000\t14641\t16384\t19683\t20736\t28561\t32768\t38416\t50625\t59049\t65536\t177147\t262144\t531441\t1048576\t1594323\t4194304\t4782969\t14348907\t16777216\t67108864\t268435456\t1073741824]));\r\n%%\r\nassert(isequal(euler029(10,10),[4,8,9,16,25,27,32,36,49,64,81,100,125,128,216,243,256,343,512,625,729,1000,1024,1296,2187,2401,3125,4096,6561,7776,10000,15625,16384,16807,19683,32768,46656,59049,65536,78125,100000,117649,262144,279936,390625,531441,823543,1000000,1048576,1679616,1953125,2097152,4782969,5764801,9765625,10000000,10077696,16777216,40353607,43046721,60466176,100000000,134217728,282475249,387420489,1000000000,1073741824,3486784401,10000000000]));\r\n%%\r\na=ceil(rand*80)+2\r\nb=ceil(rand*80)+2\r\nassert(isequal(euler029(a,b),euler029(b,a)))\r\n%%\r\nassert(isequal(euler029(30,2),[4,8,9,16,25,32,36,49,64,81,100,121,128,144,169,196,225,256,289,324,361,400,441,484,512,529,576,625,676,729,784,841,900,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216,33554432,67108864,134217728,268435456,536870912,1073741824]))","published":true,"deleted":false,"likes_count":2,"comments_count":3,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":143,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-07T17:27:47.000Z","updated_at":"2026-03-09T19:34:22.000Z","published_at":"2012-12-07T17:27:47.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 all integer combinations of a^b and b^a for the integer values 2 ≤ a ≤ 4 and 2 ≤ b ≤ 5:\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[    2^2=4,  2^3=8,   2^4=16,  2^5=32\\n    3^2=9,  3^3=27,  3^4=81,  3^5=243\\n    4^2=16, 4^3=64,  4^4=256, 4^5=1024\\n    5^2=25, 5^3=125, 5^4=625]]\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\u003eIf they are then placed in numerical order, with any repeats removed, we get the following sequence of 14 distinct terms:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024\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\u003eGiven two values for x and y, find the unique, sorted sequence given by the values a^b and b^a for 2≤a≤x and 2≤b≤y.\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":2320,"title":"Pandigital number n°2 (Inspired by Project Euler 32)","description":"After Problem 2319.\r\nAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\r\nFor example, the 5-digit number 15234, is 1 through 5 pandigital.\r\nFind the number of pandigital numbers in a given interval [xlower,xupper] (inclusive if it is not explicit enough).\r\nThe test suite is simple here, but how to compute this number with BIG interval (pandigital number length \u003e 7) in Cody time?\r\nFor example, between 58755 and 99899923?","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: 192px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 96px; transform-origin: 407px 96px; vertical-align: baseline; \"\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: 15px 8px; transform-origin: 15px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAfter\u003c/span\u003e\u003c/span\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: 2px 8px; transform-origin: 2px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"/#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eProblem 2319\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: 2px 8px; transform-origin: 2px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e.\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: 257px 8px; transform-origin: 257px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\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: 204.5px 8px; transform-origin: 204.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\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: 343px 8px; transform-origin: 343px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFind the number of pandigital numbers in a given interval [xlower,xupper] (inclusive if it is not explicit enough).\u003c/span\u003e\u003c/span\u003e\u003c/div\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: 370.5px 8px; transform-origin: 370.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe test suite is simple here, but how to compute this number with BIG interval (pandigital number length \u0026gt; 7) in Cody time?\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: 143.5px 8px; transform-origin: 143.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eFor example, between 58755 and 99899923?\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = pandigital_nb(xlower, xupper)\r\n  y=xupper-xlower;\r\nend","test_suite":"%%\r\nxl = 1;\r\nxu = 10\r\ny_correct = 1;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 10;\r\nxu = 99;\r\ny_correct = 2;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 100;\r\nxu = 999;\r\ny_correct = 6;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 1000;\r\nxu = 9999;\r\ny_correct = 24;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 10000;\r\nxu = 99999;\r\ny_correct = 120;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 1;\r\nxu = 999;\r\ny_correct = 9;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 1;\r\nxu = 9999;\r\ny_correct = 33;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))\r\n%%\r\nxl = 100000;\r\nxu = 999999;\r\ny_correct = 720;\r\nassert(isequal(pandigital_nb(xl,xu),y_correct))","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":5390,"edited_by":223089,"edited_at":"2022-08-09T08:36:16.000Z","deleted_by":null,"deleted_at":null,"solvers_count":68,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-14T08:11:36.000Z","updated_at":"2026-03-10T00:41:57.000Z","published_at":"2014-05-14T08:12:54.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\u003eAfter\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=\\\"\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eProblem 2319\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\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\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.\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\u003eFor example, the 5-digit number 15234, is 1 through 5 pandigital.\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\u003eFind the number of pandigital numbers in a given interval [xlower,xupper] (inclusive if it is not explicit enough).\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\u003eThe test suite is simple here, but how to compute this number with BIG interval (pandigital number length \u0026gt; 7) in Cody time?\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\u003eFor example, between 58755 and 99899923?\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\"}]}"},{"id":1082,"title":"Lychrel Number Test (Inspired by Project Euler Problem 55)","description":"The task for this problem is to create a function that takes a number _n_ and tests if it might be a Lychrel number. This is, return |true| if the number satisfies the criteria stated below.\r\n\r\n*From Project Euler:* \u003chttp://projecteuler.net/problem=55 Link\u003e\r\n\r\nIf we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\r\n\r\nNot all numbers produce palindromes so quickly. For example,\r\n\r\n349 + 943 = 1292,\r\n1292 + 2921 = 4213\r\n4213 + 3124 = 7337\r\n\r\nThat is, 349 took three iterations to arrive at a palindrome.\r\n\r\nAlthough no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).\r\n\r\nSurprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.","description_html":"\u003cp\u003eThe task for this problem is to create a function that takes a number \u003ci\u003en\u003c/i\u003e and tests if it might be a Lychrel number. This is, return \u003ctt\u003etrue\u003c/tt\u003e if the number satisfies the criteria stated below.\u003c/p\u003e\u003cp\u003e\u003cb\u003eFrom Project Euler:\u003c/b\u003e \u003ca href=\"http://projecteuler.net/problem=55\"\u003eLink\u003c/a\u003e\u003c/p\u003e\u003cp\u003eIf we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\u003c/p\u003e\u003cp\u003eNot all numbers produce palindromes so quickly. For example,\u003c/p\u003e\u003cp\u003e349 + 943 = 1292,\r\n1292 + 2921 = 4213\r\n4213 + 3124 = 7337\u003c/p\u003e\u003cp\u003eThat is, 349 took three iterations to arrive at a palindrome.\u003c/p\u003e\u003cp\u003eAlthough no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).\u003c/p\u003e\u003cp\u003eSurprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.\u003c/p\u003e","function_template":"function tf = islychrel(n)\r\n  tf = false;\r\nend","test_suite":"%%\r\nassert(islychrel(3763));\r\n\r\n%%\r\nassert(islychrel(5943));\r\n\r\n%%\r\nassert(islychrel(4709));\r\n\r\n%%\r\nassert(~islychrel(3664));\r\n\r\n%%\r\nassert(~islychrel(3692));\r\n\r\n%%\r\nassert(islychrel(196));\r\n\r\n%%\r\nassert(islychrel(8619));\r\n\r\n%%\r\nassert(islychrel(9898));\r\n\r\n%%\r\nassert(islychrel(9344));\r\n\r\n%%\r\nassert(islychrel(9884));\r\n\r\n%%\r\nassert(islychrel(4852));\r\n\r\n%%\r\nassert(islychrel(7491));\r\n\r\n%%\r\nassert(~islychrel(5832));\r\n\r\n%%\r\nassert(~islychrel(7400));\r\n\r\n%%\r\nassert(~islychrel(2349));\r\n\r\n%%\r\nassert(~islychrel(7349));\r\n\r\n%%\r\nassert(~islychrel(9706));\r\n\r\n%%\r\nassert(~islychrel(8669));\r\n\r\n%%\r\nassert(~islychrel(863));\r\n\r\n%%\r\nassert(~islychrel(5979));\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":4,"created_by":134,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":111,"test_suite_updated_at":"2012-12-06T06:32:48.000Z","rescore_all_solutions":false,"group_id":44,"created_at":"2012-12-02T06:02:08.000Z","updated_at":"2026-02-07T16:07:23.000Z","published_at":"2012-12-04T20:00:30.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\u003eThe task for this problem is to create a function that takes a number\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e and tests if it might be a Lychrel number. This is, return\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003etrue\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e if the number satisfies the criteria stated below.\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eFrom Project Euler:\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=\\\"http://projecteuler.net/problem=55\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLink\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\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\u003eIf we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\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\u003eNot all numbers produce palindromes so quickly. For example,\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\u003e349 + 943 = 1292, 1292 + 2921 = 4213 4213 + 3124 = 7337\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\u003eThat is, 349 took three iterations to arrive at a palindrome.\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\u003eAlthough no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).\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\u003eSurprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.\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":2606,"title":"Decrypt the  cypher using XOR encryption (for beginners)","description":"Inspired by Project Euler n°59\r\n\r\nEach character on a computer is assigned a unique code and the preferred standard is ASCII \r\n(American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, \r\nand lowercase k = 107.\r\nA basic encryption method is to take a text file or a sentence, convert the bytes to ASCII, then XOR each byte with a given \r\nvalue, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the \r\ncipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.\r\n    \r\nYour task has been made easy, as the encryption key consists only of a upper case character (different in every tests). \r\nYou must know that the original text contains common FRENCH words about MATLAB.\r\n\r\nDecrypt the message and find the sum of the ASCII values in the original text.","description_html":"\u003cp\u003eInspired by Project Euler n°59\u003c/p\u003e\u003cp\u003eEach character on a computer is assigned a unique code and the preferred standard is ASCII \r\n(American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, \r\nand lowercase k = 107.\r\nA basic encryption method is to take a text file or a sentence, convert the bytes to ASCII, then XOR each byte with a given \r\nvalue, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the \r\ncipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.\u003c/p\u003e\u003cp\u003eYour task has been made easy, as the encryption key consists only of a upper case character (different in every tests). \r\nYou must know that the original text contains common FRENCH words about MATLAB.\u003c/p\u003e\u003cp\u003eDecrypt the message and find the sum of the ASCII values in the original text.\u003c/p\u003e","function_template":"function y = XOR_cypher(x)\r\n  y = x;\r\nend","test_suite":"%%\r\nx=[15 3 22 14 3 0 236 98 39 49 54 98 55 44 98 46 35 44 37 35 37 39 98 38 39 98 42 35 55 54 98 44 43 52 39 35 55];\r\ny_correct=3360;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[29 40 184 57 63 122 186 122 23 27 14 22 27 24 118 122 44 53 47 41 122 42 53 47 44 63 32 122 59 52 59 54 35 41 63 40 122 62 63 41 122 62 53 52 52 179 63 41 116];\r\ny_correct=4783;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[28 33 41 53 54 43 60 35 117 121 47 48 42 44 56 53 48 42 60 35 121 60 45 121 52 54 61 176 53 48 42 60 35 121 47 54 42 121 61 54 55 55 176 60 42 121 56 47 60 58 121 20 24 13 21 24 27 119];\r\ny_correct=5667;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[11 39 50 42 39 36 124 102 42 35 102 42 39 40 33 39 33 35 102 34 51 102 37 39 42 37 51 42 102 53 37 47 35 40 50 47 55 51 35];\r\ny_correct=3666;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n%%\r\nx=[27 36 62 57 58 62 36 34 107 40 35 36 56 34 57 107 6 42 63 39 42 41 107 46 63 107 59 42 56 107 27 50 63 35 36 37 107 116];\r\ny_correct=3547;\r\nassert(isequal(XOR_cypher(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":5390,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":66,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":32,"created_at":"2014-09-27T10:32:11.000Z","updated_at":"2026-03-19T21:22:18.000Z","published_at":"2014-09-27T10:33: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\",\"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\u003eInspired by Project Euler n°59\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\u003eEach character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107. A basic encryption method is to take a text file or a sentence, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the cipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.\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\u003eYour task has been made easy, as the encryption key consists only of a upper case character (different in every tests). You must know that the original text contains common FRENCH words about MATLAB.\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\u003eDecrypt the message and find the sum of the ASCII values in the original text.\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":2323,"title":"Pandigital number n°3 (Inspired by Project Euler 32)","description":"After Problem 2319 and 2320.\r\n\r\nAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE. For example, the 5-digit number 15234, is 1 through 5 pandigital.\r\n\r\nThe product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital ([391867254]).\r\n\r\nFind the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital (n is given in input).\r\n\r\nHINT1: Some products can be obtained in more than one way so be sure to only include it once in your sum.\r\n\r\nHINT2: All in good time...  \r\n\r\n","description_html":"\u003cp\u003eAfter Problem 2319 and 2320.\u003c/p\u003e\u003cp\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE. For example, the 5-digit number 15234, is 1 through 5 pandigital.\u003c/p\u003e\u003cp\u003eThe product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital ([391867254]).\u003c/p\u003e\u003cp\u003eFind the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital (n is given in input).\u003c/p\u003e\u003cp\u003eHINT1: Some products can be obtained in more than one way so be sure to only include it once in your sum.\u003c/p\u003e\u003cp\u003eHINT2: All in good time...\u003c/p\u003e","function_template":"function y = pandigital_sum(n)\r\n  y = x;\r\nend","test_suite":"%%\r\nx = 3;\r\ny_correct = [];\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 4;\r\ny_correct = 12;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 5;\r\ny_correct = 52;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 6;\r\ny_correct = 162;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n%%\r\nx = 7;\r\ny_correct = []; % Strange no ?\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n\r\n%%\r\nx = 8;\r\ny_correct = 13458;\r\nassert(isequal(pandigital_sum(x),y_correct))\r\n\r\n\r\n%% You obtain the Project Euler n°32 solution with n=9\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":3,"created_by":5390,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":43,"test_suite_updated_at":"2019-10-23T23:21:29.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2014-05-15T10:08:43.000Z","updated_at":"2025-12-19T11:41:31.000Z","published_at":"2014-05-15T10:20:54.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\u003eAfter Problem 2319 and 2320.\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\u003eAn n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE. For example, the 5-digit number 15234, is 1 through 5 pandigital.\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\u003eThe product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital ([391867254]).\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\u003eFind the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital (n is given in input).\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\u003eHINT1: Some products can be obtained in more than one way so be sure to only include it once in your sum.\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\u003eHINT2: All in good time...\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":1095,"title":"Circular Primes (based on Project Euler, problem 35)","description":"The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.\r\n\r\nThere are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.\r\n\r\nGiven a number x, write a MATLAB script that will tell you the number of circular primes less than or equal to x as well as a sorted list of what the circular prime numbers are.","description_html":"\u003cp\u003eThe number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.\u003c/p\u003e\u003cp\u003eThere are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.\u003c/p\u003e\u003cp\u003eGiven a number x, write a MATLAB script that will tell you the number of circular primes less than or equal to x as well as a sorted list of what the circular prime numbers are.\u003c/p\u003e","function_template":"function [how_many what_numbers]=circular_prime(x)\r\n    how_many=3;\r\n    what_numbers=[2 3 5];\r\nend","test_suite":"%%\r\n[y numbers]=circular_prime(197)\r\nassert(isequal(y,16)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197]))\r\n%%\r\n[y numbers]=circular_prime(100)\r\nassert(isequal(y,13)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97]))\r\n%%\r\n[y numbers]=circular_prime(250)\r\nassert(isequal(y,17)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199]))\r\n%%\r\n[y numbers]=circular_prime(2000)\r\nassert(isequal(y,27)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931]))\r\n%%\r\n[y numbers]=circular_prime(10000)\r\nassert(isequal(y,33)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931 3119 3779 7793 7937 9311 9377]))\r\n%%\r\n[y numbers]=circular_prime(54321)\r\nassert(isequal(y,38)\u0026\u0026isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931 3119 3779 7793 7937 9311 9377 11939 19391 19937 37199 39119]))\r\n","published":true,"deleted":false,"likes_count":10,"comments_count":6,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":651,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-05T18:02:09.000Z","updated_at":"2026-02-15T10:48:53.000Z","published_at":"2012-12-05T18:02:09.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\u003eThe number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.\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\u003eThere are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.\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, write a MATLAB script that will tell you the number of circular primes less than or equal to x as well as a sorted list of what the circular prime numbers 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\"}]}"}],"term":"difficulty_rating_bin:medium group:\"Project Euler III\"","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":"difficulty_rating_bin:medium group:\"Project Euler III\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"difficulty_rating_bin":[["difficulty_rating_bin:medium","","","medium",""]],"group":[["group:\"Project Euler III\"","","\"","Project Euler III","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f010\u003e":["Project Euler III"],"#\u003cMathWorks::Search::Field:0x00007f7360f1ef70\u003e":["medium"]},"filters":{"#\u003cMathWorks::Search::Field:0x00007f7360f1e6b0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f290\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f7360f1f1f0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f7360f1f150\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f7360f1f0b0\u003e":"difficulty_rating_bin:medium group:\"Project Euler III\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f0b0\u003e":"difficulty_rating_bin:medium group:\"Project Euler III\""},"queried_facets":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f010\u003e":["Project Euler III"],"#\u003cMathWorks::Search::Field:0x00007f7360f1ef70\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":"search","password":"J3bGPZzQ7asjJcCk","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":"difficulty_rating_bin:medium group:\"Project Euler III\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"difficulty_rating_bin":[["difficulty_rating_bin:medium","","","medium",""]],"group":[["group:\"Project Euler III\"","","\"","Project Euler III","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f010\u003e":["Project Euler III"],"#\u003cMathWorks::Search::Field:0x00007f7360f1ef70\u003e":["medium"]},"filters":{"#\u003cMathWorks::Search::Field:0x00007f7360f1e6b0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f290\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f7360f1f1f0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f7360f1f150\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f7360f1f0b0\u003e":"difficulty_rating_bin:medium group:\"Project Euler III\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f0b0\u003e":"difficulty_rating_bin:medium group:\"Project Euler III\""},"queried_facets":{"#\u003cMathWorks::Search::Field:0x00007f7360f1f010\u003e":["Project Euler III"],"#\u003cMathWorks::Search::Field:0x00007f7360f1ef70\u003e":["medium"]}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":2319,"difficulty_rating":"easy-medium"},{"id":1084,"difficulty_rating":"easy-medium"},{"id":1106,"difficulty_rating":"easy-medium"},{"id":2320,"difficulty_rating":"easy-medium"},{"id":1082,"difficulty_rating":"easy-medium"},{"id":2606,"difficulty_rating":"medium"},{"id":2323,"difficulty_rating":"medium"},{"id":1095,"difficulty_rating":"medium"}]}}