Retired
Exponential Comparison (retired)
164 of 328mertcanekiz
Description:
Comparing two numbers written in index form like 2^11
and 3^7
is not difficult, as any calculator would confirm that 2^11 = 2048 < 3^7 = 2187
.
However, confirming that 632382^518061 > 519432^525806
would be much more difficult, as both numbers contain over three million digits.
Your task is to write a function that takes two arrays (or two tuples in Python) in the form of [base, exponent]
where base
and exponent
are positive integers, and return the largest of the two pairs of numbers.
Inspired by Project Euler #99
Mathematics
Algorithms
Similar Kata:
Stats:
Created | Jun 10, 2018 |
Warriors Trained | 700 |
Total Skips | 16 |
Total Code Submissions | 1277 |
Total Times Completed | 328 |
Python Completions | 164 |
JavaScript Completions | 142 |
Ruby Completions | 21 |
Java Completions | 24 |
Total Stars | 10 |
% of votes with a positive feedback rating | 89% of 113 |
Total "Very Satisfied" Votes | 95 |
Total "Somewhat Satisfied" Votes | 12 |
Total "Not Satisfied" Votes | 6 |
Total Rank Assessments | 4 |
Average Assessed Rank | 6 kyu |
Highest Assessed Rank | 6 kyu |
Lowest Assessed Rank | 7 kyu |