ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a,n∈Z+a,n\in\mathbb{Z}^+ satisfy a>2a>2, ⌊log⁡2(a)⌋+1≥n>1\left\lfloor\log_2(a)\right\rfloor+1\geq n>1, and suppose there is no k∈Z+k\in\mathbb{Z}^+ such that kn=ak^n=a. Integer-part root conjecture.

⌊an⌋=⌊(a2an+1)2an+1 mod (a2an2−a)(a2an+1)2an mod (a2an2−a)−1⌋.\left\lfloor\sqrt[n]{a}\right\rfloor=\left\lfloor\frac{(a^{2an}+1)^{2an+1}\bmod(a^{2an^2}-a)}{(a^{2an}+1)^{2an}\bmod(a^{2an^2}-a)}-1\right\rfloor.

This gives a proposed elementary formula for the integer part of an nn-th root using polynomial quotient-ring reductions. The surrounding discussion indicates that the formula is motivated by convergence observations, while a deeper analysis of the convergence properties is left for future work; no resolution is supplied here.

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.