Problem 1253. Infinite precision division
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.
Return integer part of quotient as text (leading zeros acceptable), and remainder as a number.
Inspired 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.
I look forward to not understanding arcane code involving either/both bsxfun and arrayfun! I'm talking to you, @bmtran, Alfnie, et al!
Solution Stats
Problem Comments
-
1 Comment
James
on 8 Feb 2013
Heh...I already had written a script to do just this. I just had to change the name of mine to match what you were asking for. Now I get to see how much better I could have done it! :-)
Solution Comments
Show commentsProblem Recent Solvers58
Suggested Problems
-
7639 Solvers
-
How long is the longest prime diagonal?
396 Solvers
-
700 Solvers
-
6979 Solvers
-
7174 Solvers
More from this Author3
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!