ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be the integer under consideration, let yy and zz be integers, and define

f1(ε)=4ε2+4(1−n)ε+n2−6n+1,f_{1}(\varepsilon)=4\varepsilon^2+4(1-n)\varepsilon+n^2-6n+1, f2(ε)=4(n2−2n+1)ε2+4(3n2−n3−3n+1)ε+n4−8n3+14n2−8n+1.f_{2}(\varepsilon)=4(n^2-2n+1)\varepsilon^2+4(3n^2-n^3-3n+1)\varepsilon+n^4-8n^3+14n^2-8n+1.

Define

Γ={i∈Z>0:f1(i)=y2 or f2(i)=z2}.\Gamma=\left\{i\in\mathbb{Z}_{>0}: f_{1}(i)=y^2\text{ or }f_{2}(i)=z^2\right\}.

Hyperbola-based factoring conjecture. The set Γ\Gamma has exactly three elements and satisfies

Γ={ε1,ε2,n},\Gamma=\{\varepsilon_{1},\varepsilon_{2},n\},

with ε1+ε2=n−1\varepsilon_{1}+\varepsilon_{2}=n-1 and

f2(ε1)=f1(n)f1(ε1).f_{2}(\varepsilon_{1})=f_{1}(n)f_{1}(\varepsilon_{1}).

Moreover,

ε=min⁡{ε1,ε2},max⁡Γ=n.\varepsilon=\min\{\varepsilon_{1},\varepsilon_{2}\},\qquad \max \Gamma=n.

This claim is intended to characterize the parameter ε\varepsilon used in the paper's hyperbola-based approach to factoring integers. The supplied text gives no evidence establishing or refuting it, so its status remains open.

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.