Alateng Pan

Erdős–Graham Problem #411 – A Construction of Six Solution Families for the r=2 Case

We construct and verify six infinite families of solutions to the r=2 case of the Erdős–Graham iteration problem (Problem #411). Steinerberger [1] reduced the r=2 case to the equation φ(n) + φ(n+φ(n)) = n and proved that any solution must fall into one of two branches: either the...

Erdős–Graham Problem #411 – A Construction of Six Solution Families for the r=2 Case

We construct and verify six infinite families of solutions to the r=2 case of the Erdős–Graham iteration problem (Problem #411). Steinerberger [1] reduced the r=2 case to the equation φ(n) + φ(n+φ(n)) = n and proved that any solution must fall into one of two branches: either the...

Erdős–Graham Problem #411– A Complete Proof of the r=2 Case via the UF Framework

We present a complete proof of the r=2 case of the Erdős–Graham iteration problem (Problem #411). Steinerberger (2025) reduced this case to the equation phi(n) + phi(n + phi(n)) = n, finding six solution families and showing any additional solution must be of the form n = 2^a p^b...

The UF Operator – Definition, Construction, and Boundaries

This paper defines the UF operator (Unrestricted Function) as a new algebraic framework for implicit domain restriction. The operator allows functions to be written without explicit conditional statements by embedding domain restrictions into the algebraic structure via a formal...