5:30 AM
all the talk about this has been on the discord but I just feel like patting myself on the back a bit more for actually being on the global leaderboard for day 5 of advent of code
while Doorknob is just casually global rank 4 across all stars lol

2 hours later…
7:17 AM
2

Inspired by Flow Fit: Sudoku, a brand-new mobile puzzle game (as of Nov 2019). Background A Latin square is a square grid of side length \\$ n \\$ filled with \\$ n \\$ different symbols, where each row and column contains each symbol exactly once. Let's define a row (resp. a column) as a maximall...

0

50 rep each time you outgolf xnor I've reached 100K and it's time to gift it back! I offer +50 rep to any new answer than outgolfs one of mine. Answers to outgolf Rules Submit an answer that's shorter than mine and in the same language to a code golf challenge. It's fair game to shave by...

^ Let the games begin!
4

8:09 AM
@xnor I give up.

@xnor is impossible to outgolf.

8:26 AM
I sometimes feel like xnor wielding Python or Haskell is like Dennis wielding golflangs (in short, both are absolutely unbeatable).
4

2 hours later…
10:45 AM
I've just found a really simple sequence that is (surprisingly) not on oeis!

0

Round up my number code-golf sequence In this task you should create a function or sequence that deals with the following sequence that is (astonishingly) not on oeis. Here is the sequence in its full glory: 3, 3, 3, 6, 6, 6, 9, 9, 9, 12, 12, 12, 15, 15, 15, etc.

11:33 AM
@A̲̲ I think it'd be more interesting if "3" was also an argument, i.e. given n and d compute a(n,d)=d⌈n÷d⌉

@Adám I'm afraid that will make the challenge look more horrifying.

@A̲̲ Horrifying? It is super simple!

11:49 AM
:52801732 It isn't really a sequence then, but rather a field. Or simply a function of two parameters.

3 hours later…
2:36 PM
0

What's that frequency? This is my first code-golf challenge, so apologies if it is a little unclear/already has been done. I gave the past challenges a good look over, but I may have missed something. Create a function or a full program which accepts a frequency value, and then outputs the clo...

3 hours later…
5:08 PM
-1

You get a string which contains an integer between 1000 and 99999999 as input. The input string might contain leading zeroes but cannot be longer than 8 characters. Your goal is to output all dates between 6th of December 1919 and 5th of December 2019 which fit the input in these formats: day ...

6

While I'm unclear how useful this would be, you can wrap the code in <pre><code>...</code></pre> blocks, such as: >! <pre><code> >! function hidden() { } >! </code></pre> Which produces: I'm pretty sure you'd lose any syntax highlighting.

2 hours later…
6:54 PM
Have the VTC reasons changed?

8

A few minutes ago, new Post Notices was launched across the Stack Exchange network. This includes all public sites, all meta sites, and all Basic and Business tier Teams (Enterprise tier will get it in a future release). For our purposes, a 'post notice' includes any status banner shown on quest...

7:54 PM
Any feedback on this?

8:07 PM
@cairdcoinheringaahing are you on some kind of challenge-posting-spree recently?

@flawr No, why?

@cairdcoinheringaahing I feel like whenever I pop in here you are asking for feedback for the next challenge you've got ready:)

@flawr I do ask in here for a lot of feedback :P

8:28 PM
@cairdcoinheringaahing \$ — really‽

@Adám you'd probably prefer £ right? :P

@flawr Not really.

@Adám I didn't come up with it: en.wikipedia.org/wiki/Exponential_factorial

@cairdcoinheringaahing Yeah, I noticed. Nuts.

@cairdcoinheringaahing I would like to offer CHF as an alternative :D

8:30 PM
@cairdcoinheringaahing Hold on, anyone can put anything on Wikipedia. That doesn't make it true. That notation isn't mentioned on MathWorld. [citation needed]

@flawr I'll consider that for the next one :P

But in all seriousness, it looks a bit silly - why don't you just use `f(n)` instead of `n\$`?

Idk, I don't really like `1/f(n)`

I was considering `¡`

8:32 PM
@cairdcoinheringaahing That just looks like a subscript i

@cairdcoinheringaahing `exp!(n)`?

Hmm, the interrobang might work

0

Name the hydrocarbon A hydrocarbon is a chemical compound which consists of only hydrogen and carbon atoms. For this challenge, we will only consider the three simplest kinds of hydrocarbons: alkanes, alkenes, and alkynes with no branches. An alkane with \\$n\\$ carbon atoms contains \\$2n+2\\$ hyd...

@cairdcoinheringaahing Or a superscript !

What about `n?`?

8:33 PM
whatever

@cairdcoinheringaahing I think that looks a bit confusing.

It looks fairly decent with `n?`: codegolf.meta.stackexchange.com/a/18328/66833

isn't there another (combinatorial?) function written like that?

@cairdcoinheringaahing I don't know. Now I keep reading it as a question.
@cairdcoinheringaahing I think `n^!` looks great.

Yeah, that works
Clearly read as "n to the factorial"

8:39 PM
@cairdcoinheringaahing No, I read it as "n exponent factorial" which is even better.

Aside from the notation, is it good to go?

@cairdcoinheringaahing "can fail due to language constraints for reasonably large n" e.g. due to running out of precision?

Hmm, I think I might say that it has to work for `n < 2^32 - 1`

@cairdcoinheringaahing how large is it for n=5?

TIO cuts the output, so longer than 128k digits

8:43 PM
1! 1? 1! 1? 1! ...
2! 2? 2! 2? 2! ...
3! 6? <err_too_big>

at least for JS this is already infinity

Wikipedia says 5^! is approximately 6.2 * 10^183230.

@cairdcoinheringaahing so that means participans only have to include the first 5 terms of the series?
apparently there are a lot of ones

uuuujkjko

Idk whether it would change by including further terms, and if so, then further terms would have to be included

8:46 PM
@DJMcMayhem Wrong window?

This isn't vim >_<

Nah, it's a secret mod code :P

@cairdcoinheringaahing How could it? Since 6^! is so small, it won't affect the early digits.

@Adám /shrug Then I guess people won't have to calculate it

In this case the sum to infinity should be change to the sum to 6

8:49 PM
If APL had infinite precision, n^! would be computed by `*/⌽∘⍳`
@flawr Isn't 5 enough?

@Adám @El'endiaStarman said that 5^! is about 10^183230
which is smaller than 2^32 I think?
so at least 6^! is needed

Would it be an improvement if it had to work for any `n`?

@flawr No, why?

@flawr That can't be right

lolwat

8:51 PM
2^32 = 4294967296

@flawr What?! 2^32 is 4.2e9. 10^183230 == 1e183230

flawr is either trolling or having a really bad brain fart. :P

oh wait I ignored the `10^` part :D
3

Hahahaha

just a minor detail

8:52 PM
Very minor detail :P

it really just results in a one-off error for the matter of our discussion
:D

The difference between 10^183230 and 183230 is just nitpicking

I'm pretty sure both are greater than 10, so why bother

In the grand scheme of things, I'm sure it is :P

It is the same order of magnitude in very large bases.

8:53 PM

10^183230 = 183230 = pi = e

@Adám I'm pretty sure I'm gonna have to quote you some time! :D

At Dyalog, we very often use 99 as a stand-in for ∞ since 99=∞ for small values of ∞.

Wasn't sure if I should link that one or xkcd.com/899

8:56 PM
@DJMcMayhem 87% of all statistics are made up on the spot

9:15 PM
0

Game of putting lines through dots. This is a game that I remember having learnt from my grandparents in my childhood, but don't know it's name nor origin. (if you know I would appreciate that). Description The game is played by a single player on a 2-dimensional infinite grid. The grid at the...

9:40 PM
The new notice box on a closed question looks much better, IMO.