Cody

Problem 3079. Big numbers, repeated least significant digits

Created by Michael C. in Community

This problem builds off of Problem 3077

Given an integer x which contains d digits, find the value of n (n > 1) such that the last d digits of x^n is equal to x. If the last d digits will never equal x, return inf.

Example 1:

  • x = 2; (therefore d = 1)
  • 2^2 = 4, 2^3 = 8, 2^4 = 16, 2^5 = 32
  • n = 5;

Example 2:

  • x = 10; (therefore d = 2)
  • 10^2 = 100, 10^3 = 1000, etc
  • n = inf;
Solve

Solution Stats

55.56% Correct | 44.44% Incorrect
Last solution submitted on Jun 14, 2019

Problem Comments

Recent Solvers23

Suggested Problems

More from this Author4

Tags

overflow