kei-sato

## install-gm-w-librvg.sh
export PKG_CONFIG_PATH=/usr/lib64/pkgconfig:/usr/lib/pkgconfig
export PATH=/usr/bin:$PATH
export LDFLAGS=-L/usr/lib64:/usr/lib
export LD_LIBRARY_PATH=/usr/lib64:/usr/lib
export CPPFLAGS=-I/usr/include

PREFIX=/usr

sudo yum-config-manager --enable epel
sudo yum -y update && sudo yum -y upgrade

## fermat_binom.py
#!/usr/bin/env python3

"""
Using Fermat's little theorem to calculate nCk mod m, for k < m and m is prime

Two versions:
1. Pre-Compute factorials and multiplicative inverses in O(n*logn) --> later lookup in O(1)
2. Compute directly --> no lookup --> each time O(n)
"""
	export PKG_CONFIG_PATH=/usr/lib64/pkgconfig:/usr/lib/pkgconfig
	export PATH=/usr/bin:$PATH
	export LDFLAGS=-L/usr/lib64:/usr/lib
	export LD_LIBRARY_PATH=/usr/lib64:/usr/lib
	export CPPFLAGS=-I/usr/include

	PREFIX=/usr

	sudo yum-config-manager --enable epel
	sudo yum -y update && sudo yum -y upgrade
	#!/usr/bin/env python3

	"""
	Using Fermat's little theorem to calculate nCk mod m, for k < m and m is prime

	Two versions:
	1. Pre-Compute factorials and multiplicative inverses in O(n*logn) --> later lookup in O(1)
	2. Compute directly --> no lookup --> each time O(n)
	"""