ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s(n):=∑d∣n, d<nds(n):=\sum_{d\mid n,\ d<n}d be the sum-of-proper-divisors function. Fix k≥2k\ge 2, and call a positive integer kk-free if it is not divisible by the kkth power of any integer greater than 11.

Powerfree preservation conjecture. On a set of integers nn of asymptotic density 11,

n is k-free⟺s(n) is k-free.\text{$n$ is $k$-free} \Longleftrightarrow \text{$s(n)$ is $k$-free}.

The conjecture predicts that, for every fixed k≥2k\ge 2, the sum-of-proper-divisors function preserves kk-freeness for almost all integers. The preceding discussion explains that small prime-power divisors are controlled by results on the divisibility of σ(n)\sigma(n); the remaining issue is to exclude large prime-power divisors of s(n)s(n) for almost all nn.

Record

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.