lbolla

Consider n = 1729.

Pick a = 1722.

a^[(n-1)÷2] mod n = 742

Therefore 1729 is composite.

The test seems to hold, here.

Same here. The only drawback is that you have to remember your Dropbox password by heart!

Haskell is fast ;-) (and beautiful)

   main = putStrLn . show . sum . take 3000000 $ repeat 1

(Ignoring the random generation, that does not play a role here, does it?)

Here is mine:

https://github.com/lbolla/dotfiles/blob/master/githooks/pre-...

It PEP8-fies and pyflakes .py files and gjslint-ifies .js files. Other actions can be easily added!

Google cached version: http://webcache.googleusercontent.com/search?q=cache:KJXbNFy...

Is it just me or delicious.com is now terribly slow?

Overall, I'm not impressed.

* the "Hi, <my-name>" dropdown menu must be the most horrible I've ever seen;

* why do I need to have a picture?! I just want to save/share bookmarks!

* all this "stack feature": I barely see the point. grouping can be done with tags (well done with allowing tags with spaces!).

The implementation of the binary_search algorithm (https://github.com/nzakas/computer-science-in-javascript/blo...) is bugged by the infamous (http://googleresearch.blogspot.com/2006/06/extra-extra-read-...) "integer overflow" bug:

   middle = Math.floor((stopIndex + startIndex)/2);

This is the result using cloc:

  Bench        files        blank          comment        code
  cpp          4            145            236            501   
  go           5            153            239            546   
  go_pro       5            132            233            457   
  java         8            151            352            605   
  java_pro     8            157            351            772   
  python       2            110            204            334   
  scala        2            104            224            384   
  scala_pro    2             59             62            230

Templates are not used in the C++ benchmark.

I tried to install the iTerm2 colorscheme and also the vim colorscheme, but they look nowhere near the screenshots. Anyone having issues like this?

Just picked one from the red list (pytz) and it looks like Py3.1 is supported...

After reading all these interesting and enlightening comments (no pun intended here, there are all really useful), the blog post should really be titled: "A particular SBCL-compiled LISP-implementation of a specific algorithm gives comparable results to an analogous GCC-compiled C-implementation, when run on particular boxes."