The Nineteenth Byte

DJMcMayhem

00:39

@Calvin'sHobbies The slope of x^2 is 2x, which is linear, so it is wrong to say that grows exponentially

Although it's clearly not linear, so I'm not sure what the right term is

Eric Tressler

00:50

polynomial

Anonymous

@Calvin'sHobbies Quadratic

Eric Tressler

though linear and quadratic are common specific terms

Anonymous

But if you try to describe the growth rate of x^3, you're going to get confused with an esolang

DJMcMayhem

@EricTressler Thanks

@Mego Slope is 3x^2, right?

Eric Tressler

@DJMcMayhem I think Cubic must be an esolang

Potato44

00:54

@EricTressler I think they were referring to Cubically

Eric Tressler

@Potato44 that seems likely, I'm not familiar with it

Anonymous

@DJMcMayhem Yep

Anonymous

@Potato44 Correct :P

Anonymous

I take it you're learning basic calculus now

Potato44

me?

Anonymous

00:57

No, DJ

DJMcMayhem

@Mego No, I took calc 1 a couple years ago actually

I took college classes in HS, then took an extended several year Gap year

Calvin's Hobbies

02:58

@EricTressler Ah, course. Though "grows polynomially" is a mouthful. "Quadratically" a bit nicer.

Pavel

06:30

I'm finally allowed to install Linux on my work laptop now that everything has been ported to .NET Core.

My only other computer is only used for gaming, so I keep Windows on it. I'm pretty happy rn.

CMP: Linux distro of choice?

Downgoat

07:02

@Pavel Debian

Pavel

@Downgoat Hmm, really stable, but generally with outdated software in it's repos.

I'm mainly deciding between Fedora and OpenSUSE.

Anonymous

07:40

@Pavel Xubuntu

Pavel

@Mego Huh, what's Xfce like? I was under the impression that it's only really good for older or less-powerful systems.

Anonymous

@Pavel It's a lot simpler of an interface than Gnome or KDE. Much easier to customize, IMO. And yeah, it's more lightweight, so that's also a plus for me.

Pavel

I've mostly been considerin Cinnamon and KDE.

Pavel

08:00

> TFW a console opens by itself for no reason at all, rapidly goes through some lines, and closes within 5 seconds

New Main Posts

10:02

0

Q: How many times a number appears as leaf node in all permutations of binary search tree?

Suppose you have an array of n elements A = {1,2,3,4,5} total of 5! binary search trees are possible(not necessarily distinct) now my question is in how many of trees 1 appeared as leaf node and in how many 2 appeared as leaf node and so on ? What I have tried: I've seen for A = {1,2,3} 2 ap...

algorithm

New Meta Posts

10:41

0

Q: library of few primitive for golfing languages

The set of primitive functions and operations The clue it is to find one little subset of operations that allow to write all the remain operation easily, they have to be few (because it is difficult remember too much ) I request to you to add other operation/function you think to be easy and goo...

discussion code-golf

New Sandboxed Posts

11:29

0

A: Sandbox for Proposed Challenges

Bobby's Booby-Trapped Safe Bobby's booby-trapped safe requires an n-digit code to unlock it. Alex has a probe which can test combinations without typing them onto the safe. The probe responds Fail if no individual digit is correct. Otherwise it responds Close, including when all digits are corre...

New Sandboxed Posts

11:47

0

A: Sandbox for Proposed Challenges

Algebraic Fibonacci Given two integers starting integers, a, b, the terms of the Fibonacci sequence can be represented as follows: a, b, a+b, a+2b, 2a+3b, 3a+5b, 5a+8b, 8a+13b... The Challenge Your task is to, given an integer n, return the nth Fibonacci number, represented algebraically usi...

New Sandboxed Posts

12:31

0

A: Sandbox for Proposed Challenges

Take a byte! Your task is to, given an unsigned integer n, find the largest number which can be created by deleting a single byte (8 consecutive bits) of data. Example Given the number 7831, we first convert it to binary: 1111010010111 We then find the group of 8 bits which, when removed,...

caird coinheringaahing

14:36

@Mr.Xcoder Out of curiosity, why did you protect this question?

Mr. Xcoder

@cairdcoinheringaahing Because it has received a lot of trashy ~~messages~~ answers and I felt that was appropriate.

caird coinheringaahing

@Mr.Xcoder That's got me wondering how many questions are user-protected here :P

Mr. Xcoder

¯\_(ツ)_/¯

CMC: Given a list of positive integers, check whether all share at least one divisor other than 1. [6, 5, 3] -> False, [12, 4, 18] -> True

I am awaiting clever ways of handling the 1

@Mr.Xcoder Jelly, 6 bytes. Returns [] for falsy and non-empty list for truthy.

caird coinheringaahing

@Mr.Xcoder Jelly, 6 bytes. Returns 1 for falsey, >1 for truthy

Mr. Xcoder

You use L, I use dequeue, right?

caird coinheringaahing

14:47

@Mr.Xcoder Nope

@Mr.Xcoder Jelly, 6 bytes: żḊg"/P

Mr. Xcoder

Oh cool

Mine is ÆDæ&/<dequeue>

Oh hello SBA!

Simply Beautiful Art

Hello

caird coinheringaahing

@Mr.Xcoder Nice

Mr. Xcoder

@cairdcoinheringaahing I am kind of bored, are you up for a bit of JHT?

caird coinheringaahing

@Mr.Xcoder Soory, I've got french homework ATM. I'll ping you there when I'm done though?

Mr. Xcoder

14:49

Yeah, I should go solve my hw as well. Sure ping me

H.PWiz

@Mr.Xcoder Husk, 3 bytes: εF⌋ with invertes truthy/falsy

Mr. Xcoder

Oh... Nice!

Jelly, 3 bytes (inverted truthy/falsy): g/Ị

Thanks to H.PWiz for showing me how dumb I am!

... How did I not think of GCD when I posted the CMC?

Adám

15:15

@Mr.Xcoder So if one or more elements are 1 we have to return Falsy, right?

Mr. Xcoder

@Adám Indeed.

Adám

@Mr.Xcoder Dyalog APL, 4 bytes: 1≠∨/ (Is 1 different from the greatest common divisor?)

Mr. Xcoder

Same algo as in the Jelly 3-byter

caird coinheringaahing

15:32

ಠ_ಠ My school gave me a sample physics paper that believes 70 * 1/3 == 23.1

Simply Beautiful Art

How do you even get that?

user202729

Probably mostly because of bad precision measure tools.

Simply Beautiful Art

._. I can understand 23.3, but 23.1 is just horrible.

Adám

15:47

(sorry – kids)

New Sandboxed Posts

16:18

1

A: Sandbox for Proposed Challenges

Bitwise XOR of rational numbers code-golf rational-numbers bitwise Introduction Every rational number between 0 and 1 can be represented as an eventually periodic sequence of bits. For example, the binary representation of 11/40 is 0.010 0011 0011 0011 ... where the 0011 part repeats infi...

Pavel

17:35

@Adám If I get a new computer, do I need to apply for a new Dyalog license to put APL on it? I can't seem to sign into my.dyalog.com.

LegionMammal978

Big megacorporations don't generally post their internal routing structure, correct?

New Main Posts

18:15

-2

Q: Quicksort output wrong

I want to sort the given array using quicksort. So I wrote this code in c for quicksort algorithm but its not giving me correct answer.Its giving me the same output as the input. eg: If i give input as 3 2 1 then it is giving Output: 3 2 1 Please help and tell me where is the mistake. #include<s...

sorting c algorithm

Adám

18:34

@Pavel No, you can use the same license number when you install. Your license only covers my.dyalog.com membership for two weeks. After that, you need to apply for a new license (which will be given to you).

Pavel

@Adám Thanks, I also went from Windows to Linux. Does that matter?

Adám

@Pavel Yes, you need one license per OS, but your license number may be the same. Just fill in the form or email sales@.

Pavel

@Adám ok cool. I'll go do that.

Fun fact: The fedora wiki encourages using su -c 'dnf install foo' over sudo dnf install foo. Why this is I have no idea

Adám

19:11

∞ =15 for sufficiently small values of ∞.

Simply Beautiful Art

This is more than 100 bytes.

Pavel

@Adám Speaking of which, tio.run/##SyzI0U2pTMzJT////1Hf1EdtEwwPbzf4/x8A errors, but what should happen is tio.run/##SyzI0c1Lz/v//1Hf1EdtEwwPbzf4/x8A . I propose this be fixed in a later version of Dyalog.

Adám

@Pavel It is not so obvious what 1÷0 should be (if anything). Afaik, ISO specifies that 1÷0 is an error. Dyalog APL does not support infinities, but you can make it 0 if you want.

Pavel

@Adám IEEE 754 floating point specifies infinity.

Adám

@Pavel Yes, the representation standard. Indeed I think Dyalog APL will handle IEEE infinities and NaNs if you manage to import them. However, ISO made a standard for APL, which does not include such.

Pavel

19:23

@Adám Ah, I didn't realize ISO had it's own APL standard.

I'd really love to read this specification but ISO charges for it ,_,

Adám

@Pavel All of today's major APLs are practically compliant. Dyalog has made one exception for a very silly syntactical anomaly.

Pavel

@Adám Well NGN uses IEEE 754, being implemented in JS.

And also I'm curious what this exception is now

Adám

@Pavel Ifaik, APL2 follows the standard. No more, no less. Dyalog APL has added lots of yummy stuff.

@Pavel If O is a dyadic operator, then according to ISO, f O 1 2 is the same as (f O 1) 2 and f O 1 2 3 is the same as (f O 1 2) 3 and f O 1 2 3 4 is the same as (f O 1 2 3) 4 but f O 1 2 3 4 5 is the same as (f O 1 2 3) 4 5. Dyalog does not insert any parentheses for you.

Pavel

@Adám So in dyalog's case, everything to the right of O is a single array? That makes sense.

Simply Beautiful Art

@Adám Not to mention floor(1/0) = 17976931348623159077293051907890247336179769789423065727343008115773267580550096‌313270847732240753602112011387987139335765878976881441662249284743063947412437776‌789342486548527630221960124609411945308295208500576883815068234246288147391311054‌0827237163350510684586298239947245938479716304835356329624224137216

Adám

19:32

@Pavel Yes.

Pavel

@SimplyBeautifulArt 10/10

Adám

@SimplyBeautifulArt What does 1/0 mean?

Simply Beautiful Art

It comes from Largest number in ten bytes of code.

Pavel

@Adám tio.run/##y0gszk7Nyfn/PzcxM0/BVqGgKDOvREHDUN9A8/9/AA

Adám

@ckuhn203 The IEEE convention is correct in the sense that the reciprocal of any sequence that tends to 0 tends to infinity. — Jubobs Jun 16 '14 at 19:29

Simply Beautiful Art

19:36

If you want a really large negative number, take floor(0/0)

Adám

lim(-1/x), x→0 = -∞

caird coinheringaahing

@SimplyBeautifulArt Haskell gives me this

Simply Beautiful Art

No, I think floor(0/0) < floor(-1/0)

Pavel

> Any number you can fit on a whiteboard basically rounds down to 0.

Adám

So I'd rather say that 1÷0 is indeterminate.

Simply Beautiful Art

19:40

tio.run/##y0gszk7Nyfn/PzcxM0/…

Adám

@Pavel @SimplyBeautifulArt However APL is completely correct in giving L, the largest representable number, as the identity element of minimum-reduction. x=L⌊x is true for all x.

Pavel

@Adám What is dyadic floor?

Simply Beautiful Art

But why is floor(0/0) so big?!

Adám

@Pavel Minimum.

Christopher 2EZ 4RTZ

0/0= 7

caird coinheringaahing

19:42

@Christopher2EZ4RTZ ~~Why?~~ I don't want to know why

Christopher 2EZ 4RTZ

@cairdcoinheringaahing proof needed? ok then

Adám

@cairdcoinheringaahing Noooooo. Don't take the bait!

Christopher 2EZ 4RTZ

brb getting my proof

caird coinheringaahing

@Adám Whoops :P

Christopher 2EZ 4RTZ

there is no turning back now

Adám

19:44

@Christopher2EZ4RTZ Can I bother you to give me the last digit of pi before you post your proof?

Christopher 2EZ 4RTZ

@Adám 7

caird coinheringaahing

He has a 1/10 chance of being right :P

Christopher 2EZ 4RTZ

For all you know I could be right

Adám

@Christopher2EZ4RTZ [citation needed]

Christopher 2EZ 4RTZ

@Adám go check it yourself :D

Adám

19:45

@Christopher2EZ4RTZ I don't have a good enough computer at hand.

:41106860 No mathjax here.

Christopher 2EZ 4RTZ

@Adám i have it

caird coinheringaahing

@Christopher2EZ4RTZ Soory, you're wrong:

> Nicholas Sze, of tech firm Yahoo, said that when pi is expressed in binary, the two quadrillionth "bit" is 0

That's pi as far as we know

Christopher 2EZ 4RTZ

wait what

that is not the final digit

caird coinheringaahing

@Christopher2EZ4RTZ Close enough :P

Can't we just call pi 3 and get it over and done with?

Adám

@cairdcoinheringaahing Sure. Wait… why is this tank leaking?

Christopher 2EZ 4RTZ

19:47

lol

caird coinheringaahing

@Adám Fine then, 4

Adám

@cairdcoinheringaahing Boink.

Christopher 2EZ 4RTZ

@cairdcoinheringaahing my house burns down... you hear sirens in the background

Pavel

I have to wonder why Dyalog is more expensive to use on Linux than Windows.

dyalog.com/prices-and-licences.htm#commercial

Christopher 2EZ 4RTZ

dear god why?!!! is heard in the distance

caird coinheringaahing

19:49

@Adám Boink is progress

Christopher 2EZ 4RTZ

I just opened reddit and the first sentence was "Oh god why"

Adám

@Pavel 0 I'm sorry, I don't see that being the case from that table.

Pavel

@Adám Wait, no, UNIX is more expensive

Which I guess means that's a Mac/Linux bundle?

That doesn't make sense either

Adám

@Pavel I think "UNIX" here refers to AIX, which has overhead payable to IBM.

Pavel

@Adám Ah. I know that Linux and MacOS aren't technically true Unix systems, but that's still a bit confusing.

Adám

19:53

@Pavel I'll ask for that to be clarified. Thanks!

Pavel

np

Marcus Andrews

21:21

Is there a shorter way to do logical negation in Python?

I want to do something like "S"*(not(boolean_exp))

but instead "S"*N(boolean_expression)

where N is some fancy negation shorthand

~ and - don't seem to be it

trichoplax

→ 5 messages moved to Trash

Mr. Xcoder

@MarcusAndrews If the string is always one character long, then "S"[boolean_expression:]

Marcus Andrews

two unfortunately, actually

Uriel

@MarcusAndrews "S"*(1>boolexp)

Marcus Andrews

("VALID" vs "INVALID")

aahhhh snap

trichoplax

21:32

Is it acceptable to reverse the meaning of the two strings, so you don't need the not at all?

Marcus Andrews

u=input()
print(["IN",""][2<len(u)<21 and u.isalnum()]+"VALID")

if the input is valid alphanumeric between length 3 and 20 inclusive

trichoplax

"IN"*expression will give "" or "IN". Just need to phrase expression to be true the way you need it.

Marcus Andrews

I wasn't able to do that without making the boolean too long

Pavel

u=input()
print(["IN",""][2<len(u)<21+u.isalnum()>1]+"VALID")

Remember, booleans are numbers.

Marcus Andrews

there may also be a short ruby regex though but I couldn't get a short version

yeah

perhaps "IN"*(2<len(u)<21+u.isalnum()<2) hmm

trichoplax

21:38

Looks promising

Just watch the precedence between < and +

Not to worry + takes precedence over < so that should work

Oh no wait - the last < will be a problem

I got mixed up. You'd need 4 parentheses to avoid the + messing things up

Pavel

@MarcusAndrews Regex: /^[A-z0-9]{3,20}$/

Marcus Andrews

Yeah that's what I had tried

LegionMammal978

22:11

Anyone here familiar with NSW?

caird coinheringaahing

22:24

Any particular reason ths got downvoted?

Marcus Andrews

Is there a shorter way to do "(1-a)" for boolean a? (using parens because I am using this as a multiplier)

H.PWiz

not?

Marcus Andrews

it's not shorter

H.PWiz

I guess that depends on the language. Didn't read above

Marcus Andrews

i.e. y-quantity*(1-boolean_var)

Neil

22:43

@MarcusAndrews how about print("INVALID"][2*(2<len(u)<21 and u.isalnum()):]

print("INVALID"][2<len(u)<21 and u.isalnum()and 2:] also works

Pavel

22:57

Linux installation has completed, for the first time in my life, on the first try. And I remembered to back up my work from the previous OS.

Marcus Andrews

which distro?

@Neil Clever!

Pavel

@MarcusAndrews Fedora

The fact that installation went well means everything will break as a use since it's a prerelease build.

Neil

23:35

what's the rep to see deleted questions?

HyperNeutrino

2k here, 10k normally

Neil

ta

Transcript for