@NathanMerrill the more serious heisenbug is the one that can be consistently reproduced in a production environment, but never shows up when you try to debug it.
So 1) put all remainders for input n in a list 2) do the same with all m<n 3) Find the shortest starting sublist of nlist that isn't a start to an mlist. Something like that?
As a little kid, I liked to play with these toys a lot:
They probably intended for these to be used for art, but I always used them for math! Fractals, patterns, etc. One time, I was given this challenge:
Build a triangle without using any of the green triangle tiles.
This challenge stum...
Winning Solitaire Mancala Boards
Mancala is the name of a family of board games that usually involve a series of cups filled with beads that the players manipulate. This challenge will use a specific rule set for a solitaire variant of the game.
The board consists of a "basket" at one end, foll...
Ruby, 46 bytes
Edit to add disclaimer/apology: This sequence starts with f[0], while the OEIS entry starts with f[1]. The values are the same.
Obfuscated code (# is any character):
->####or x##1###(#..##0#);x*=3;end;#.###ect:+}
Call like
->####or x##1###(#..##0#);x*=3;end;#.###ect:+}[3] (re...
I opened SE a few minutes ago and was pleasantly surprised to see I'd reached 2k rep, and alongside that gained access to mod tools (sehr interessant). I was mostly very confused, since I was certain mod tools come at 10k rep.
By browsing http://SITENAME.stackexchange.com/help/privileges on vari...
Every number can be represented using an infinitely long remainder sequence. For example, if we take the number 7, and perform 7mod2, then 7mod3, then 7mod4, and so on, we get 1,1,3,2,1,0,7,7,7,7,.....
However, we need the shortest possible remainder subsequence that can still be used to distin...
Is Resolve SAS Macro Variables a bad challenge? It just got downvoted. If people are voting in weird ways just to make my rep a palindrome I would appreciate it if they wouldn't.
I mostly just wanted to complain about it not being a palindrome.
@NathanMerrill for some reason, when people post heavily golfed answers in well-known languages they don't feel the need to explain them as thoroughly than when they post in an esolang no matter how well it's golfed.
@MartinBüttner This is an excellent point. I've also noticed that very few people who golf in Mathematica explain their code at all, with the exception of you.
@FryAmTheEggman I can't access the queues, so if I click the "next" button, I see "you need X rep". But seeing an individual suggested edit -- and not being able to vote -- doesn't hurt
@AlexA. He's confused that I can see the suggested edit page but not the queues.
Random Wikipedia Browsing
Here's a short one for you. Create a program or function prints or returns the title of a random Wikipedia page (similar to Alt + x functionality)
Rules:
Program or function will take no input
Program or function will print to STDOUT (or nearest equivalent) or retu...
Hey, so @QPaysTaxes wonderfully pointed out a url that makes my proposed challenge trivial to solve, is it considered acceptable to simply disallow that url?
@CᴏɴᴏʀO'Bʀɪᴇɴ In a way, you're actually right about that. If you produce 100 languages, you're more likely to produce a good one than someone else who only makes 5.
@El'endiaStarman Precisely! The ones that are good will shine, and the ones that aren't are forgotten. This one is just for trolling the programmer tho
Which one makes more sense/is more useful for a golfing language? [1 2] + [4 1] -> [5 3] (zip ish?) or [1 2] + [4 1] -> [5 2 6 3] (cartesian product ish?)?
So [1 2] + [4 1] -> [5 3] is elementwise because it is [(1+2), (2+1)] and [1 2] + [4 1] -> [5 2 6 3] is cartesian product because it is [(1 + 4), (1 + 1), (2 + 4), (2 + 1)]