zmetcalf Goto Github PK

layout_issue

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?

longest-collatz-sequence

http://projecteuler.net/problem=14 - The following iterative sequence is defined for the set of positive integers: n n/2 (n is even) n 3n + 1 (n is odd) Using the rule above and starting with 13, we generate the following sequence: 13 40 20 10 5 16 8 4 2 1 It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1. Which starting number, under one million, produces the longest chain? NOTE: Once the chain starts the terms are allowed to go above one million.

loopback.io

LoopBack project site - now with documentation!

maximum-path-sum-i

http://projecteuler.net/problem=18

mezz-to-widgy

Replication of issue: https://groups.google.com/a/fusionbox.com/forum/#!topic/widgy/7t8TBTff3UM

mezzanine

A content management platform built using the Django framework.

moneyline

multiples-of-3-and-5

http://projecteuler.net/problem=1

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?

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.

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.

number-spiral-diagonals

http://projecteuler.net/problem=28

openshift_idle_kill

Node script to prevent openshift from idling

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?

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?

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.

php

Docker Official Image packaging for PHP

php_desklet

Personal Laravel Project

piholeblocklist

PiHole and AGH Blocklists

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?

quadratic-primes

http://projecteuler.net/problem=27

quantum

Code Challenge

rails-handbook

Describing the development process used by the Infinum Rails Team.

react-backgammon

Backgammon game built using ReactJS

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

reciprocal-cycles

http://projecteuler.net/problem=26

rtmd_redesign

New theme for Rebuilding Together Metro Denver

rtmd_wordpress_theme

WordPress Theme For Rebuilding Together Metro Denver

seater