# apt-get install bind9
# nano /etc/resolv.conf
erase everything, add "nameserver 127.0.0.1"
# nano /etc/bind/named.conf.options
options {
forwarders { 208.67.222.222; 208.67.220.220; };
...
};
# etc/init.d/bind9 restart
XOR or ⊕ - a type of logical disjunction on two operands that results in a value of true if the operands, or disjuncts, have opposite truth values. A simple way to state this is "one or the other but not both."
Tipp: https://en.wikipedia.org/wiki/Wilson_theorem
See Mathworld and Wiki on Modular arithmetic!
'Weeds', generated using an L-system in 3D. |
L-system trees form convincing models of natural patterns |
Thank you for your feedback, Pierre. I wanted to personally let you know that I really appreciate the help you've given to other students throughout the course.Saved my rainy sunday. :)
"From this proposition it will follow, when arithmetical addition has been defined, that 1+1=2." —Volume I, 1st edition, page 379 (page 362 in 2nd edition; page 360 in abridged version). (The proof is actually completed in Volume II, 1st edition, page 86, accompanied by the comment, "The above proposition is occasionally useful.")