Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Regularity versus complexity in the binary representation of 3^n - MaRDI portal

Regularity versus complexity in the binary representation of 3^n

From MaRDI portal

Publication:5188210

Jump to:navigation, search

zbMath1236.11012arXiv0902.3257MaRDI QIDQ5188210

Eric S. Rowland

Publication date: 10 March 2010

Full work available at URL: https://arxiv.org/abs/0902.3257

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Radix representation; digital problems (11A63)

Related Items (1)

\(p\)-adic asymptotic properties of constant-recursive sequences

This page was built for publication: Regularity versus complexity in the binary representation of 3^n

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5188210&oldid=19768740"