AFTD Auto-Formalizing Theoretical Domains

brgc_word

def

The binary reflected Gray code word of rank t, read as a binary number: g(t) = t xor floor(t/2).

Statement

def brgc_word (t : ℕ) : ℕ
Defined in
arXiv:2610.24758 (Optimal single-track Gray codes from Gray-ordered necklaces), Conjecture 1 (prime case of a conjecture from 2007), Sec. 1; the BRGC g(t) = t xor floor(t/2) of Sec. 1
Verified
20 Oct 2026
Axioms
none listed
Used by 37

Lean source view module on GitHub

/-- The binary reflected Gray code word of rank t, read as a binary number: g(t) = t xor floor(t/2). -/
def brgc_word (t : ℕ) : ℕ := t ^^^ (t / 2)
See it in the graphDiscuss this resultChallenge it