CHMMC 2015 Tiebreaker Problems November 22, 2015 Problem 0.1. Call a positive integer x n-cube-invariant if the last n digits of x are equal to the last n digits of x3 . For example, 1 is n-cube invariant for any integer

First Page		Document Content
Date: 2015-11-27 22:57:07		CHMMC 2015 Tiebreaker Problems November 22, 2015 Problem 0.1. Call a positive integer x n-cube-invariant if the last n digits of x are equal to the last n digits of x3 . For example, 1 is n-cube invariant for any integer Add to Reading List Source URL: chmmc.caltech.edu Download Document from Source Website File Size: 97,20 KB Share Document on Facebook