Pages that link to "Item:Q4650112"
From MaRDI portal
The following pages link to The 2-Adic, Binary and Decimal Periods of 1/3k Approach Full Complexity for Increasing k (Q4650112):
Displaying 3 items.
- Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure (Q2893309) (← links)
- The repetends of reduced fractions $a/b^k$ approach full complexity with an increasing $k$ (Q5042434) (← links)
- Regularity versus complexity in the binary representation of 3^n (Q5188210) (← links)