Skip to content

Instantly share code, notes, and snippets.

View rothos's full-sized avatar
👾

Rothos rothos

👾
View GitHub Profile
Tokens sold # participants # contributions QTUM raised ETH raised BTC raised
1st Presale round 7,200,000,000 LSTR 21 21 43,452.50 2,940.04 6.07
2nd Presale round 4,000,000,000 LSTR 210 272 47,462.13 804.84 1.50
Public sale 4,000,000,000 LSTR 711 720 104,849.28

Keybase proof

I hereby claim:

  • I am rothos on github.
  • I am rothos (https://keybase.io/rothos) on keybase.
  • I have a public key ASAt8x8v3SSAkd8ZexNA0FYiFfkseBczDcVNPHS1UBnGUwo

To claim this, I am signing this object:

TOOLTIP LEVEL4 METASOMETHING LEVEL2 LEVEL1 2014 LEVEL3
leg 8 Hrothgar 123
orange Cold good Utilities Schools 234 Water
barn Hot 4 345
ecuador 456 Gas
yes Admin 567 Lunches
ordinary Desserts 6 678 Dinner
squander My cat 222
verbosity Icicles don't know Snow and ice Depts 789 Ice
Flakes 890 Snow
LEVEL1 LEVEL2 LEVEL3 LEVEL4 2014 2015 2016 2017 SOURCE_OF_FUNDS DISCRETIONARY TOOLTIP TAGS SOURCE SOURCE-URL
Schools Instruction 172782 177220 271323 143715 taxes y City of Flatonia municipal archives http://
Administration 182387 143145 75409 91084 taxes y (infer?) (infer?)
Utilities Water 128324 67742 161492 164780 taxes y
Electricity 219044 75849 285512 190539 taxes y
Internet 118470 66663 156628 254709 taxes y
Town departments Legal 179628 227759 36151 195585 taxes y
Police Humans 72151 37598 132796 97143 taxes y
Dogs 20430 10967 6543 5169 fees y
Fire 142491 268714 134807 288416 taxes y
LEVEL1 2013 2014 2015 2016
Population 14035 14660 15224 16012
Median income 68037 69433 72488 71830
# of police 71 76 88 83
# of households 5002 5280 5341 5416
# of pupils 3032 3107 3256 3309
# of teachers 297 342 339 374
@rothos
rothos / compare_branches.m
Created March 13, 2015 13:20
Function for comparing timings of Chebfun methods on different Git branches.
function compare_branches(branch_a, branch_b)
%COMPARE_BRANCHES Comparing timings of Chebfun methods on git branches.
% COMPARE_BRANCHES(A,B) prints a table comparing the timings of various
% Chebfun methods on branch A and branch B, where A and B are strings.
% by Nick Hale, March 2015.
cd(chebfunroot)
doCheckout(branch_a)
@rothos
rothos / partition.py
Last active December 25, 2015 03:39
for TZ
# We are interested in finding all possible tuples of positive
# integers (a,b,c,d) such that, for a given positive integer N,
# 4*a + 3*b + 2*c + 1*d = N.
# (Recursion would make the code more parsimonious,
# but it also would obfuscate the matter.)
def partition(N):
parts = [];
for a in range( 1 + N//4 ):
for b in range( 1 + (N-4*a)//3 ):