''=~(        '(?{'        .('`'        |'%')        .('['        ^'-')
    .('`'        |'!')        .('`'        |',')        .'"'.        '\$'
    .'=='        .('['        ^'+')        .('`'        |'/')        .('['
    ^'+')        .'||'        .(';'        &'=')        .(';'        &'=')
    .';-'        .'-'.        '\$'        .'=;'        .('['        ^'(')
    .('['        ^'.')        .('`'        |'"')        .('!'        ^'+')
   .'_\{'      .'(\$'      .';=('.      '\$=|'      ."|".(      '`'^'.'
  ).(('`')|    '/').').'    .'\"'.+(    '{'^'[').    ('`'|'"')    .('`'|'/'
 ).('['^'/')  .('['^'/').  ('`'|',').(  '`'|('%')).  '\".\"'.(  '['^('(')).
 '\"'.('['^  '#').'!!--'  .'\$=.\"'  .('{'^'[').  ('`'|'/').(  '`'|"&").(
 '{'^"[").(  '`'|""").(  '`'|"%").(  '`'|"%").(  '['^(')')).  '\").\"'.
 ('{'^'[').(  '`'|"/").(  '`'|".").(  '{'^"[").(  '['^"/").(  '`'|"(").(
 '`'|"%").(  '{'^"[").(  '['^",").(  '`'|"!").(  '`'|",").(  '`'|(',')).
 '\"\}'.+(  '['^"+").(  '['^")").(  '`'|")").(  '`'|".").(  '['^('/')).
 '+_,\",'.(  '{'^('[')).  ('\$;!').(  '!'^"+").(  '{'^"/").(  '`'|"!").(
 '`'|"+").(  '`'|"%").(  '{'^"[").(  '`'|"/").(  '`'|".").(  '`'|"%").(
 '{'^"[").(  '`'|"$").(  '`'|"/").(  '['^",").(  '`'|('.')).  ','.(('{')^
 '[').("["^  '+').("`"|  '!').("["^  '(').("["^  '(').("{"^  '[').("`"|
 ')').("["^  '/').("{"^  '[').("`"|  '!').("["^  ')').("`"|  '/').("["^
 '.').("`"|  '.').("`"|  '$').",".(  '!'^('+')).  '\",_,\"'  .'!'.("!"^
 '+').("!"^  '+').'\"'.  ('['^',').(  '`'|"(").(  '`'|")").(  '`'|",").(
 '`'|('%')).  '++\$="})'  );$:=('.')^  '~';$~='@'|  '(';$^=')'^  '[';$/='`';

That there is some nice formatting  

Source: http://www.99-bottles-of-beer.net/language-perl-737.html
Bottling (and obfuscating) done by: Acme::EyeDrops

On the other hand, I manage to hit my newsfeeds on Google Reader semi-regularly.  I tend to just skim the headlines on the BBC News feed, and I may not read all of my articles, but it’s nice to have them there.  Unfortunately, the SANS NewsBites RSS has the headline and then a tiny bit of the actual article.  And I like to read the SANS articles or notes from the editors and the related links a bit more frequently than I do the BBC … And I really hate having to open a new window for every article. 

So one of the things I worked on the last few days was to set up a system whereby I could convert the emails to an RSS feed.  And I have!  SANS NewsBites E-Mail RSS

It’s still a work in progress, but if anyone wants to use it, I’ll be seeding it through the weekend probably, not sure how many old newsletters I’ll bother with but the feed is set to show the entries entered in the last seven days.  And I’m still working out how to display everything well, since the <script></script> tags I obviously want to escape out to make them visible, but if i do that they become &lt; instead, but if I leave them in I’m afraid they’ll parse  Still working on that one …  I’m sure there are other issues with it that I’ll hammer out over time.  For now it looks like it will work ‘decently’ so I’m running with it.  The next step is to set up something to auto-parse the emails so I don’t have to log in to get them in.  

And once I have this one working , I may look at SANS Ouch! and @RISK too … but those are more freeform and self-related …

But it’s a thought for getting more bits.  Because as proven by the DES example that I’ve been working on FOREVER, doing the demonstrations for cryptography by hand is slow

And then I read it to Kiir.  The problem is to find the smallest number evenly divisble by all the numbers from 1-20.  We decided that it didn’t mean at the same time, since that’s factorial

And then … *sigh* I felt compelled to find the answer.  My answer and logic after the break

Basically what I did was try to figure out, roughly and quickly, what the minimum value would be.

I took 20, because it gave me 20 10 5 4 2 1, good start.  Then I took 9, which gives me 9 and 3.

From those two 6 15 12 and 18 “fall out” (the combination of values, 3*2, 3*5, 3*4, 9*2)

Then I needed the prime numbers (7 11 13 17 19) because they can’t be dodged.  They’re prime, after all.

After that I’m missing 16 and 8, so I multiplied by 4 (combined with the 2 and 4 from the 20 to give 8 and 16).

Then I realized that I maybe didn’t need the 20, so I took the primes, 5 9 and 16.

Both answers gave me 232,792,560 (well, the second way gave me a smaller number, but that was because I forgot the 7)

So … that’s my answer.