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
Solution Comments
Show comments
Loading...
Problem Recent Solvers69
Suggested Problems
-
24065 Solvers
-
Project Euler: Problem 5, Smallest multiple
1672 Solvers
-
Vectorize the digits of an Integer
338 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
226 Solvers
-
Set the array elements whose value is 13 to 0
1450 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!
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! :-)