Generalized Digit Parity for Integer Sequences
![](/img/demonstrations-branding.png)
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
This Demonstration shows fractal-like patterns in the generalized digit parity of selected integer sequences. The concept of binary parity can be generalized for non-negative integers and for all positive integer bases
by the definition: sum of digits of
in base
(mod
). Plotting these results in two dimensions
sometimes produces interesting patterns. This Demonstration provides a window to view a subset of each pattern by allowing the setting of starting values and ranges for
and
.
Contributed by: Noel Patson (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
detailSectionParagraphPermanent Citation
"Generalized Digit Parity for Integer Sequences"
http://demonstrations.wolfram.com/GeneralizedDigitParityForIntegerSequences/
Wolfram Demonstrations Project
Published: March 7 2011