« first day (3214 days earlier)      last day (24 days later) » 

12:00 AM
Like fourier, laplace and things like that?
Yep, exactly
Laplace atm
those happy little differential equations...
physicists literally only want one thing and it's fucking disgusting
Haha the problem you've just helped me solve was optimising a numerical integration algorithm for finding the volume of an n-dimensional sphere
I much prefer numerical solutions to analytical solutions now
@BetaDecay looks a lot like monte carlo stuff? :)
Haha exactly
12:07 AM
@BetaDecay both have their place, but analytical solutions are usually derived with very dirty tools:)
I wasn't sure how often mathematicians use numerical solutions haha
Guess it depends on the field really
but just for exploring things you find people from all over the place using numerical methods
I need some sleep now, I hope we see you a little bit more again around here:)
@flawr See you
1 hour later…
1:11 AM
What does this mean (in Javascript/React):

isLoaded: true,
Does that automatically copy the properties of the error object into the object I'm creating?
1:39 AM
@NathanMerrill Not quite, Try it online!
2:19 AM
ah ok. So basically, it's shorthand for error:error
4 hours later…
6:40 AM
A: Sandbox for Proposed Challenges

BubblerTriangular domino tiling of an almost regular hexagon Background An almost regular hexagon is a hexagon where all of its internal angles are 120 degrees, and pairs of the opposite sides are parallel and have equal lengths (i.e. a zonogon). The following is an example of an almost regular he...

6 hours later…
12:32 PM
@betseg above mediocre sub: /r//2healthbars/
1) I am aware of that sub, it's beautiful
2) I join chat after weeks and you ping me. 10/10
A _
12:51 PM
Who's betseg?
who's A_
@A_ @betseg is betseg.
@betseg I wish I could say something about a telepathic connection we have but I'm afraid it was just a coincidence
how you been
1:06 PM
good, and you?
have you been busy?
yeah kinda
uni and stuff
I can relate:)
AOC in 2 weeks tho
advent of code
1:10 PM
Dec 4 '18 at 20:05, by betseg
ok i created a private leaderboard, join with 383923-1cc3bff3
10 stars dam
10 stars is my 11th most starred message wow lol
@betseg how about now?
10th lol
did you join?
or are you gonna do the challenges?
1:14 PM
join what?
the advent of code leaderboard
oh, I didn't know you were talkinga bout that in the message you linked:)
I have no idea how it works, just register on adventofcode.com?
last year's results
yes you join on there, then use that code to enter a private leaderboard
I probably don't have time to participate:/
you dont have to do them instantly tho, do whenever you have time, have fun
1:31 PM
Q: Euclidean Distance Between Two Matrices

caseykYour task is to write the shortest algorithm in a language of your choosing that accomplishes the following: Given two matrices it must return the euclidean distance matrix (https://en.wikipedia.org/wiki/Euclidean_distance_matrix). Below is an example: a = [ 1.0 2.0 3.0; -4.0 -5.0 -6....

2 hours later…
4:00 PM
Q: Convert into Chinese Numbers

RysicinA problem similar to Convert Chinese numbers, however, more complex. Also, answers given there mostly don't satisfy all the conditions. Chinese digits/numbers are as follows: 0 零 1 一 2 二 2 两 3 三 4 四 5 五 6 六 7 七 8 八 9 九 10 十 100 百 1000 千 10000 万 10^8 亿 Multiple-digit numbers are created by adding...

4 hours later…
8:29 PM
Well that's a first. I just "updated" the wrong file on Github, twice
The same code, copy pasted into the same wrong file, twice
@cairdcoinheringaahing so you decided to tell us about it twice :)
@ngn Of course, got to keep the streak going :P
8:46 PM
Whew - Determine if a Graph is Toroidal - what an adventure
i commend you for having the patience to golf that
@isaacg Very impressive!
Does this mean that this MO question is wrong?
@cairdcoinheringaahing More like I went for an option not listed there - the simplest imaginable algorithm, simpler than anything listed at that answer. But it's incredibly slow, slower than anything listed there, so it's not something that can be called a "standard algorithm"
And even so, I had to teach myself a bunch of combinatorial graph theory I'd never seen before in order to write it
The bash single caret case modification expansion doesn't work for me either or TIO or my own system: Try it online! . Anyone know why? Expected output for ${a^l}: heLlo
9:08 PM
@Jonah man bash: "the ^ and , expansions match and convert only the first character in the expanded value."
note that it's the first from the value, not the first that matches
@ngn oh it's literally the first character... i see. ty.
also there is no way to do backreferences in the pattern subtitution expansions like ${var/str/replace}, right? it's straight up replacement only?
@Jonah it's not even regex
9:55 PM
Another bash golfing question. Say we have an array arr and wish to join its elements with some (not necessarily single character) string. You can do x=$(printf '%s--' ${arr[@]}); echo ${x%--} to join them with --. Try it online!. Can this be improved?
10:09 PM
@Jonah can your array elements contain spaces?
@ngn oh i like that. and if they can, is mine the best you could do? (the printf array arg would need to be quoted, ofc)
@Jonah another option is to use IFS=c where c is a special character that doesn't occur in the strings
then replace c with -- like above
A: Sandbox for Proposed Challenges

caird coinheringaahingHow short can you get? You are to write a program that, when given one of five distinct inputs, you output one of Code, Golf, and, Coding or Challenges. The inputs can be any five consistent and distinct things (e.g. 12345, abcde, etc.), and each can map to any of the five outputs. However, the ...

@NewSandboxedPosts That was fast
10:30 PM
@ngn ty
10:47 PM
@NewSandboxedPosts in a stack-based lang, would repeating a flatten built-in infinitely and the inputs being ["G", "o", "l", "f"], etc count for infinite score?
Hmm, good point
Don't we have a standard loophole which prevents using the input to encode the output?
@dzaima Updated so that the input will always be 1, 2, 3, 4 and 5

« first day (3214 days earlier)      last day (24 days later) »