MathDB
2018 MOAA Team P7

Source:

January 23, 2022
floor functionalgebranumber theoryteam2018

Problem Statement

For a positive integer kk, define the kk-pop of a positive integer nn as the infinite sequence of integers a1,a2,...a_1, a_2, ... such that a1=na_1 = n and ai+1=aik,i=1,2,..a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, .. where x \lfloor x\rfloor denotes the greatest integer less than or equal to xx. Furthermore, define a positive integer mm to be kk-pop avoiding if kk does not divide any nonzero term in the kk-pop of mm. For example, 1414 is 3-pop avoiding because 33 does not divide any nonzero term in the 33-pop of 1414, which is 14,4,1,0,0,....14, 4, 1, 0, 0, .... Suppose that the number of positive integers less than 13201813^{2018} which are 1313-pop avoiding is equal to N. What is the remainder when NN is divided by 10001000?