« first day (1766 days earlier)      last day (3076 days later) » 

Anonymous
2:00 AM
@AlexA. That's not in the tag wiki. Also there's no specified way(s) to break ties.
 
It'd be hard to get a final tally considering how many esolangs there are that ignore many/most characters.
 
@Mego Oh, okay.
 
Anonymous
@El'endiaStarman Do you know of any algebraic expression equivalent to 0 if n%2 else 1?
 
Other than n%2? Algebraic?
 
Is mod even algebraic?
 
Anonymous
2:03 AM
Alternatively, an algebraic expression for 0 if n != 0 else 1
 
Anonymous
Well, algebraic + mod
 
Anonymous
So no transcendentals preferably :P
 
0 ** n is a Python golfing trick
 
Anonymous
And abs would lead to nightmares
 
Anonymous
@feersum Ooh perfect
 
Anonymous
2:05 AM
0^(n mod 2) will get me what I want
 
If you already used mod then why wouldn't you do 1-x ?
 
Anonymous
@feersum Because I'm quartata
 
Anonymous
The best thing is, 1-n (mod 2) == 1 - (n mod 2)
 
Anonymous
happy dance
 
@Mego I don't know what kind of mod you're using there...
 
Anonymous
2:08 AM
@feersum First one is the same as (1 - n) mod 2
 
Anonymous
The notation is more common in modular arithmetic
 
Anonymous
Specifically for congruence mod some number
 
oh ok, the notation looked different for the 2 sides somehow
 
Anonymous
3 ≡ 1 (mod 2)
 
@Mego Keep in mind that -1 mod 2 -> -1 in Javascript and other languages, but -1 mod 2 -> 1 in Python and such.
 
2:15 AM
@Calvin'sHobbies You mean -1 remainder 2 = -1.
 
Anonymous
@Calvin'sHobbies In math, -1 mod 2 == 1
 
Unless it's OCaml where the named the remainder operator mod.
 
@feersum I mean the built in % operator, whatever you want to call it
 
Anonymous
I think I have a closed-form expression now
 
Tell us o penguin
 
Anonymous
2:23 AM
hfjhkjbjksfgbytn
 
Anonymous
This OEIS entry is stupid
 
Anonymous
a(n) = 0, a(2n) = a(n), a(2n+1) = a(n) + 2^([log2(n)]+1) is what it says. It should be a(0) = 0, a(2n) = a(n), a(2n+1) = a(n) + 2^([log2(n)]+1).
 
Anonymous
Given that correction, what is a(1)?
 
Anonymous
1 = 2(0)+1, so a(1) = a(2(0)+1) = a(0) + 2^([log2(0)]+1)
 
Anonymous
Anyone else see the issue?
 
2:26 AM
...and log2(0) is undefined....hmm.
 
Anonymous
That definition is wrong in so many ways
 
Anonymous
It's incomprehendable
 
Anonymous
Ok, screw OEIS
 
20:28 -!- ERROR Closing Link: 98.196.38.177 (Sorry, server is full - try later)
20:28 -!- Irssi: Connection lost to chat.freenode.net
Server is... full?
 
Anonymous
I'm getting my own recurrence relation, with blackjack and hookers
 
2:29 AM
How is the Freenode IRC server full? O_o
 
@Doorknob wat
 
Anonymous
@El'endiaStarman Wanna take a stab at this together? :P
 
@Mego oh shit
You did not just go there
 
Anonymous
I did
 
Anonymous
I called myself an idiot
 
2:31 AM
THERE CAN BE ONLY ONE
 
Anonymous
Idiot duel? Wait we'd just stab ourselves on accident
 
Anonymous
a(0) = 0, a(1) = 1, a(2n) = a(n)
 
Anonymous
I just dunno how to fill in the rest of the values
 
@Mego a(2) = a(1) = 1. In general, a(2^k) = 1.
Okay, a(3) = 3.
In fact, a(2^k-1) = 2^k-1!
 
Anonymous
2:37 AM
Is that a factorial in your equation or are you just happy to see me?
 
It doesn't matter! :D
....wait, yes it does.
 
If I were to star an Australian, am I really down-starring them?
 
Anonymous
It does a little
 
I am not happy to see you!
 
Anonymous
Yay!
 
Anonymous
2:38 AM
I mean
 
Anonymous
Yay¡
 
I......I dunno. I'mma stop digging this hole.
ANYWAY...
a(6) = 3 as well. a(p*2^k) = a(p).
a(5) = 5.
But that's because it's palindromic in binary.
Wait, hold on. I should be approaching this differently.
How does a(2n) relate to a(2n+1)?
Well, a(...0) ?-> a(...1)...
If we flip them, we get a(0...) ? a(1...).
0... + 2^m = 1...
For some value of m.
Specifically, m = floor(log_2(...0))+1.
 
Anonymous
a(0) = 0, a(2n) = a(n), a(2n+1) = 2^(n+1)+a(n)
 
But you have to floor it.
 
Anonymous
So in general, a(0) = 0, a(n) = (n mod 2)*2^(floor(lg(n/2)+1)) + a(floor(n/2))
 
Anonymous
2:45 AM
@El'endiaStarman floor((2n+1)/2) == n
 
You're missing the log_2.
 
Anonymous
Oh right
 
I could do this in Minkolang.
 
Anonymous
Fixed it
 
Anonymous
Does that look right to you?
 
Anonymous
2:47 AM
lg == log_2
 
Hmm. I think (1 - n mod 2) should just be (n mod 2). You only want the more complicated part when n is odd.
 
0
A: Sandbox for Proposed Challenges

sysreqPrettyprinted Titleboxes please read the whole post before answering! This is a prettyprinted titlebox, using unicode box-drawing characters (code points U+2550, U+2551, U+2554, U+2557, U+255A and U+255D) for the box's borders, generated with a small fair amount of Python. Everything is built f...

 
Anonymous
True
 
Edited for you.
 
Anonymous
ty
 
2:51 AM
Edited again to swap lg and floor. We want to floor after, not before.
 
Anonymous
We also want to floor before
 
Anonymous
2^floor(lg(floor(n/2)+1))
 
Anonymous
hue hue floor before rhymes
 
hmm
Will it be such a problem to not floor n/2?
Hey wait! lg(n/2)+1 = lg(n)!
 
Anonymous
Tricksy starmans
 
2:55 AM
Starmen?
 
Also, since floor(n/2) = (n - n%2)/2, lg(floor(n/2)) = lg(n - n%2)-1.
 
Anonymous
@El'endiaStarman Not true, let n=1
 
Apparently, the Burgess Meredith penguin doesn't know how bad an idea a solid gold tank is.
 
@Mego whoops, edited
 
What problem are you guys solving again..?
 
Anonymous
2:58 AM
11
Q: Reverse and square

orlpIn this challenge you will compute numbers from a curious sequence. Your input is a single decimal nonnegative integer. Reverse the bits in this integer and then square the number to get the required output. When reversing the bits you must not use any leading zeroes in the input. For example: ...

 
I'm just watching the Adam West batman tv series
It's kind of silly
 
@AlexA. Starmoon
 
Anonymous
I'm doing something horribly wrong with this recurrence relation
 
Anonymous
Because I keep ending up with lg(0) in a(0)
 
Err...base-case it?
 
Anonymous
3:01 AM
I mean solving the recurrence relation :P
 
oh
I'm just gonna implement it directly in Minkolang.
That'll be eligible for the bonus, I'm sure.
 
Anonymous
Well the OP specifically mentioned an algebraic solution
 
Anonymous
Oh wait he said "such as"
 
> -50% bonus if you never convert the number to/from binary.
 
@Mego The OrlP ;)
 
Anonymous
3:05 AM
I'm 99% certain I can't implement the recursive form in Seriously in under 14 bytes
 
...they changed the riddler
 
a(0) = 0, a(1) = 1, a(n) = (n%2)*2^(floor(lg(n - n%2))) + a(n//2)
Crap. I don't have floor. Oh well. Guess I'll have to use d1%-...
 
Anonymous
Yep, it's way too long
 
Anonymous
I've got 18 I think
 
That's quite close though.
 
Anonymous
3:08 AM
I can't do recursion well in Seriously
 
Neither Microscript nor Microscript II does it very well yet either
 
Anonymous
And my brain is too broken to work out a closed-form solution
 
I should add a feature to Microscript II for that
 
@Calvin'sHobbies Sailor Starmoon
 
Anonymous
I'll just wait until someone else figures out the closed-form and grab it :P
 
3:17 AM
@AlexA. Sail to the stars and moon earth
 
It's not often you leave for a week or so and come back to find your prayers have been answered :D
 
@Geobits Welcome back. <3
 
@Geoblitz >:[
 
Anonymous
@Geobits You left? I guess that explains why I haven't been getting downvotes.
 
It wasn't like a planned leave of absence or anything, just haven't been hanging out here over the holiday.
 
Anonymous
3:20 AM
@VoteToClose You should change your name to GoatToClose, to match @Downgoat
 
@Mego Oh, here, hang on
 
Anonymous
@Calvin'sHobbies ;_;
 
I can go back over the new Q/As if you want me to catch up :P
 
@Geobits Yes iff I end up with net positive rep
 
Hmm. I very seldom find something of yours to downvote, to be honest. You should answer more; you're too good at asking :P
 
3:24 AM
The problem is that his answers are good too
However sparse
 
Mine? Meh, they're ok
 
Ah. I don't really remember his answers much. I just know he's good at posing challenges.
Let's see... clicks profile
 
Questions are way easier than fussing with golfing. My last 3 were super easy to write
One more rep point and my rep will match my id number 26997 :O
 
It's not easy to get exactly one rep ;)
You could accept something and then downvote an answer, I guess.
 
Anonymous
I wonder how much of a correlation there is between the number of days a user has been a member of PPCG and the ratio between their rep and their user ID
 
3:29 AM
Goodnight everyone.
 
Anonymous
Or more generally, the correlation between the ID and the ratio of rep to ID
 
Anonymous
Quick someone calc it on data.SE
 
@Geobits Downvoting codegolf.stackexchange.com/questions/65290/… didn't seem to do anything
 
@Mego I'd guess the higher the ID, the lower the ratio (in general). Crunching the numbers is left as an exercise for the reader ;)
 
@Calvin'sHobbies There's no rep penalty for downvoting questions
 
3:31 AM
> downvote an answer
 
@AlexA. Woah O.O How did I not know this!
 
Uh, idk. How didn't you know that?
 
Anonymous
@AlexA. News to me, brb
 
...what is up with you high rep users not knowing basic things about the SE system?
 
Anonymous
downgoats everything
 
Anonymous
3:32 AM
@El'endiaStarman My account is barely a month old. Granted I'm not a high-rep user, but I wanted to weigh in anyway.
 
I'm not high-rep either, I just know things >_>
 
Anonymous
Calvin is too busy writing questions all the time to notice minutae like that
 
There's no rep penalty for the downvoter that is. The user whose question is being downvoted loses rep.
 
Anonymous
@Geobits Like who starred what? :P
 
@Geobits You're not high rep? I would say so.
 
3:33 AM
@El'endiaStarman Hey, you didn't know about the self-deletion no editing rules
 
Anonymous
@AlexA. No he only has 80
 
@Calvin'sHobbies That's not basic...
 
@AlexA. I don't know what counts for "high-rep" here, to be honest. I don't feel high-rep.
 
Anonymous
@Geobits Dennis and Martin :P
 
@Geobits You're high rep to me. <3
 
3:35 AM
@Mego Exactly! :D
 
Anonymous
Dennis and Martin are high-rep. The rest of us are loser peasants who grovel at their feet to have a chance to gaze upon their glorious Legendary badges.
 
Speak for yourself :P
 
Legendary is one badge I just know I won't ever get, so I don't gaze longingly at those. The ones that feel obtainable are the worst.
 
How many users are the sole owners of one type of badge?
 
Anonymous
@AlexA. Right, you don't grovel, you're just a loser :P
 
3:37 AM
(me! :D)
 
Anonymous
@Calvin'sHobbies You
 
Anonymous
:P
 
@Geobits 1) You're on the front page of users sorted by all-time rep, and 2) you have more than 10k. You're high rep.
 
Anonymous
Martin used to be until Dennis got Legendary
 
@Calvin'sHobbies Well, I know Martin is our only Copy Editor.
Or is close to it
 
Anonymous
3:37 AM
Martin also has the only Refiner
 
@El'endiaStarman Ok, #1 sounds like a pretty good qualifier. #2 uses straight numbers, so it's iffy. 10k on some sites is a lot different than 10k on others.
 
Anonymous
Justin has Research Assistant
 
Anonymous
@Calvin'sHobbies ninjo'd
 
Anonymous
So Martin x2, Calvin, and Justin
 
Anonymous
3:38 AM
Copy Editor, Refiner, Socratic, Research Assistant
 
2 silver, 2 gold
 
Only 3 Reversals, and two of them from the same [code-trolling] Q.
 
@Geobits I like Reversal. I have 6 of em on meta.SE. :D
 
Stop answering bad questions then :P
 
Anonymous
sepp2k has Meta Guru, PhiNotPi has Meta Populist, Martin has Meta Strunk and White and Meta Sportsmanship
 
Anonymous
3:40 AM
So if we count Meta: Martin x3, Calvin, Justin, sepp2k, PhiNotPi
 
There are a few for the taking; we have several badges that haven't been awarded at all yet.
 
Anonymous
Until Martin nabs them
 
I think he's too far gone for Tenacious or Unsung Hero ;)
I'm not sure those will ever be given to anyone (here).
 
I'm 67/100 of the way from stealing @Calvin'sHobbies's Socratic sole-ownership-ness. :P
 
>:D
 
Anonymous
3:43 AM
Nobody has the election badges? Did the pro-tem elections not count?
 
No
 
What pro-tem elections?
 
They were informal
@Doorknob Dennis and me
 
Anonymous
Ahh
 
@Geobits @AlexA. @Mego The 4 of us combined are about a Dennis' worth in rep
 
3:43 AM
@AlexA. You weren't elected
You were appointed
 
Anonymous
@Calvin'sHobbies \o/
 
In technical terms, at least.
 
36 secs ago, by Alex A.
They were informal
So yeah, not in technical terms. But in spirit. :P
 
@Calvin'sHobbies I can't decide whether to feel elated or depressed at this. I may go with indifferent.
 
I share Inquisitive on meta with Martin, but I got it over a year ago and he just got it a few months ago. :P
 
Anonymous
3:45 AM
So really we have 4 badges that we can get, until New Years Day
 
@Doorknob Huh, go figure. People who were mods earlier got meta badges earlier :P
 
And @Geobits @AlexA. and @Mego alone are about a Calvin's Hobbie
 
Anonymous
Illuminator, Marshall, Tenacious, and Unsung Hero
 
@Doorknob Don't you have the moderation one?
 
@Calvin'sHobbies Is that the proper singular of Calvin'sHobbies?
 
3:46 AM
@Mego I'm about halfway to Marshall on SO, if that counts :P
 
I'd have thought a 'y' was appropriate there.
 
@AlexA. Yes, but so do all the protems, including Chris, dmckee, and gnibbler.
 
Anonymous
@AlexA. Hmm... Lemme see here... Nope. No cigar.
 
@AlexA. You don't have it yet? Pshh, slacker. :P
 
>:O
You have to be a mod for a year, right?
 
3:47 AM
Yes.
 
I've been one for like... a month? :P
 
Oh, right. 3 months actually.
 
That's, like, the entire lifespan of some bugs.
 
Or the memory span of goldfish, per some research
Well, I've survived a few months of pro-tem moderating, I guess I can die happy.
 
@Geobits Whatever sounds good
 
Anonymous
3:48 AM
@AlexA. grabs the sword
 
@Mego Just let him make the first cut, so he can die with dignity.
 
@AlexA. You survived Alexgate
 
What in the world is Alexgate?
 
^^ t-shirt
 
Anonymous
At least Alex, Dennis, and Martin won't have to wait long until they get their mod badges
 
3:50 AM
Because we're graduating soon?
 
Martin should be really soon if he doesn't already have it
 
Anonymous
Just until New Years Day
 
@AlexA. Don't encourage his gold medal count >:G
 
Really though, what is Alexgate?
 
@Geobits December 19th!
 
3:51 AM
No offense, but I have no idea what a >:G face is supposed to mean.
 
@AlexA. The fact that you don't know what Alexgate is. Scandalous!
(and yes, I realize that's a paradox-ish)
 
"How do you respond to charges that you aren't even informed about the ongoing scandal?"
 
@AlexA. It was just after carrotgate
 
Carrots makes terrible gates. Waaaay to easy to break through.
 
3:53 AM
@Geobits I do take offence :g
 
That one looks like a snail mouth.
 
Anonymous
How could Alex not know about Alexgate?
 
Anonymous
I've been here for barely over a month and I know about Alexgate
 
Anonymous
Oh well, maybe it's better that he doesn't know
 
3:55 AM
^
 
Anonymous
v
 
December 19th? Niiiiice.
 
Depends on the cake. If it's cheesecake, then it's true for sure.
 
Anonymous
In my headcannon, the mods actually know when PPCG will graduate, but they don't tell us because they're entertained by our guessing. It's like the Truman Show. Same with @ಠ_ಠ's identity.
 
Anonymous
3:56 AM
@Geobits Sopapilla cheesecake?
 
Pretty much any cheesecake.
 
0
A: Reverse and square

El'endia StarmanMinkolang 0.14, 43 - 50% = 21.5 First answer to claim the bonus! Thanks to Mego for inspiring this. n1{d1`,2$3*&$z2zd2%-2l$Md1%-;z2%*z2:{+}2;N. Test the code here and check all test cases here. Explanation This uses this recurrence relation: a(0) = 0 a(1) = 1 a(2n) = a(n) a(2n+1) = a(n) + ...

@Mego ^
 
@Mego They do know. They told me and swore me to secrecy.
 
@Geobits Code Review got their refurbish. Bracket medals and all
 
Anonymous
I have a pan of sopapilla cheesecake in my fridge right now
 
Anonymous
3:58 AM
The urge to get a slice is hard to resist
 
@Mego We do know who ಠ_ಠ is, but we can't say because it's private information. Although the speculation can be amusing.
 
@Calvin'sHobbies Oh, that looks pretty nice. I wasn't sure what to expect for their theme.
 
Yeah. I like it.
 
Anonymous
@AlexA. You mean "we won't say because it's me"?
 
3:59 AM
@Mego It's not. :P
 
@Mego That is not what I mean
 
@Calvin'sHobbies The rivers in the text are an 'A' if you squint at them :P
 

« first day (1766 days earlier)      last day (3076 days later) »