## architectureblog via

<p>architectureblog:</p> via:

<p>architectureblog:</p> via:

# Project Euler: Problem 1 # Use Module:Enumerable # Sum some numbers (5..10).inject { |sum,n| sum+n } # find the sum of all multiples of 3 and 5 below 1000 ...

90% of success is showing up —

The Daily Show With Jon StewartMon - Thurs 11p / 10cBarney Frank's Town Hall Snapswww.thedailyshow.com</embed>Daily Show Full EpisodesPolitical HumorHe...

All courses of action are risky, so prudence is not in avoiding danger (it’s impossible), but calculating risk and acting decisively. Make mistakes of ...

Seth writes as advise for job seekers, I like to do a few things in this list as well Seth writes: Graduate school for unemployed college students Fewer coll...

First, you need to get the Solver Foundation assemblies from here. Then head to Resolver One and paste this sample code into the editor and hit recalculate t...

<p>I made a Sudoku Solver in the Resolver One environment, using the Microsoft Solver Foundation. The kernel of this sheet is to implement Sudoku as a ...

I posted a spreadsheet to calculate option prices using ‘Binomial option pricing method' at Resolver One site. The core idea is from Cox et al. (1979)...