Skip to content

Instantly share code, notes, and snippets.

Avatar

Martin Owen mowen

View GitHub Profile
View euler-5.clj
(ns martin)
(defn evenly-divisible?
"Is N evenly-divisible by all of the numbers in SEQ?"
[n seq]
(loop [s seq]
;; TODO: Find out how to do 'cond' in Clojure
(if (empty? s)
true
(if (not (zero? (mod n (first s))))
View euler-6.clj
(ns martin)
(defn sqr
"Square the given number."
[n]
(. (BigInteger/valueOf n) (pow 2)))
(defn euler-6
"Find the difference between the sum of the squares of the first one hundred
natural numbers and the square of the sum."
View SiteFocus.js
/**
* SiteFocus, an enhanced version of the Blacklist Sites - Page Mods Demo.
* Recommended for anyone who has this problem: http://xkcd.com/477/
* Martin Owen - martinowenuk@gmail.com
*/
jetpack.future.import("storage.simple");
jetpack.future.import('menu');
function SiteFocus() {
View euler4.el
;; A palindromic number reads the same both ways. The largest palindrome made
;; from the product of two 2-digit numbers is 9009 = 91 × 99.
;;
;; Find the largest palindrome made from the product of two 3-digit numbers.
;;
(defun array-reverse (array)
"Reverse the ARRAY."
(let ((reversed-array (copy-sequence array))
(array-length (length array))
View gist:291247
(eval-after-load 'org
'(progn
(set-face-foreground 'org-level-2 "magenta4")
(set-face-foreground 'outline-2 "magenta4")
(set-face-foreground 'org-level-6 "red3")
(set-face-foreground 'outline-6 "red3")))
You can’t perform that action at this time.