Franklin franklin-e

## gist:98cd96a6ef2cd0939ac60c03fd6dd71c
Verifying my Blockstack ID is secured with the address 1PUEzkFZJswBBEJnmgf4XVGP4KuYDofbeg https://explorer.blockstack.org/address/1PUEzkFZJswBBEJnmgf4XVGP4KuYDofbeg

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                franklin-e
                / keybase.md
            
            
              Created
              August 11, 2016 21:29
            
          
    Keybase proof

I hereby claim:

I am franklin-e on github.
I am einspruch (https://keybase.io/einspruch) on keybase.
I have a public key whose fingerprint is A62A 4F8A 5D62 0C4F 4658  4CFA 4B72 50AC D8FA 113E

To claim this, I am signing this object:

  
## ig.py
# Takes a jpeg by path, appends '_ig' to the basename,
# centers it on a fitted, square, white background.

# Usage:

# $ python ig.py fabulous_image.jpg
# created fabulous_image_ig.jpg

import Image, os, sys

## gist:9f0070253d6a6acd4579
Verifying that +einspruch is my openname (Bitcoin username). https://onename.io/einspruch

## dupes.py
from __future__ import division
import os, sys
from PIL import Image

# Takes jpeg and a series of integers, intelligently creates duplicates at indicated sizes.
# Also replaces spaces with underscores and lowercases filenames.

# Usage:

# $ python dupes.py My\ Fabulous\ Image.jpg 1200 800 500

## diagonal sums two-liner.py
from itertools import chain
print sum([j for j in chain.from_iterable([(i*i, i*i-i+1, i*i-2*i+2, i*i-3*i+3) for i in range(3,1112,2)])]) + 1

## better diagonal sums.py
corners = [1]
for i in range(3, 1112, 2):
    new_corners = (i*i, i*i-(i-1), i*i-(2 * (i-1)), i*i-(3 * (i-1)))
    for corner in new_corners:
        corners.append(corner)
print sum(corners)

## sum on diagonals.py
side = 1111
corners = [1]
stepper = (1, 2, 2, 2)
counter = 1
side -= 1
while counter <= side * side:
    counter += 1
    for step in stepper:
        counter += step
        corners.append(counter)

## minimalist multipoly in pynguin.py
def vector(angle,length):
   turnto(angle)
   forward(length)

def lcm(values):
   '''Returns the least common multiple of a list of integers.'''
   values.sort()
   biggest = values[-1]
   multiplier = 1
   while sum([(multiplier * biggest) % value for value in values]) != 0:
	# Takes a jpeg by path, appends '_ig' to the basename,
	# centers it on a fitted, square, white background.

	# Usage:

	# $ python ig.py fabulous_image.jpg
	# created fabulous_image_ig.jpg

	import Image, os, sys
	from __future__ import division
	import os, sys
	from PIL import Image

	# Takes jpeg and a series of integers, intelligently creates duplicates at indicated sizes.
	# Also replaces spaces with underscores and lowercases filenames.

	# Usage:

	# $ python dupes.py My\ Fabulous\ Image.jpg 1200 800 500
	from itertools import chain
	print sum([j for j in chain.from_iterable([(ii, ii-i+1, ii-2i+2, ii-3i+3) for i in range(3,1112,2)])]) + 1
	corners = [1]
	for i in range(3, 1112, 2):
	new_corners = (ii, ii-(i-1), ii-(2 (i-1)), ii-(3 (i-1)))
	for corner in new_corners:
	corners.append(corner)
	print sum(corners)
	side = 1111
	corners = [1]
	stepper = (1, 2, 2, 2)
	counter = 1
	side -= 1
	while counter <= side * side:
	counter += 1
	for step in stepper:
	counter += step
	corners.append(counter)
	def vector(angle,length):
	turnto(angle)
	forward(length)

	def lcm(values):
	'''Returns the least common multiple of a list of integers.'''
	values.sort()
	biggest = values[-1]
	multiplier = 1
	while sum([(multiplier * biggest) % value for value in values]) != 0: