ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem

Let the notation a∣ba|b denote " aa divides bb ". The mimic function in number theory is defined as follows [1].

Definition For any positive integer N=∑i=0nXiMi\mathcal{N} = \sum_{i=0}^{n}\mathcal{X}_{i}\mathcal{M}^{i} divisible by D\mathcal{D}, the mimic function, f(D∣N)f(\mathcal{D} | \mathcal{N}), is given by,

f(D∣N)=∑i=0nXi(M−D)if(\mathcal{D} | \mathcal{N}) = \sum_{i=0}^{n}\mathcal{X}_{i}(\mathcal{M}-\mathcal{D})^{i}

By using this definition of mimic function, the mimic number of any non-prime integer is defined as follows [1].

Definition The number mm is defined to be the mimic number of any positive integer N=∑i=0nXiMi\mathcal{N} = \sum_{i=0}^{n}\mathcal{X}_{i}\mathcal{M}^{i}, with respect to D\mathcal{D}, for the minimum value of which fm(D∣N)=Df^{m}(\mathcal{D} | \mathcal{N}) = \mathcal{D}.

Given these two definitions and a positive integer D\mathcal{D}, find the distribution of mimic numbers of those numbers divisible by D\mathcal{D}.

Again, find whether there is an upper bound of mimic numbers for a set of numbers divisible by any fixed positive integer D\mathcal{D}.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.