10854
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Bitwise Operations Mod
n
Bitwise operations BitAnd, BitOr and BitXor with arguments
and
modulo an integer.
Contributed by:
Enrique Zeleny
SNAPSHOTS
RELATED LINKS
AND
(
Wolfram
MathWorld
)
XOR
(
Wolfram
MathWorld
)
OR
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Bitwise Operations Mod
n
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/BitwiseOperationsModN/
Contributed by:
Enrique Zeleny
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Tree Form of Recursive Function Evaluation Steps
Enrique Zeleny
Patterns in Partitions of Integers
Enrique Zeleny
Conway Sequence with Varying Initial Conditions
Enrique Zeleny
Mixed Base Gray Codes
Michael Schreiber
Balanced Annihilation
Michael Schreiber
String Matching Automaton
Michael Schreiber
Linear Congruential Sequences
Stephen Wolfram
Turing Machine Runs
Enrique Zeleny
Plots of Compositions of Bitwise Operations
Enrique Zeleny
Decomposition of 2,3 Turing Machine Evolutions
Michael Schreiber
Related Topics
Computer Science
Computers
Integers
NKS / Wolfram Science
NKS Book
Nested Patterns
Number Theory
Patterns
Recreational Mathematics
Sequences
Short Programs
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+