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 - Last call - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2015-11-27 22:57:07 Open Document File Size: 97,20 KB Share Result on Facebook

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 integerAdd to Reading List