Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Ordowski’s A306270 Semiprime Classification

Abstract

Ordowski’s semiprimes in A306270 have the prime factors prescribed by A190275.

All variables range over the natural numbers N, including zero. The letter k denotes a sequence candidate, p and q denote prime factors with p at most q, and b denotes an arbitrary residue representative. Prime(x) means that x is prime, gcd is the natural greatest common divisor, mem is membership in A306270, and congruence is taken modulo the displayed natural modulus. Powers, products, order, and subtraction are natural-number operations, so subtraction is truncated at zero. The scope is exactly Ordowski’s Conjecture sentence for every semiprime k greater than four. The classification proof is content-bearing: it turns the universal congruence into a Carmichael exponent divisibility and follows the prime-square divisor chain to the factor equality.

Definition 1.1 (Membership in A306270).

Formalization. D5/S3/Arith/Congruence/OrdowskiSemiprimeCarmichaelSquareClassification.mem (✓ std3).

Citation. Thomas Ordowski (2020). OEIS A306270, composite k with b^(k(k-1)) = 1 mod k^2 for all b coprime to k, with the conjecture that its semiprimes > 4 are the p(p^2-p+1) of A190275. URL: https://oeis.org/A306270.

Commentary.

A natural number k belongs to A306270 when it is composite and greater than one, and every natural b coprime to k has b^(k(k-1)) congruent to one modulo k^2.

Theorem 1.2 (Ordowski’s semiprime classification).

Proof. Machine-checked in Lean as D5/S3/Arith/Congruence/OrdowskiSemiprimeCarmichaelSquareClassification.result (✓ std3). ∎

Resolves. Problems/oeis-a306270-ordowski-semiprime-carmichael-square-classification (proved) by D5/S3/Arith/Congruence/OrdowskiSemiprimeCarmichaelSquareClassification.result.

Citation. Thomas Ordowski (2020). OEIS A306270, composite k with b^(k(k-1)) = 1 mod k^2 for all b coprime to k, with the conjecture that its semiprimes > 4 are the p(p^2-p+1) of A190275. URL: https://oeis.org/A306270.

Commentary.

If k=pq is greater than four, p and q are prime, p is at most q, and k belongs to A306270, then q=p^2-p+1. Consequently k has the form p(p^2-p+1) from A190275. The subtraction in the displayed equality is natural subtraction.

References