Kyle Miller kmill

## symm_quantize.py
# n is an integer, the number of quantization steps of the 4-tuple [w, x, y, z]
def quantize(w, x, y, z, n) :
    if z == None :
        z = 1.0 - w - x - y
    #assert w + x + y + z == 1
    n = int(n)

    v = [w, x, y, z]
    vn = [a * n for a in v]
    vni = [int(a) for a in vn]

## quantize.py
def quantize(w, x, y, z, n) :
    if z == None :
        z = 1.0 - w - x - y
    n = int(n)

    v = [w, x, y, z]
    vn = [a * n for a in v]
    vni = [int(a) for a in vn]
    vnf = [a - ai for a, ai in zip(vn, vni)]

## mazes.py
# count 4x4 mazes (spanning trees) using Kirchoff's theorem

import numpy as np

# Vertices:
#  0  1  2  3
#  4  5  6  7
#  8  9 10 11
# 12 13 14 15

## 1894370.py
num = 1
while True:
    if num % 3 == 1 and num % 4 == 2 and num % 5 == 3 and num % 6 == 4:
        print num
        break
    num += 1

## 1894370_2.py
num = 1
while True:
    rems = (num % 3, num % 4, num % 5, num % 6)
    print num, rems
    if rems == (1, 2, 3, 4):
        print num
        break
    num += 1

## tc.py
# Example of Todd-Coxeter to compute S_3 from relations

idents = []
neighbors = []
to_visit = []
visited = set()

op_dir = [1, 0, 3, 2]

def find(c):

## tc.py
# Example of Todd-Coxeter to compute S_3 from relations

idents = []
neighbors = []
to_visit = 0

ngens = 2
def op_dir(d):
    return d+1-2*(d%2)

## xkcd.1930.regex
^Did you know that (the (fall|spring) equinox|the (winter|summer) (solstice|Olympics)|the (earliest|latest) (sunrise|sunset)|daylight savings? time|leap (day|year)|Easter|the (harvest|super|blood) moon|Toyota truck month|shark week) (happens (earlier|later|at the wrong time) every year|drifts out of sync with the (sun|moon|zodiac|(Gregorian|Mayan|lunar|iPhone) calendar|atomic clock in Colorado)|might (not happen|happen twice) this year) because of (time zone legislation in (Indiana|Arizona|Russia)|a decree by the pope in the 1500s|(precession|libration|nutation|libation|eccentricity|obliquity) of the (moon|sun|Earth's axis|equator|prime meridian|(international date|Mason-Dixon) line)|magnetic field reversal|an arbitray decision by (Benjamin Franklin|Isaac Newton|FDR))\? Apparently (it causes a predictable increase in car accidents|that's why we have leap seconds|scientists are really worried|it was even more extreme during the (bronze age|ice age|Cretaceous|1990s)|there's a proposal to fix it, but it (will ne

## save.php
<?php
$parts = explode("\n", $_POST['msg'], 2);
$msg = $parts[0];
if (strlen($msg) > 0) {
  $f = fopen("messages.txt", "a") or die("Unable to open file");
  fwrite($f, $msg . "\n");
  fclose($f);
}
echo "Success";

## Anders_fractran_collatz.txt
See https://codegolf.stackexchange.com/a/203682/78112

This is a description of Anders Kaseorg's solution to the code golf problem of making a program in FRACTRAN
that detects whether or not the Collatz sequence starting from the given number eventually reaches 1.

FRACTRAN programs can be thought of as being a list of chemical reactions with no catalysts (chemical
species that appear as both reagents and products).  Given a fraction c/d, the prime factors present
in d (with multiplicity) are the reagent species, and the prime factors present in c (with
multiplicity) are the product species.  Since fractions are reduced, a species is only ever either a
reagent or a product in a given reaction.
	# n is an integer, the number of quantization steps of the 4-tuple [w, x, y, z]
	def quantize(w, x, y, z, n) :
	if z == None :
	z = 1.0 - w - x - y
	#assert w + x + y + z == 1
	n = int(n)

	v = [w, x, y, z]
	vn = [a * n for a in v]
	vni = [int(a) for a in vn]
	# count 4x4 mazes (spanning trees) using Kirchoff's theorem

	import numpy as np

	# Vertices:
	# 0 1 2 3
	# 4 5 6 7
	# 8 9 10 11
	# 12 13 14 15
	num = 1
	while True:
	if num % 3 == 1 and num % 4 == 2 and num % 5 == 3 and num % 6 == 4:
	print num
	break
	num += 1
	num = 1
	while True:
	rems = (num % 3, num % 4, num % 5, num % 6)
	print num, rems
	if rems == (1, 2, 3, 4):
	print num
	break
	num += 1
	# Example of Todd-Coxeter to compute S_3 from relations

	idents = []
	neighbors = []
	to_visit = []
	visited = set()

	op_dir = [1, 0, 3, 2]

	def find(c):
	<?php
	$parts = explode("\n", $_POST['msg'], 2);
	$msg = $parts[0];
	if (strlen($msg) > 0) {
	$f = fopen("messages.txt", "a") or die("Unable to open file");
	fwrite($f, $msg . "\n");
	fclose($f);
	}
	echo "Success";
	See https://codegolf.stackexchange.com/a/203682/78112

	This is a description of Anders Kaseorg's solution to the code golf problem of making a program in FRACTRAN
	that detects whether or not the Collatz sequence starting from the given number eventually reaches 1.

	FRACTRAN programs can be thought of as being a list of chemical reactions with no catalysts (chemical
	species that appear as both reagents and products). Given a fraction c/d, the prime factors present
	in d (with multiplicity) are the reagent species, and the prime factors present in c (with
	multiplicity) are the product species. Since fractions are reduced, a species is only ever either a
	reagent or a product in a given reaction.