Math Quiz
Editorial
16 questions across the three Math lessons and the section's problems: digits, bases and long numbers; divisors, GCD and primes; and remainders, fast power and counting. Pick an answer to see whether it's right and why. Nothing is saved, so you can take it again.
If one trips you up, its lesson is Digits and Number Manipulation, Divisors, GCD and Primes or Modular Arithmetic, Fast Power and Counting.
Quiz
1 / 16Multiple choice
Armstrong Number checks 1,741,725. Which power does it raise each digit to?
Multiple choice
Palindrome Number reverses the back half of 1,234,321. When its loop stops, what are x and half?
Multiple choice
Which spreadsheet column is number 728?
Multiple choice
For which x does Reverse Integer return 0?
Multiple choice
Multiply Strings keeps m + n cells. Which product leaves its first cell 0, to be skipped?
Multiple choice
How many divisors does the pair loop, up to √n, find for 100?
Multiple choice
Euclid on gcd(89, 55), two neighbouring Fibonacci numbers. How many steps until b is 0?
Multiple choice
What does Greatest Common Divisor of Strings return for "ABAB" and "BABA"?
Multiple choice
Count Primes on n = 30. Which primes still cross something out?
Multiple choice
With the smallest-prime-factor table, how many divisions factorize 1,024?
Multiple choice
In Java, sum and x are remainders mod 10⁹ + 7, held as ints. Does
sum + x overflow before % M?Multiple choice
Square and multiply from the top for x²², 22 being 10110. Which exponents does it hold, bit by bit?
Multiple choice
How many good digit strings does Count Good Numbers count for n = 3?
Multiple choice
What is [[1, 1], [1, 0]]⁵?
Multiple choice
What is row 6 of Pascal's triangle?
Multiple choice
Mod 12, which of these has an inverse?