ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Sk(2)S^{(2)}_k denote the relevant sequence and let Fail(Sk(2)){\rm Fail}(S^{(2)}_k) be its repair factor. For a prime pp and a positive integer jj, the following assertions are conjectured. The prime-power repair-factor conjecture.

  • If j=1j=1, then
Fail(Sp+1(2))=p⋅Fail(Sp(2)).{\rm Fail}\bigl(S^{(2)}_{p+1}\bigr)=p\cdot{\rm Fail}\bigl(S^{(2)}_p\bigr).
  • If j>1j>1, then
Fail(Spj+1(2))∣pj−1⋅Fail(Spj(2)).{\rm Fail}\bigl(S^{(2)}_{p^j+1}\bigr)\mid p^{j-1}\cdot{\rm Fail}\bigl(S^{(2)}_{p^j}\bigr).
  • If j>1j>1, then
∣Fail(Spj(2))∣p=p−1.\bigl|{\rm Fail}\bigl(S^{(2)}_{p^j}\bigr)\bigr|_p=p^{-1}.
  • We have
∣Fail(Spj+1(2))∣p=p−j.\bigl|{\rm Fail}\bigl(S^{(2)}_{p^j+1}\bigr)\bigr|_p=p^{-j}.

These are the prime-power cases of the conjectural behavior of the repair factor and its pp-adic valuation. They, like the preceding conjectures, are motivated by numerical computations, while a general closed formula for the repair factor appears inaccessible.

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.