Lien-Hung Su

The Read-Once Factorial-Divisibility Conjecture: Algebraic Proofs Through Six Inputs

We formulate the division-free read-once factorial-divisibility conjecture for pairwise distinct integers. Using congruence arguments, signed residue classes, parity decompositions, and disjoint block constructions, we prove the conjecture algebraically for all input sizes 1≤n≤6....

The Read-Once Factorial-Divisibility Conjecture: Algebraic Proofs Through Six Inputs

We formulate the division-free read-once factorial-divisibility conjecture for pairwise distinct integers. Using congruence arguments, signed residue classes, parity decompositions, and disjoint block constructions, we prove the conjecture algebraically for all input sizes 1≤n≤6....

The Read-Once Factorial-Divisibility Conjecture: Algebraic Proofs Through Six Inputs

We formulate the division-free read-once factorial-divisibility conjecture for pairwise distinct integers. Using congruence arguments, signed residue classes, parity decompositions, and disjoint block constructions, we prove the conjecture algebraically for all input sizes 1≤n≤6....