zmetcalf/daily_emailer
Web application using Django's admin to automate sending an email a day to an email address.
Developer Profile
zmetcalf
Discovered public repositories for zmetcalf in the GitHub catalog.
zmetcalf/ka-lite
KA Lite: lightweight web server for serving core Khan Academy content (videos and exercises) without needing internet connectivity
zmetcalf/mezz-to-widgy
Replication of issue: https://groups.google.com/a/fusionbox.com/forum/#!topic/widgy/7t8TBTff3UM
zmetcalf/SimpleWorkOrder
Work order system that manages volunteer workers, clients in need, and work orders to match the two.
zmetcalf/BeagleBone_CharLCD
BeagleBone version of https://github.com/adafruit/Adafruit-Raspberry-Pi-Python-Code/blob/master/Adafruit_CharLCD/Adafruit_CharLCD.py
zmetcalf/mezzanine
A content management platform built using the Django framework.
zmetcalf/grappelli-safe
A snapshot of the grappelli_2 branch of django-grappelli, packaged as a dependency for the Mezzanine CMS for Django.
zmetcalf/django-webdev
Django based web development playground.
zmetcalf/django-messages
This is just a simple program for me to understand django's messages.
zmetcalf/widgy-no-mixer
No Mezzanine - No Mixer
zmetcalf/Coded-Triangle-Numbers
http://projecteuler.net/problem=42
zmetcalf/Pandigital-Prime
http://projecteuler.net/problem=41 - We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime. What is the largest n-digit pandigital prime that exists?
zmetcalf/unit-test-rework-pulse
pulse.torweg.org
zmetcalf/Champernownes-Constant
http://projecteuler.net/problem=40 - Champernowne's constant
zmetcalf/Integer-right-triangles
http://projecteuler.net/problem=39 - If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120. {20,48,52}, {24,45,51}, {30,40,50} For which value of p ≤ 1000, is the number of solutions maximised?
zmetcalf/fusionbox-demo-project
A project using fusionbox tools
zmetcalf/django-widgy
Heterogeneous tree editor for Django
zmetcalf/Pandigital-Multiples
https://projecteuler.net/problem=38 - Take the number 192 and multiply it by each of 1, 2, and 3: 192 × 1 = 192 192 × 2 = 384 192 × 3 = 576 By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3) The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5). What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n) where n > 1?
zmetcalf/Truncatable-Primes
http://projecteuler.net/problem=37 - The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3. Find the sum of the only eleven primes that are both truncatable from left to right and right to left. NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.
zmetcalf/Double-Base-Palindromes
http://projecteuler.net/problem=36
zmetcalf/Circular-Primes
http://projecteuler.net/problem=35 - The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime. There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97. How many circular primes are there below one million?
zmetcalf/chesterfield_beans
Personal Django Site to replace my WordPress Site
zmetcalf/forum-pulse
Forum component for pulse
zmetcalf/django_site
Test Site for Django
zmetcalf/Digit-Factorials
http://projecteuler.net/problem=34 - 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all numbers which are equal to the sum of the factorial of their digits. Note: as 1! = 1 and 2! = 2 are not sums they are not included.
zmetcalf/Digit-Canceling-Fractions
http://projecteuler.net/problem=33
zmetcalf/Triple-Draw-Deuce-to-Seven-Lowball-Limit
Triple Draw Deuce to Seven Lowball Limit poker game with Pygame
zmetcalf/Pandigital-Products
http://projecteuler.net/problem=32 We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital. The product 7254 is unusual, as the identity, 39 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital. Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital. HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.
zmetcalf/Coin-Sums
http://projecteuler.net/problem=31
zmetcalf/Digit-Fifth-Powers
http://projecteuler.net/problem=30
zmetcalf/Distinct-Powers
http://projecteuler.net/problem=29
zmetcalf/Number-Spiral-Diagonals
http://projecteuler.net/problem=28
zmetcalf/rebuild-search-pulse
Hibernate Search stores its search date in the container, which can get wiped out. This plug-in is in development to solve this issue within the pulse framework. pulse.torweg.org
zmetcalf/theme-pulse-HTML5
HTML5 framework for pulse. pulse.torweg.org
zmetcalf/Quadratic-Primes
http://projecteuler.net/problem=27
zmetcalf/skeleton-pulse
File skeleton for pulse
zmetcalf/Reciprocal-Cycles
http://projecteuler.net/problem=26
zmetcalf/1000-Digit-Fibonacci-Number
http://projecteuler.net/problem=25
zmetcalf/glowing-hipster
Java Function Tests
zmetcalf/Lexicographic-Permutations
http://projecteuler.net/problem=24 - A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are: 012 021 102 120 201 210 What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
zmetcalf/Download-Excel-Pulse
http://pulse.torweg.org/site/Pulsar/en_US.CMS.displayCMS.365./first-controller-users-excel - Example program for the Pulse framework
zmetcalf/Hello-Pulse
This is a plugin example from pulse.torweg.org.
zmetcalf/Non-Abundant-Sums
http://projecteuler.net/problem=23 - A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number. A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n. As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit. Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
zmetcalf/Name-Scores
http://projecteuler.net/problem=22 - Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score. For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 53 = 49714. What is the total of all the name scores in the file?
zmetcalf/Amicable-Numbers
http://projecteuler.net/problem=21 - Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a b, then a and b are an amicable pair and each of a and b are called amicable numbers. For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220. Evaluate the sum of all the amicable numbers under 10000.
zmetcalf/Factorial-Digit-Sum
http://projecteuler.net/problem=20 - n! means n (n 1) ... 3 2 1 For example, 10! = 10 9 ... 3 2 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of the digits in the number 100!
zmetcalf/Counting-Sundays
You are given the following information, but you may prefer to do some research for yourself. 1 Jan 1900 was a Monday. Thirty days has September, April, June and November. All the rest have thirty-one, Saving February alone, Which has twenty-eight, rain or shine. And on leap years, twenty-nine. A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400. How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
zmetcalf/Maximum-Path-Sum-I
http://projecteuler.net/problem=18
zmetcalf/Number-Letter-Counts
http://projecteuler.net/problem=17 - If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total. If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used? NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of "and" when writing out numbers is in compliance with British usage.
zmetcalf/Power-Digit-Sum
http://projecteuler.net/problem=16 - 2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 2^1000?