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

12:00 AM
My grandpa has awful English and he spells "alphabet" as "alfebit."
 
Geobits's cousin
 
Hehehe
 
Do chat pings still makes sounds for everyone?
 
Yeah
You can mute them
 
Mine has not for a couple of months.
 
12:01 AM
I just always have sound off on my laptop ¯\_(ツ)_/¯
 
@Doorknob ಠ_ಠ
 
What?
 
One does not simply ignore chat pings.
 
@Calvin'sHobbies Wow, that was a hard choice.
 
@feersum Look for the volume horn next to the "All Rooms" button
 
12:02 AM
@AlexA. I don't ignore them. I keep a browser window open perpetually on my laptop monitor, so I see notifications as *s in the chat tab.
 
> when mentioned (current setting)
 
Meme coming up
 
@feersum Turn up your volume
 
@feersum Get working speakers
 
I have 1 working speaker
Is that not enough?
 
12:03 AM
 
@El'endiaStarman I figure a yardwork company couldn't do too much harm
 
Yardwork is hardwork
 
@feersum Pings require 22.2 surround sound
 
@Calvin'sHobbies It's not enough to "not do much harm"...you have to also "not let harm happen", and in that case, I think a landscaping company would not do very well. :P
 
Ok bye guys!
 
12:06 AM
Are we allowed to opt-in to stealth pinging?
 
no
 
I opt in!
 
@PhiNotPi Good question. I don't mind them if they are just occasional.
 
I won't hear a thing so go right ahead.
 
@Doorknob Might it not make more sense to only ban people for stealth pings when it is clear that it's bothering others? (Like with Sock earlier.)
 
12:09 AM
I think if there's one thing that'd be more of a pain for a dev to implement than removing stealth pinging entirely, it's making it opt-in.
 
> Their use may result in a suspension
 
@AlexA. I think Phi just meant "can we freely use stealth pings against people who won't be bothered by them".
 
Oh, I see.
 
Oh. Uhh, sure, I guess... just don't overdo it.
 
I'm running into some lag with the Scratch online editor again :(
 
12:18 AM
Dorden Alemar would be a nice character name for PPCG fanfiction
(I hope someone got it)
 
I get it :P
 
Anonymous
Too busy mathing to get it, sorry
 
@Doorknob Oh but i'm stupid, it would be Dooden
 
Now I've got it too. :P
 
Anonymous
Got it :P
 
Anonymous
12:23 AM
Would it be Alemar or Marale?
 
Marden would be a legit surname. Or was it Marsden? Shoot.
 
Dengnidoo Alemar
 
@VoteToClose I tried. Too many bytes. :(
The problem is that I don't know how many repeats of the whole sequence to have other than by duplicating it W*H times...and to do that without W and H also getting duplicated is not easy.
 
I didn't get the joke!
 
12:31 AM
Meanwhile, in minecraft: I just noticed that I accidentally put three gold chestplates in the wrong chest.
 
@SuperJedi224 That's fascinating
 
allo again
 
@quartata Hi
 
I may or may not have run into a tiny problem implementing my modification to Martin's sequence
Well, I wouldn't describe it as a problem per se
It's more like something that makes it boring...
 
Is it now totally x=y? :P
 
12:34 AM
For the numbers n < 9 the shortest base is usually n :P
So you end up with this lame 1x1 matrix
It's fine after that.
Anywho, I've made some changes to what my sequence is going to be like.
So it starts out like Martin's, but instead of transposing
It takes the top row and iterates through it
 
@Doorknob Can you make it so @Dengnidoomarale will ping all the mods simultaneously? c:
 
@quartata Uh, 8 in base 2 is 1000, which has 4 digits, which is a square number.
 
Anonymous
2^([log2(n)]+1) is the dumbest way ever of writing 2n
 
@El'endiaStarman Right, that's an exception. It still means for the rest that my method is just going to produce points at 0
As I was saying...
 
@Calvin'sHobbies oh! Hahaha
 
12:36 AM
@Calvin'sHobbies no :P
 
0
A: Sandbox for Proposed Challenges

TanMathDetermine if a number is a square palindromic number Just some time ago, I was looking at my user number, 10401, and realized it is a palindromic number with only squares. So now, I want to find many more number like this, and you can help me by writing s program that detects whether or not a nu...

 
check out my new sandboxed post!:
0
A: Sandbox for Proposed Challenges

TanMathDetermine if a number is a square palindromic number Just some time ago, I was looking at my user number, 10401, and realized it is a palindromic number with only squares. So now, I want to find many more number like this, and you can help me by writing s program that detects whether or not a nu...

 
...
 
Wow.
The bot beat you.
:P
 
No!!
 
12:37 AM
For the first element, it takes the mod (number of rows) of it and removes that row from the matrix.
 
You just got ninja'd by a bot
10
 
Anonymous
Holy shit that's the first time the bot has ever ninja'd someone
 
Come On!
stupid internet connection!
 
@Doorknob Ninja msg ninja'd :(
 
:D
 
12:38 AM
For the second element, it takes the mod (number of columns) of it and removes that column from the matrix.
And so on.
 
I have still made history!
 
I think the results will be fairly interesting.
Especially at higher numbers
 
@TanMath Anyway, so, all digits have to be 1, 4, or 9?
 
Why did that just got downvoted?
 
Anonymous
12:39 AM
Because it's trivial and not interesting
 
© 2015 Calvin's Hobbies, Inc.
 
Anonymous
It's a near-dupe of the palindrome challenge
 
@anOKsquirrel I finished the animation, finally
 
Oh. I haven't read it yet...
 
@AlexA. Hmm?
 
12:40 AM
Maybe if it wasn't each digit
 
@Calvin'sHobbies Mmmmhmmmmm
 
Anonymous
Hey @El'endiaStarman I have a question for you, because you are good at math and usually not wrong
 
@Mego This isn't true
 
@Mego ಠ_ಠ
 
Anonymous
12:41 AM
It's simple math, but I still don't trust Alex
 
I'd give you my quote of but I can't find it
 
Anonymous
floor(n/2) == (n - (n mod 2))/2
 
sigh
 
...
I don't have any arrows
 
Anonymous
9 mins ago, by Calvin's Hobbies
@SuperJedi224 That's fascinating
 
12:42 AM
@Mego Yeah, that should work. Why not n//2 though?
 
Anonymous
@El'endiaStarman Because pure math context
 
@Mego always true
Oh wow ninja'd by Elendia :(
 
Alright. It is indeed always true; it'll even work for negative numbers.
(It'll be different from int though, but you don't care about that.)
 
Anonymous
Luckily I don't have to care about negative numbers :P
 
Anonymous
Only n >= 0
 
Anonymous
12:43 AM
Actually only positive integers
 
it works
Except for oven numbers (odd and even)
 
Anonymous
Hmm
 
Anonymous
Now I have 2 problems
 
Anonymous
I need a simplified way of expressing the self-composition :P
 
Anonymous
So floor(floor(n/2)/2)
 
12:46 AM
floor^2(n/2)?
 
Anonymous
Not sure if trolling...
 
Hmm. That doesn't quite work.
Well, I like the syntax of saying that f^2(x) = f(f(x))...
 
Anonymous
((n-(n mod 2))/n - ((n-(n mod 2))/n mod 2))/n doesn't exactly roll off the keyboard
 
meta.codegolf.stackexchange.com/a/7610/26997 is not all that different from my well received supreme primes challenge, so idk if it should be written off so soon.
30
Q: Find the largest prime whose length, sum and product is prime

Calvin's HobbiesThe number 113 is the first prime whose length 3 is prime, digital sum 5 = 1 + 1 + 3 is prime, and digital product 3 = 1 * 1 * 3 is prime. A prime that has these 3 properties will be called supremely prime. The primes 11117 and 1111151 are other examples. Goal Write a program that can find the...

 
@Mego Confirmed by WolframAlpha: wolframalpha.com/input/…
 
12:47 AM
But that doesn't work here because you need f(f(x/2)/2). Hmm. Maybe it does work...
 
WolframAlpha is usually not wrong
@El'endiaStarman I like this syntax too
 
I'm trying to remember what common example uses that syntax.
 
Anonymous
Let f(n) = floor(n/2). I need f(f(n))
 
Anonymous
More generally, I need f^k(n)
 
I thought of sin^2(x), but that's sin(x)^2, and I've done that with ln^2(x) = ln(x)^2 before.
 
12:49 AM
It uses the syntax but not the meaning
I think that's why people don't use that syntax
 
@El'endiaStarman Nth derivatives can have that syntax
 
I still like it
I wasn't quite sure if you meant "looks like that" or "acts like that" :P
 
Anonymous
I've seen the notation where the nesting is indicated by repeating the function name, or sometimes the first letter
 
@Calvin'sHobbies Yeah, though it has parentheses. f^(4)(x) being the fourth derivative.
 
Anonymous
12:50 AM
@Calvin'sHobbies Typ... damnit starman
 
@El'endiaStarman (4) == 4! ._.
 
@Calvin'sHobbies o.O?
 
Anonymous
@Calvin'sHobbies (4) == -4 in accounting fake math
 
Well, y'know, we overload operators in math pretty often, sooo...
 
Anonymous
@El'endiaStarman ping me if you figure anything out, I'm gonna disappear for a little bit
 
12:51 AM
@Mego Hmm
 
Anonymous
@quartata ಠ_ಠ
 
@Mego ?
I'm trying to think of something for that.
 
sin^(-1)(x) is not 1/sin(x). That's an example!
 
Anonymous
35 secs ago, by Mego
@El'endiaStarman ping me if you figure anything out, I'm gonna disappear for a little bit
 
12:52 AM
@El'endiaStarman Ooh
@Mego Oh, sorry to disappoint you.
If this is a pure programming context, this isn't that hard to program as is.
Why exactly do you need a simpler form?
 
@El'endiaStarman a(s)sin
 
*a(rc)sin?
 
0
Q: Convert Dict to DataFrame in Julia

Alex A.Suppose I have a Dict defined as follows: x = Dict{AbstractString,Array{Integer,1}}("A" => [1,2,3], "B" => [4,5,6]) I want to convert this to a DataFrame object (from the DataFrames module). Constructing a DataFrame has a similar syntax to constructing a dictionary. For example, the above di...

 
But yes, inverse sine. So sin(sin^(-1))(x) = x.
 
I don't suppose any of you are Julia experts? :P
 
12:57 AM
@AlexA. That'd be you....comparatively.
 
u_u
 
@AlexA. I know the most Julia here aside from you since I used it once
 
What'd you use it for?
 
Trolling you. I don't remember.
 
...oh.
 
12:58 AM
@El'endiaStarman I'll stick with ungolfed sines.
 
@Calvin'sHobbies cotangent is my favorite
 
@AlexA. μ_μ
 
Mostly just for the name...
 
≈.≈
 
yo why you discriminating against the hyperbolic ratios. Are you curvist or something?
 
1:00 AM
> yo
lel
 
@AlexA. yo_yo
 
Yo Yo Ma?
 
arctan's pretty awesome. That series for pi/4.
 
@AlexA. Yo Yo String.
Mini-challenge: Output all the trig functions listed here (except trafficsine and leasecosine), space/newline/comma separated or similar.
In any order
 
print("all the trig functions listed here")
 
1:07 AM
@AlexA. tha_tha
 
Stop Mawing everywhere
 
@Calvin'sHobbies Is superfluous output okay?
 
Dammit I can't remember how to do newlines in TeaScript
Rats the compression didn't work.
 
1:14 AM
help i can't stop looking up pictures of yo yo ma
 
@El'endiaStarman No. A couple brackets as part of a printed list is fine and all but no extra words
 
@quartata You can put § for newlines.
 
@Downgoat In strings?
Anyways, here's a Stuck one for now.
"x�E�A
QJ�_+��Ǖ�.8x�7�䄘�E
�	f$}Ai/*���N�
                     V`�.��Z��� ��}MYC�"D
0000000: 2278 da45 8d41 0ac0 3008 04ef fda5 c8a6  "x.E.A..0.......
0000010: 0d14 0351 4a9e 5f2b 9a9e 1cc7 95d5 2e38  ...QJ._+.......8
0000020: 78e8 378c e484 98af 450a a610 090f 6624  x.7.....E.....f$
0000030: 7de6 0f8f 7241 692f 2a1b b4ed 9f4e ce0b  }...rAi/*....N..
0000040: 5616 60ed 2e9b d45a e7b8 df20 b791 7d01  V.`....Z... ..}.
0000050: 4d59 4392 2244                           MYC."D
87 bytes
 
@quartata If you use template strings ``, then you should be able to insert a newline literal
 
1:17 AM
@Downgoat Hm. It didn't work for me
Lemme try again
 
Pyth 78 bytes: `.Z"xÚEÁ
\x00!Dïý¥ÈÐv1ÈXúü-·“ÏçÈx3í~Æ«°¹×$‡J‹É=ù£=]í#iƒ~{Ód^°X€Åª*«:`
 
@Maltysen How?
 
zipped it
 
Right.
But I did that too...
Did you use zoptlib?
 
actually 75 bytes, for literal null byte
 
1:18 AM
Or whatever that was
I forget the name
 
> ÏçÈ
 
An ERROR occured during execution:
SyntaxError: unknown: Expecting Unicode escape sequence \uXXXX (1:16)
> 1 | L["d"]`x["s"]`Â\n+1x["s"]`Â\nɁt\nå‚ %t\n ÖÃ\n+1 ÖÃ\nvÀ#š\nv€+1x["s"]`Â\nå…\n`
    |
@Downgoat
 
Anonymous
@quartata I need an algebraic form
 
@quartata the unicode escapes mess it up. Turning on Safely Handle Unicode works
 
1:22 AM
@Maltysen Right, but what I'm saying is that I used zlib just like that it and gave me a bigger string
@Downgoat Ah, gotcha.
Oh, but the output is wrong...
 
@quartata I used lvl 9. Is that what you used?
 
@Mego Wait, would this work? (n-n mod 4)/4
 
@Maltysen Oh...
I used Stuck's C operator which probably doesn't use level 9
 
the default for python zlib.compress is something else
yeah its 6
 
Anonymous
@El'endiaStarman Apparently yes. So f^k(n) == (n - (n mod 2^k))/(2^k)? If so that's amazing
 
1:26 AM
Well, floor(floor(n/2)/2) is...kinda obviously?...equal to floor(n/4), so...
 
@Maltysen Can you give me a hexdump of this?
 
Anonymous
@El'endiaStarman Durr. Why didn't I realize that?
 
Really, floor(n/k) = (n - n mod k)/k.
 
here's the char code list: [120, 218, 69, 141, 193, 10, 0, 33, 8, 68, 239, 253, 165, 200, 208, 118, 49, 200, 88, 250, 252, 45, 25, 183, 147, 207, 231, 200, 120, 51, 20, 237, 126, 198, 20, 171, 176, 185, 215, 36, 135, 74, 8, 194, 139, 17, 201, 61, 249, 163, 61, 93, 16, 237, 35, 105, 131, 126, 123, 211, 100, 94, 176, 88, 128, 197, 170, 15, 42, 171, 58, 2]
 
@Mego It's the sort of thing that's obvious if you happen to think about it. Y'know what I mean?
 
1:27 AM
put it in a string and prefix with .Z
 
Anonymous
@El'endiaStarman Yeah :P
 
@Maltysen Thank you
 
Anonymous
Next step... floor(n/2) mod 2 should just be (n mod 4) mod 2, right?
 
Anonymous
Wait that doesn't seem right...
 
Hmm. (n mod 4) mod 2 is the same as n mod 2.
 
Anonymous
1:31 AM
floor(n/2) mod 2 is 0,0,1,1,0,0,1,1...
 
Anonymous
(for n >= 0)
 
"x�E�
D�����v1�X��-�����x3�~�����$�‹�=��=]�#i�~{�d^�X�Ū*�:"D
75 bytes
 
floor(n/2) mod 2 = floor((n mod 4)/2)
 
Stuck is pretty good for this kind of stuff because the decompression thingy is one byte
 
Anonymous
1:33 AM
@El'endiaStarman Cool!
 
0000000: 2278 da45 8dc1 0a00 2108 44ef fda5 c8d0  "x.E....!.D.....
0000010: 7631 c858 fafc 2d19 b793 cfe7 c878 3314  v1.X..-......x3.
0000020: ed7e c614 abb0 b9d7 2487 4a08 c28b 11c9  .~......$.J.....
0000030: 3df9 a33d 5d10 ed23 6983 7e7b d364 5eb0  =..=]..#i.~{.d^.
0000040: 5880 c5aa 0f2a ab3a 0222 44              X....*.:."D
Obviously Bubblegum is better though
 
Anonymous
So generalized...
 
@Mego ?
 
Anonymous
floor(n/2^k) mod 2...
 
Anonymous
My brain is farting on that
 
1:37 AM
Oh.
Yeah, that's cool.
 
@Mego Probably floor((n mod 2^(k+1))/2). I think.
 
Anonymous
(n - (n mod 2^k))/2^k mod 2... Is that really the simplest form?
 
I just extrapolated from one data point. Lemme know how I did. :P
 
Anonymous
@El'endiaStarman Survey says no
 
Darnit.
 
Anonymous
1:42 AM
Fails on n=2,k=2
 
floor(n/8) mod 2 = (n mod 16) - (n mod 8)
Check that @Mego. The image in my head looks right.
 
Anonymous
@El'endiaStarman Still failing
 
Anonymous
But that's ok, I think I can do it without that generalization
 
0
Q: Make a Polyglot runnable in as many languages as possible

James LuA polyglot is a program that is runnable in many different programming languages/ environments. Your goal is to create one that is compatible with as many languages as possible. The more languages, the higher your score. Rules: Your program does not have to output the same thing in the every l...

 
OH.
@Mego it's floor(n/8) mod 2 = ((n mod 16) - (n mod 8))/8!
 
1:53 AM
@El'endiaStarman OH?
 
@Calvin'sHobbies Oxygen hydroxide, obviously.
And I actually used Minkolang! :P
 
Anonymous
Hmm
 
Anonymous
Ok so it turns out I screwed up my recurrence relation >_<
 
Anonymous
a(n) = 0, a(2n) = a(n), a(2n+1) = a(n) + 2^([log2(n)]+1)
 
@NewMainPosts Surely unclear or too broad?
 
1:56 AM
Not to mention duplicate of 20 or so questions.
 
Anonymous
It also lacks a wincon
 
Anonymous
a(0) = 0, a(2n) = a(n), a(2n+1) = a(n) + 2^([log2(n)]+1)
 
Anonymous
Stupid OEIS having it wrong
 
@Mego In challenges, your score is the number of distinct languages in which your code works.
 

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