Admissibility

Navigation page for Blueprint/D5/S1/Digit/Admissibility/ at upstream snapshot 880384c42100f2d04436d97c4ac862e91b4bba85.

Contents

• Equivalent Binary Carryless Multiplier Conditions
• Seven and Five Carryless Multiplier Equivalence
• Containment of Binary Carryless Multiplier Conditions
• A115805 to A115803 carryless containment
• The Least Simultaneous Digit-Sum Witness
• Composite Concatenations of Distinct Partition Parts
• Finite Product Threshold Pruning
• A Gray-Code Closed Form for a Binary Recurrence
• Kurkov’s Inverse Gray-Code Recurrence
• Least-Digit Zeckendorf Decomposition
• Odd-Index Zeckendorf Freedom
• Palindrome Squares and Their Reversals
• Squares Preserved by a Decimal Prefix and Suffix
• Extremal Fibonacci Window Widths
• Digit Extrema Five and Nine Exclude Multiples of Five
• Permutation-Invariant Niven Digit-Sum Bound