The unique style of the diagrams at xkcd has an informative but nice hand-drawn touch. I guess they are actually drawn by hand but just recently on our partner site for Mathematica someone asked how to draw a similar diagram such as this one with Mathematica's plot functions (xkcd-style-graphs).
...
I would like to use TikZ for drawing a christmas tree. Here's a start, I used the lindenmayersystems library for drawing a tree:
\documentclass{article}
\usepackage{tikz}
\usetikzlibrary{lindenmayersystems}
\begin{document}
\begin{tikzpicture}
\draw [color=green!50!black, l-system={rule set={S ->...
well SO just gets so many questions that they are pushed the active pages of tags really quickly, whereas here people actually use the front page and don't miss any question
also, due to that and being a smaller site, it's easier for questions from PPCG to make it into the HNQ
GolfScript can do just about everything by cheating and calling out to Ruby. But that's more an artifact of the way string parsing is implemented than a real part of the language.
CJam, size 51
Code
main(int argc,char* argv){printf("Hello, World!");}
Output
59
2229222139722292222223199710335725111032222222333337251122553372511222222221397357223333112319231925923192319222559
This should be more crackable than it looks.
I'm currently trying to figure out how to get a zero-width space onto my clipboard in Linux, so I can make a post on a forum without :) being turned into <img src="styles/default/xenforo/clear.png" class="mceSmilieSprite mceSmilie1" alt=":)" title="Smile :)">, haha
That just reminded me... on one forum I use, there is a weird bug which allows people to insert HTML into the page. For example, cause the rest of the page to be bolded instead of just their own text.
I remember being a kid on the neopets boards, amazed at threads full of people injecting <marquee> without a closing tag. As they nested, each one went faster and faster (since they were moving at a constant rate inside another element that was also moving). It was incredible.
I must be a programmer. I couldn't remember if you capitalized "foo" in "Here's a list: foo, bar, baz.", so I went to google and looked it up. Pretty sure most people don't say "element" there. :P
@MartinBüttner How did you get those two pairs of numbers? I didn't find a solution with either one in either order, in all subsets of those characters.
@user23013 I took the tangent of the output.. and then Mathematica has Rationalize which gives you a rational number that is accurate up to some precision. those two pairs are the only reducible pairs that give the correct arctangent for all the relevant digits
both of those are too short for the 24 characters we have though
@user23013 if you try with arbitrary numbers generated by strings and base conversion you can swap out the last couple of characters or so... so it is more accurate than I thought, but there is some degeneracy
@user2179021 The big issue with brute-forcing it is memory consumption. Even if one switches to a Bloom filter approach for detecting duplicates, it needs on the order of 2^(2n) bits. So I think that 32/x is about the limit without getting into disk-backed operation.
Yes, it could be split into multiple parts with recalculation to keep it all in memory. That's complex, but it might allow you to extend n by a bit and keep the running time semi-reasonable.
Oh, I may have read too much into "This algorithm is based on a new time and space efficient algorithm for finding all collisions of a function f from a finite set to itself that are reachable by iterating f from a given set of starting points."
When I saw that "Polygon Traversal" post just now, I thought "that's an interesting title"... and then I saw the tags and though "uh oh..." ... and then I opened the question :(
Now, so far, every part of Property X has been conserved: any combination of columns with the same sum in the original give the same sum in the new matrix.