{"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":1253,"title":"Infinite precision division","description":"Develop a function that will divide a very very large integer numerator, supplied to function as a string (e.g., '12233344445555566666677777778888888899999999') by a reasonably sized integer or float, supplied as a number.\r\nReturn integer part of quotient as text (leading zeros acceptable), and remainder as a number.\r\nInspired by my initial misapprehension of failure of simple solution at one of the test cases of Doug Hull's http://www.mathworks.com/matlabcentral/cody/problems/234-project-euler-problem-3-largest-prime-factor, and dedicated to those willing to code 'the wrong way around' any problem.\r\nI look forward to not understanding arcane code involving either/both bsxfun and arrayfun! I'm talking to you, @bmtran, Alfnie, et al!","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: 195px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 97.5px; transform-origin: 407px 97.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 338.5px 8px; transform-origin: 338.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eDevelop a function that will divide a very very large integer numerator, supplied to function as a string (e.g., '12233344445555566666677777778888888899999999') by a reasonably sized integer or float, supplied as a number.\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: 296.5px 8px; transform-origin: 296.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eReturn integer part of quotient as text (leading zeros acceptable), and remainder as a number.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 63px; 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 31.5px; text-align: left; transform-origin: 384px 31.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: 327px 8px; transform-origin: 327px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eInspired by my initial misapprehension of failure of simple solution at one of the test cases of Doug Hull's\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 = \"https://in.mathworks.com/matlabcentral/cody/groups/4567/problems/1253-infinite-precision-division/edit#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"perspective-origin: 329px 8px; transform-origin: 329px 8px; \"\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/234-project-euler-problem-3-largest-prime-factor\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: 51px 8px; transform-origin: 51px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e, and dedicated to those willing to code 'the wrong way around' any problem.\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: 375.5px 8px; transform-origin: 375.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eI look forward to not understanding arcane code involving either/both bsxfun and arrayfun! I'm talking to you, @bmtran, Alfnie, et al!\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function [quotient,remainder] = strdiv(dividend,divisor)\r\n%\r\n% this will not work, but will explain my terminology\r\n%\r\n% (note: some 'leading' zeros in returned quotient are acceptable)\r\n% so, '002...' is just as acceptable as '2...'\r\n%\r\n  quotient = num2str(floor(str2num(dividend)/divisor));\r\n  remainder = mod(dividend,divisor);\r\n\r\nend","test_suite":"%% \r\ndividend = '122333444455555666666777777788888888999999999';\r\ndivisor = 42;\r\nquotient_correct = '2912701058465611111113756614021164023809523';\r\nremainder_correct = 33;\r\n[quotient,remainder]=strdiv(dividend,divisor);\r\nwhile and(numel(quotient)\u003e0,quotient(1)=='0')\r\n  quotient=quotient(2:end);\r\nend\r\nassert(isequal([quotient_correct ' ' num2str(remainder_correct)],[quotient ' ' num2str(remainder)]))\r\n\r\n%% \r\ndividend = '2357111317192329313741434753596167717379838997';\r\ndivisor = 69;\r\nquotient_correct = '34161033582497526286107750052118372715649840';\r\nremainder_correct = 37;\r\n[quotient,remainder]=strdiv(dividend,divisor);\r\nwhile and(numel(quotient)\u003e0,quotient(1)=='0')\r\n  quotient=quotient(2:end);\r\nend\r\nassert(isequal([quotient_correct ' ' num2str(remainder_correct)],[quotient ' ' num2str(remainder)]))\r\n\r\n%% \r\ndividend = '1234567890123456789012345678901234567890';\r\ndivisor = 37;\r\nquotient_correct = '33366699733066399703036369700033366699';\r\nremainder_correct = 27;\r\n[quotient,remainder]=strdiv(dividend,divisor);\r\nwhile and(numel(quotient)\u003e0,quotient(1)=='0')\r\n  quotient=quotient(2:end);\r\nend\r\nassert(isequal([quotient_correct ' ' num2str(remainder_correct)],[quotient ' ' num2str(remainder)]))\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":2846,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":69,"test_suite_updated_at":"2021-11-29T06:23:47.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-02-07T20:26:17.000Z","updated_at":"2025-12-26T09:48:21.000Z","published_at":"2013-02-07T20:26:17.000Z","restored_at":null,"restored_by":null,"spam":false,"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\u003eDevelop a function that will divide a very very large integer numerator, supplied to function as a string (e.g., '12233344445555566666677777778888888899999999') by a reasonably sized integer or float, supplied as a number.\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\u003eReturn integer part of quotient as text (leading zeros acceptable), and remainder as a number.\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\u003eInspired by my initial misapprehension of failure of simple solution at one of the test cases of Doug Hull's\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\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/234-project-euler-problem-3-largest-prime-factor\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, and dedicated to those willing to code 'the wrong way around' any problem.\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\u003eI look forward to not understanding arcane code involving either/both bsxfun and arrayfun! I'm talking to you, @bmtran, Alfnie, et al!\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":1253,"title":"Infinite precision division","description":"Develop a function that will divide a very very large integer numerator, supplied to function as a string (e.g., '12233344445555566666677777778888888899999999') by a reasonably sized integer or float, supplied as a number.\r\nReturn integer part of quotient as text (leading zeros acceptable), and remainder as a number.\r\nInspired by my initial misapprehension of failure of simple solution at one of the test cases of Doug Hull's http://www.mathworks.com/matlabcentral/cody/problems/234-project-euler-problem-3-largest-prime-factor, and dedicated to those willing to code 'the wrong way around' any problem.\r\nI look forward to not understanding arcane code involving either/both bsxfun and arrayfun! I'm talking to you, @bmtran, Alfnie, et al!","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: 195px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 97.5px; transform-origin: 407px 97.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 338.5px 8px; transform-origin: 338.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eDevelop a function that will divide a very very large integer numerator, supplied to function as a string (e.g., '12233344445555566666677777778888888899999999') by a reasonably sized integer or float, supplied as a number.\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: 296.5px 8px; transform-origin: 296.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eReturn integer part of quotient as text (leading zeros acceptable), and remainder as a number.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 63px; 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 31.5px; text-align: left; transform-origin: 384px 31.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: 327px 8px; transform-origin: 327px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eInspired by my initial misapprehension of failure of simple solution at one of the test cases of Doug Hull's\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 = \"https://in.mathworks.com/matlabcentral/cody/groups/4567/problems/1253-infinite-precision-division/edit#null\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"perspective-origin: 329px 8px; transform-origin: 329px 8px; \"\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/234-project-euler-problem-3-largest-prime-factor\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: 51px 8px; transform-origin: 51px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e, and dedicated to those willing to code 'the wrong way around' any problem.\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: 375.5px 8px; transform-origin: 375.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eI look forward to not understanding arcane code involving either/both bsxfun and arrayfun! I'm talking to you, @bmtran, Alfnie, et al!\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function [quotient,remainder] = strdiv(dividend,divisor)\r\n%\r\n% this will not work, but will explain my terminology\r\n%\r\n% (note: some 'leading' zeros in returned quotient are acceptable)\r\n% so, '002...' is just as acceptable as '2...'\r\n%\r\n  quotient = num2str(floor(str2num(dividend)/divisor));\r\n  remainder = mod(dividend,divisor);\r\n\r\nend","test_suite":"%% \r\ndividend = '122333444455555666666777777788888888999999999';\r\ndivisor = 42;\r\nquotient_correct = '2912701058465611111113756614021164023809523';\r\nremainder_correct = 33;\r\n[quotient,remainder]=strdiv(dividend,divisor);\r\nwhile and(numel(quotient)\u003e0,quotient(1)=='0')\r\n  quotient=quotient(2:end);\r\nend\r\nassert(isequal([quotient_correct ' ' num2str(remainder_correct)],[quotient ' ' num2str(remainder)]))\r\n\r\n%% \r\ndividend = '2357111317192329313741434753596167717379838997';\r\ndivisor = 69;\r\nquotient_correct = '34161033582497526286107750052118372715649840';\r\nremainder_correct = 37;\r\n[quotient,remainder]=strdiv(dividend,divisor);\r\nwhile and(numel(quotient)\u003e0,quotient(1)=='0')\r\n  quotient=quotient(2:end);\r\nend\r\nassert(isequal([quotient_correct ' ' num2str(remainder_correct)],[quotient ' ' num2str(remainder)]))\r\n\r\n%% \r\ndividend = '1234567890123456789012345678901234567890';\r\ndivisor = 37;\r\nquotient_correct = '33366699733066399703036369700033366699';\r\nremainder_correct = 27;\r\n[quotient,remainder]=strdiv(dividend,divisor);\r\nwhile and(numel(quotient)\u003e0,quotient(1)=='0')\r\n  quotient=quotient(2:end);\r\nend\r\nassert(isequal([quotient_correct ' ' num2str(remainder_correct)],[quotient ' ' num2str(remainder)]))\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":2846,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":69,"test_suite_updated_at":"2021-11-29T06:23:47.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-02-07T20:26:17.000Z","updated_at":"2025-12-26T09:48:21.000Z","published_at":"2013-02-07T20:26:17.000Z","restored_at":null,"restored_by":null,"spam":false,"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\u003eDevelop a function that will divide a very very large integer numerator, supplied to function as a string (e.g., '12233344445555566666677777778888888899999999') by a reasonably sized integer or float, supplied as a number.\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\u003eReturn integer part of quotient as text (leading zeros acceptable), and remainder as a number.\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\u003eInspired by my initial misapprehension of failure of simple solution at one of the test cases of Doug Hull's\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\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/234-project-euler-problem-3-largest-prime-factor\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, and dedicated to those willing to code 'the wrong way around' any problem.\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\u003eI look forward to not understanding arcane code involving either/both bsxfun and arrayfun! I'm talking to you, @bmtran, Alfnie, et al!\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"term":"tag:\"doh!\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"doh!\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"doh!\"","","\"","doh!","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f49e2f456e0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f49e2f45640\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f49e2f44d80\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f49e2f45960\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f49e2f458c0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f49e2f45820\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f49e2f45780\u003e":"tag:\"doh!\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f49e2f45780\u003e":"tag:\"doh!\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"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":"tag:\"doh!\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"doh!\"","","\"","doh!","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f49e2f456e0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f49e2f45640\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f49e2f44d80\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f49e2f45960\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f49e2f458c0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f49e2f45820\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f49e2f45780\u003e":"tag:\"doh!\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f49e2f45780\u003e":"tag:\"doh!\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1253,"difficulty_rating":"easy-medium"}]}}