Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today
130Rank
4Badges
1910Score

blaat submitted Solution 227404 to Problem 325. 2 b | ~ 2 b

on 5 Apr 2013

blaat received Cody Challenge Master badge

on 14 Mar 2013

blaat submitted Solution 32734 to Problem 74. Balanced number

on 21 Jan 2013

blaat submitted Solution 147846 to Problem 556. Stuff the Board

on 13 Oct 2012

blaat submitted Solution 144810 to Problem 68. Kaprekar Steps

on 5 Oct 2012

blaat submitted Solution 44094 to Problem 176. Nearest

on 17 Feb 2012

blaat submitted Solution 44080 to Problem 224. pressure to dB?

on 17 Feb 2012

blaat submitted Solution 43935 to Problem 300. Remove NaN ?

on 17 Feb 2012

blaat submitted a Comment to Solution 41338

What it does: it finds the maximum number of occurrences for each prime number smaller than x in the factorisations of the numbers 1:x (e.g., for x = 10, the maximum number of occurrences for 2 is 3, since 2*2*2 = 8). If the product of all prime factors taken to the power of their maximum # of occurrences is then taken, the smallest number that is divisible by 1:10 is obtained. So for x = 10: 2 * 2 * 2 * 3 * 3 * 5 * 7 = 2520.

on 14 Feb 2012