The Nineteenth Byte

@orlp but a kilogram would then be a kilomillikilogram and then a milligram is a millimillikilogram because everything is named relative to the base term (not unit)

caird coinheringaahing

So would a tonne be a millikilokilokilogram? I thought we made things shorter here, not longer

orlp

@cairdcoinheringaahing little-known fact

the correct pronunciation is

milliki-loki-loki-logram

caird coinheringaahing

12:42 AM

I prefer tonne. It's shorter and has no disputes over pronunciation

LyricLy

@cairdcoinheringaahing Is this not codebowling.SE? Have I come to the wrong place?

caird coinheringaahing

@LyricLy You are clearly in the wrong place :P (Or, as we say here: "You like nice code? Here's the way to Code Review") :DD

HyperNeutrino

but "nice code" is short code per our definitions

3

Qwerp-Derp

1:18 AM

Hello hello

caird coinheringaahing

1:32 AM

@HyperNeutrino I just realised, you are the user with the most rep who doesn't have any gold badges :O I'm not sure if that's good or bad :P

HyperNeutrino

1:43 AM

@cairdcoinheringaahing wait really ._. prolly bad

@Qwerp-Derp hi

I still remember back when we had about the same rep at 3K and I overtook you by a bit

lol

Qwerp-Derp

Damn I've been gone for a long time :P

HyperNeutrino

what does this even mean ._. oeis.org/A000725

@Qwerp-Derp yeah I noticed your inactivity up until lately :P

Qwerp-Derp

I think I should get back to PPCG, I've been messing around with Crystal a lot lately

HyperNeutrino

oh yeah I remember someone (probably you) said that it was a nice language

oh that does look nice

Qwerp-Derp

The proof golf looks really interesting, I might have a crack at it

HyperNeutrino

1:46 AM

yeah proof golf is a really interesting tag

dammit I can't install crystal because my linux system is borked

Downgoat

CMC: find a way to reduce these two functions into one:

f = P1|A->G:P3|G:*||
G = P2|f->P3|G:*|:*|

syntax is * = no-op. P1|A:B| = if (P1) A() else B(). f -> P3 = P3(f)

trying to do some optimizations to VSL but I'd need to be able to solve the above problem

Anonymous

@Downgoat Needs more Y combinator

Qwerp-Derp

2:02 AM

Is there a way to turn -(a - b) into b - a?

HyperNeutrino

have you proven that -a = -1 * a

nvm that doesn't help

what is this for?

Downgoat

@Qwerp-Derp -(a - b) = -a + b = +b - a = b - a

Qwerp-Derp

@HyperNeutrino Proof golf

HyperNeutrino

which one

@Qwerp-Derp (-a)*(-a)=a*a?

Qwerp-Derp

@HyperNeutrino Yup that one

I'm not sure if it'll help

HyperNeutrino

2:08 AM

subtraction is not an operator ._.

Qwerp-Derp

But it's worth a shot

I'm also trying to go to the route of -a * -a = -(-a) * a

HyperNeutrino

you'd have to write -(a + (-b))

Qwerp-Derp

Oh

HyperNeutrino

@Qwerp-Derp hm that looks like a viable option

Qwerp-Derp

And then I'll sub in the 6-step axiom

Provided in the question

HyperNeutrino

2:09 AM

hm ok

Qwerp-Derp

Shit why am I separating my messages up like this when I don't need to Q AQ

HyperNeutrino

?

Qwerp-Derp

dw

I'm referring to the previous messages, I split them up into separate chunks when I didn't really need to

HyperNeutrino

huh ok. I've had people complain about me doing that before as well :P

Qwerp-Derp

2:25 AM

Does this work?

HyperNeutrino

Hm?

also does my tag wiki for proof-golf seem appropriate? please help improve it if you see things I've missed

I see someone added an example :D \o/

so yay thanks funky computer man

oh there have actually been a lot of edits to the top part lol

(I mostly adapted the tag info for code-golf but in hindsight that didn't work very well :P)

Qwerp-Derp

Yeah I only typed half my message because I had to leave the house, I was about to post a proof of something for the proof golf

I have two proofs now, an improved a = -(-a) and -1 * a = -a

I'm not sure if any of these are useful, but ehhh

Anonymous

2:41 AM

I'm gonna post this challenge soon - last call for feedback

HyperNeutrino

one approach for proof-golfs that I think might be helpful is to assume some common sense things, and then prove them later if you actually do use them

can you post before my mom makes me go to sleep xD

although my wifi will probably cut me off before then so yeah rip

Qwerp-Derp

a = a + 0 = a + -a + -(-a) = 0 + -(-a) = -(-a) + 0 = -(-a)

@HyperNeutrino I mean everything is common-sense, so that's not really helpful :P

HyperNeutrino

@Qwerp-Derp well I mean use common sense things that aren't axioms, and then prove them later on so you don't waste time proving common sense things that you don't actually use

Qwerp-Derp

The first lemma above is 5 steps (on mobile, can't do newlines)

HyperNeutrino

3:00 AM

gtg now o/ good night/morning PPCG

Qwerp-Derp

o/

New Main Posts

3:26 AM

0

Q: Frequency Distribution of Multiple Dice Rolls

Given two positive integers a and b, output the frequency distribution of rolling a b-sided die a times and summing the results. A frequency distribution lists the frequency of each possible sum if each possible sequence of dice rolls occurs once. Thus, the frequencies are integers whose sum equ...

Downgoat

4:05 AM

> among the animals people like most

FrownyFrog

4:26 AM

@Mego "b can be 1, and if it is, the output is always [1]"

you mean [a]

the number of rolls times 1

oh right I see

Anonymous

4:47 AM

For any roll ad1, there is only one possible outcome: rolling 1 on all dice. Thus, it's consistent with the b**a rule, and so the sum of the frequencies must add to 1**a = a. Therefore, the output for ad1 is always [1], regardless of a.

Sherlock9

5:34 AM

How do you a Cartesian power in Haskell?

Where you have one list, [1..6] for example, and you're trying to get the Cartesian product of m copies of that list

@orlp This is starting to sound a lot like Hawaiian

Found it: mapM(\x->[1..x])(replicate a b)

Funky Computer Man

6:03 AM

@Qwerp-Derp You are missing association steps here.

Here is your proof with association:
a = a + 0 = a + (-a + -(-a)) = (a + -a) + -(-a) = 0 + -(-a) = -(-a) + 0 = -(-a)

One extra step

Anonymous

I was expecting more answers involving convolution :P

Maltysen

@Mego oooh smart

but idk how short that can be made without builtins

Qwerp-Derp

6:18 AM

@FunkyComputerMan Oh, I thought I had something there :P turns out I just missed a step

Funky Computer Man

Can someone explain how mapM works in Haskell? I am trying to golf with it and I can't understand the Hoogle explanation

Potato44

@FunkyComputerMan Do you know what sequence does?

Funky Computer Man

No I'm not familiar

Potato44

sequence takes a list of monadic values and turns that into the same monad with a list inside.
In types that is `sequence :: [m a] -> m [a]`

for example if you had a list of IO actions sequence would combine it into an IO action that returns the list of results of the IO actions if they were executed in left to right order

Here is an answer that shows how sequence can be defined stackoverflow.com/a/5299489/8179137

mapM is just what you get when you combine map with sequence

So if you take a list of values map them to monadic values with a function, then combine them into one monadic value with a list inside

Funky Computer Man

6:44 AM

Ok i see

Potato44

well it is slightly more general than what I said, it works for any traversable, not just lists, but lists are probably the most common use.

Pavel

@Downgoat It's part of their plan to overthrow humanity, they have to appear likable to infilatrate us from the inside.

Potato44

@FunkyComputerMan also if you are considering using mapM there is also forM which is the same thing with the arguments reversed

Funky Computer Man

7:09 AM

@Potato44 Thanks tht might save me bytes in the future

Sherlock9

7:31 AM

Thanks for the 11 bytes @FunkyComputerMan :D

Lembik

8:05 AM

hi all

Das Neunzehnte Byte

Transcript for