ProbXiv
Explorersign in
Problem archiveProblem record

Statement

If n=∏1≤i≤tpikin=\prod_{1\leq i\leq t} p_i^{k_i} is the factorisation of nn into distinct primes then let f(n)=∑piℓi,f(n)=\sum p_i^{\ell_i}, where ℓi\ell_i is chosen such that n∈[piℓi,piℓi+1)n\in [p_i^{\ell_i},p_i^{\ell_i+1}). Furthermore, let F(n)=max⁡∑i=1taiF(n)=\max \sum_{i=1}^t a_i where the maximum is taken over all a1,…,at≤na_1,\ldots,a_t\leq n such that (ai,aj)=1(a_i,a_j)=1 for $i

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.