Inefficient brute-force solution to problem 16

- Works by starting in the power that is within
  the 20 digit limit of JS
- Then transforms that into an array of digits
- From there each digit is multiplied by 2 (with
  the carry over being accounted for) for each power
Implement a pr 16 solution that actually finishes running

- The problem with first solution is that it does too
  many conversions to and from string to int and takes
  way too long (does not even finish on 2^500)
- This solution uses the additive property of exponents.
  Start with a value of 2^50 (totally arbitrary) then
  continue multiplying that value onto itself (each time
  incrementing the exponent value by 50) until you reach
  1000.
- Stores each digit as an element in an array. Multiply
  by each digit (of n^2 complexity).
Cleanup: Put code that calculates result in a function