Cody

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

65.22% Correct | 34.78% Incorrect
Last solution submitted on Aug 28, 2015

Problem Comments

Solution Comments

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!

Join the 15-year community celebration.

Play games and win prizes!

Learn more