sleepynate

#!/bin/zsh
#
# Set cpu scaling policy the convenient way.
#
# nathan (period) dotz (at) gmail (period) com
#

max_cpu() {
	echo performance | sudo tee /sys/devices/system/cpu/cpu0/cpufreq/scaling_governor
	echo performance | sudo tee /sys/devices/system/cpu/cpu1/cpufreq/scaling_governor

sleepynate

; Project Euler Problem 2
; Solution by nathan dotz - nathan (period) dotz (at sign) gmail (period) com
;
; Each new term in the Fibonacci sequence is generated by adding
; the previous two terms. By starting with 1 and 2, the first
; 10 terms will be:
; 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
; 
; Find the sum of all the even-valued terms in the sequence
; which do not exceed four million.

sleepynate

; Project Euler Problem 1
;
; If we list all the natural numbers below 10 that are multiples of 3 or 5
; we get 3, 5, 6 and 9. The sum of these multiples is 23.
;
; Find the sum of all the multiples of 3 or 5 below 1000.
;
; solution by nathan dotz
; nathan (period) dotz (at sign) gmail (period) com

sleepynate

; Project Euler Problem 1
;
; If we list all the natural numbers below 10 that are multiples of 3 or 5
; we get 3, 5, 6 and 9. The sum of these multiples is 23.
;
; Find the sum of all the multiples of 3 or 5 below 1000.
;
; solution by nathan dotz
; nathan (period) dotz (at sign) gmail (period) com

sleepynate

#!/usr/bin/env python
class cpu_info:
     def __init__(self):
         self.user = 0
         self.sys = 0
         self.idle = 0
         self.iowait = 0

     def copy(self,inf):
         self.user = inf.user

sleepynate

import turtle

i = 10
while (i < 1000):
    turtle.forward(i)
    turtle.left(120)
    i += 5

sleepynate

#!/usr/bin/env python
# generate gibberish for filling up webapp pages

import random

def sploot(yarfle = 10):
    berdankle = open('/usr/share/dict/american-english').readlines()
    return " ".join([ random.choice(berdankle).strip() for schmicknoch in range(yarfle) ])

if __name__ == '__main__':

sleepynate

{-
 - Project Euler Problem 3
 - Solution by nathan dotz - nathan (period) dotz (at sign) gmail (period) com
 -
 - What is the largest prime factor of the number 600851475143 ?
 -}
bignum = 600851475143
divisors = [x|x<-[3,5..(floor(sqrt(fromIntegral(bignum))) `div` 6)], bignum`mod`x==0 ]
answer = last ([ x | x <- divisors, x> 1 && (all (\n -> x `mod` n /= 0 ) $ takeWhile (\n -> n*n <= x) [2..]) ])
main = putStrLn $ "The largest prime factor of " ++ show bignum ++ " is " ++ show answer

sleepynate

;
; Project Euler Problem 3
; Solution by nathan dotz - nathan (period) dotz (at sign) gmail (period) com
;
; What is the largest prime factor of the number 600851475143 ?
;
;

(ns euler3)

sleepynate

; Project Euler Problem 2
; Solution by nathan dotz - nathan (period) dotz (at sign) gmail (period) com
;
; Each new term in the Fibonacci sequence is generated by adding
; the previous two terms. By starting with 1 and 2, the first
; 10 terms will be:
; 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
; 
; Find the sum of all the even-valued terms in the sequence
; which do not exceed four million.