ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A=2nabcdA=2^n abcd and B=2nefghB=2^n efgh be a symmetric higher-order amicable pair, with a,b,c,d,e,f,g,ha,b,c,d,e,f,g,h denoting the relevant prime factors. Define xx and yy through the normalized expressions associated with AA, BB, and the sum φ(A)+φ(B)\varphi(A)+\varphi(B) described in the preceding results. Symmetric 4-term conjecture. The relationship between the symmetric polynomials in the prime factors is hypothesized to satisfy

y−1=[ef(g+h)+gh]−(a+b+c+d),y-1=[ef(g+h)+gh]-(a+b+c+d), x−1=[ab(c+d)+cd]−(e+f+g+h).x-1=[ab(c+d)+cd]-(e+f+g+h).

This proposes a higher-order symmetric extension of the factorization patterns established earlier for amicable pairs whose greatest common divisor is a power of two.

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.