{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-07-15T00:25:42.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-07-15T00: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":1477,"title":"Champernowne Constant","description":"The \u003chttp://en.wikipedia.org/wiki/Champernowne_constant Champernowne constant\u003e is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.\r\n\r\nThat is\r\n\r\n 0.1234567891011121314151617181920...\r\n\r\nThis constant is of interest because it can be understood to contain an encoding of any past, present or future information, because any given sequence of numbers can be shown to exist somewhere in the champernowne representation. \r\n\r\nReturn the nth digit of the champernowne constant. The function takes an array of position values and returns an array of digits corresponding to those positions. \r\n\r\nExamples:\r\n\r\n [1 2 3 4 5] returns [1 2 3 4 5]\r\n\r\n [10 11 12 13 14 15] returns [1 0 1 1 1 2]\r\n\r\n [188 289] returns [9 9] \r\n\r\nProblem 3)\r\nPrev: \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1472 1472\u003e\r\nNext: \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1478 1478\u003e","description_html":"\u003cp\u003eThe \u003ca href = \"http://en.wikipedia.org/wiki/Champernowne_constant\"\u003eChampernowne constant\u003c/a\u003e is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.\u003c/p\u003e\u003cp\u003eThat is\u003c/p\u003e\u003cpre\u003e 0.1234567891011121314151617181920...\u003c/pre\u003e\u003cp\u003eThis constant is of interest because it can be understood to contain an encoding of any past, present or future information, because any given sequence of numbers can be shown to exist somewhere in the champernowne representation.\u003c/p\u003e\u003cp\u003eReturn the nth digit of the champernowne constant. The function takes an array of position values and returns an array of digits corresponding to those positions.\u003c/p\u003e\u003cp\u003eExamples:\u003c/p\u003e\u003cpre\u003e [1 2 3 4 5] returns [1 2 3 4 5]\u003c/pre\u003e\u003cpre\u003e [10 11 12 13 14 15] returns [1 0 1 1 1 2]\u003c/pre\u003e\u003cpre\u003e [188 289] returns [9 9] \u003c/pre\u003e\u003cp\u003eProblem 3)\r\nPrev: \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1472\"\u003e1472\u003c/a\u003e\r\nNext: \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1478\"\u003e1478\u003c/a\u003e\u003c/p\u003e","function_template":"function vy = gendigit_champernowne(vx)\r\n  vy = vx;\r\nend","test_suite":"%%\r\nx = [1 2 3 4 5];\r\ny_correct = [1 2 3 4 5];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx = [10 11 12 13 14 15];\r\ny_correct = [1 0 1 1 1 2];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx = [188 189];\r\ny_correct = [9 9];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx = 2887:3000;\r\ny_correct = '999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102';\r\nassert(isequal(sprintf('%d',gendigit_champernowne(2887:3000)),y_correct))\r\n\r\n%%\r\nx=[1000000 1000001 1000002];\r\ny_correct = [1 8 5];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[12000:12005];\r\ny_correct = [7     7     3     2     7     8];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[10000000 10000001 10000002];\r\ny_correct = [7 3 0];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[120000:120005];\r\ny_correct = [2     6     2     2     2     2];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[1200000:1200005];\r\ny_correct = [ 8     5     1     8     2     1];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[1200004:1200009];\r\ny_correct = [ 2     1     8     5     1     9];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[1200008:1200013];\r\ny_correct = [1     9      2     1     8     5];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[13000008:13000013];\r\ny_correct = [2     0     1     5     8     7];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[14000008:14000013];\r\ny_correct = [ 1     5     8     7     3     1];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":2,"created_by":11275,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":97,"test_suite_updated_at":"2013-05-02T00:27:45.000Z","rescore_all_solutions":false,"group_id":44,"created_at":"2013-04-30T14:25:37.000Z","updated_at":"2026-05-05T05:22:17.000Z","published_at":"2013-04-30T14:25:36.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\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://en.wikipedia.org/wiki/Champernowne_constant\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eChampernowne constant\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.\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\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ 0.1234567891011121314151617181920...]]\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\u003eThis constant is of interest because it can be understood to contain an encoding of any past, present or future information, because any given sequence of numbers can be shown to exist somewhere in the champernowne representation.\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\u003eReturn the nth digit of the champernowne constant. The function takes an array of position values and returns an array of digits corresponding to those positions.\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\u003eExamples:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ [1 2 3 4 5] returns [1 2 3 4 5]\\n\\n [10 11 12 13 14 15] returns [1 0 1 1 1 2]\\n\\n [188 289] returns [9 9]]]\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\u003eProblem 3) Prev:\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://www.mathworks.com/matlabcentral/cody/problems/1472\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e1472\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e Next:\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://www.mathworks.com/matlabcentral/cody/problems/1478\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e1478\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\"}]}"}],"problem_search":{"problems":[{"id":1477,"title":"Champernowne Constant","description":"The \u003chttp://en.wikipedia.org/wiki/Champernowne_constant Champernowne constant\u003e is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.\r\n\r\nThat is\r\n\r\n 0.1234567891011121314151617181920...\r\n\r\nThis constant is of interest because it can be understood to contain an encoding of any past, present or future information, because any given sequence of numbers can be shown to exist somewhere in the champernowne representation. \r\n\r\nReturn the nth digit of the champernowne constant. The function takes an array of position values and returns an array of digits corresponding to those positions. \r\n\r\nExamples:\r\n\r\n [1 2 3 4 5] returns [1 2 3 4 5]\r\n\r\n [10 11 12 13 14 15] returns [1 0 1 1 1 2]\r\n\r\n [188 289] returns [9 9] \r\n\r\nProblem 3)\r\nPrev: \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1472 1472\u003e\r\nNext: \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1478 1478\u003e","description_html":"\u003cp\u003eThe \u003ca href = \"http://en.wikipedia.org/wiki/Champernowne_constant\"\u003eChampernowne constant\u003c/a\u003e is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.\u003c/p\u003e\u003cp\u003eThat is\u003c/p\u003e\u003cpre\u003e 0.1234567891011121314151617181920...\u003c/pre\u003e\u003cp\u003eThis constant is of interest because it can be understood to contain an encoding of any past, present or future information, because any given sequence of numbers can be shown to exist somewhere in the champernowne representation.\u003c/p\u003e\u003cp\u003eReturn the nth digit of the champernowne constant. The function takes an array of position values and returns an array of digits corresponding to those positions.\u003c/p\u003e\u003cp\u003eExamples:\u003c/p\u003e\u003cpre\u003e [1 2 3 4 5] returns [1 2 3 4 5]\u003c/pre\u003e\u003cpre\u003e [10 11 12 13 14 15] returns [1 0 1 1 1 2]\u003c/pre\u003e\u003cpre\u003e [188 289] returns [9 9] \u003c/pre\u003e\u003cp\u003eProblem 3)\r\nPrev: \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1472\"\u003e1472\u003c/a\u003e\r\nNext: \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1478\"\u003e1478\u003c/a\u003e\u003c/p\u003e","function_template":"function vy = gendigit_champernowne(vx)\r\n  vy = vx;\r\nend","test_suite":"%%\r\nx = [1 2 3 4 5];\r\ny_correct = [1 2 3 4 5];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx = [10 11 12 13 14 15];\r\ny_correct = [1 0 1 1 1 2];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx = [188 189];\r\ny_correct = [9 9];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx = 2887:3000;\r\ny_correct = '999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102';\r\nassert(isequal(sprintf('%d',gendigit_champernowne(2887:3000)),y_correct))\r\n\r\n%%\r\nx=[1000000 1000001 1000002];\r\ny_correct = [1 8 5];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[12000:12005];\r\ny_correct = [7     7     3     2     7     8];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[10000000 10000001 10000002];\r\ny_correct = [7 3 0];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[120000:120005];\r\ny_correct = [2     6     2     2     2     2];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[1200000:1200005];\r\ny_correct = [ 8     5     1     8     2     1];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[1200004:1200009];\r\ny_correct = [ 2     1     8     5     1     9];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[1200008:1200013];\r\ny_correct = [1     9      2     1     8     5];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[13000008:13000013];\r\ny_correct = [2     0     1     5     8     7];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n%%\r\nx=[14000008:14000013];\r\ny_correct = [ 1     5     8     7     3     1];\r\nassert(isequal(gendigit_champernowne(x),y_correct))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":2,"created_by":11275,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":97,"test_suite_updated_at":"2013-05-02T00:27:45.000Z","rescore_all_solutions":false,"group_id":44,"created_at":"2013-04-30T14:25:37.000Z","updated_at":"2026-05-05T05:22:17.000Z","published_at":"2013-04-30T14:25:36.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\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://en.wikipedia.org/wiki/Champernowne_constant\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eChampernowne constant\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e is a real number whose digits in decimal representation come from the concatenation of all consecutive positive integers starting from 1.\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\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ 0.1234567891011121314151617181920...]]\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\u003eThis constant is of interest because it can be understood to contain an encoding of any past, present or future information, because any given sequence of numbers can be shown to exist somewhere in the champernowne representation.\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\u003eReturn the nth digit of the champernowne constant. The function takes an array of position values and returns an array of digits corresponding to those positions.\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\u003eExamples:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ [1 2 3 4 5] returns [1 2 3 4 5]\\n\\n [10 11 12 13 14 15] returns [1 0 1 1 1 2]\\n\\n [188 289] returns [9 9]]]\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\u003eProblem 3) Prev:\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://www.mathworks.com/matlabcentral/cody/problems/1472\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e1472\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e Next:\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://www.mathworks.com/matlabcentral/cody/problems/1478\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e1478\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\"}]}"}],"errors":[],"facets":[[{"value":"Magic Numbers II","count":1,"selected":true},{"value":"Magic Numbers III","count":1,"selected":true},{"value":"Number theory","count":1,"selected":false}],[{"value":"medium","count":1,"selected":false}]],"term":"group:\"Magic Numbers III\" group:\"Magic Numbers II\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}