Binary Patterns of Integer Functions
Intricate patterns can be produced from the binary number representation of the results of integer functions. Is there a cellular automata rule (and initial condition) that can produce the same behavior and computation?
Contributed by:
Daniel de Souza Carvalho
X
X
X
Show Source Code
|
Download Source Code Notebook
There is
a cellular automaton
that computes the primes.
Catalan Number
(
Wolfram
MathWorld
)
Factorial
(
Wolfram
MathWorld
)
Fibonacci
(
Wolfram
MathWorld
)
Lucas Number
(
Wolfram
MathWorld
)
Partition
(
Wolfram
MathWorld
)
Prime Number
(
Wolfram
MathWorld
)
Subfactorial
(
Wolfram
MathWorld
)
"
Binary Patterns of Integer Functions
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/BinaryPatternsOfIntegerFunctions/
Contributed by:
Daniel de Souza Carvalho
Discrete Mathematics
Number Theory
Patterns
Eisenstein Integer
Values of Combinatorial Functions
Geometric Proof of the Tetrahedral Number Formula
Adding Polygonal Numbers
Consecutive Digits in the Expansion of Pi
Networks for Basic Number Theoretic Functions
Fibonacci Numbers Count Domino Tilings
Stairstep Interpretation of Catalan Numbers
Mortal Fibonacci Rabbits
Fermat's Little Theorem
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
