The Nineteenth Byte

Mr. Xcoder

07:02

Please, somebody post this, I solved A000006:

import Foundation

func f(n:Int){
    var x = n, l = [Int](), number = 2
    while x >= 0{if number > 1 && !(2..<number).contains { number % $0 == 0 }{x-=1;l.append(number)};number+=1}
    print(Int(pow(Double(l[n]), 0.5)))
}

For the next OEIS in Swift

And the sequence is very easy

225 bytes ^

@Downgoat ^?

caird coinheringaahing

@totallyhuman why did you delete the Python 1 answer?

Mr. Xcoder

@cairdcoinheringaahing Can you post that ^?

caird coinheringaahing

@Mr.Xcoder sure for the int part one?

Mr. Xcoder

@cairdcoinheringaahing Yes

#38. Swift, 225 bytes, A000006

The code above

and I'll give you a testing link now

Next sequence: oeis.org/A000225

Phoenix

Any vim people here? Is there a way to do dd or D without writing to the register?

caird coinheringaahing

07:08

@Mr.Xcoder should I make it CW or not?

@Mr.Xcoder sorry ninja'd

Mr. Xcoder

@cairdcoinheringaahing Don't bother. If you really want it to be a CW, go ahead, but It's no need for that

caird coinheringaahing

@Mr.Xcoder alephalpha beat me to it D:

Mr. Xcoder

@cairdcoinheringaahing Ahhhh

The good part is I can use Swift

caird coinheringaahing

@Mr.Xcoder sorry I ninj'ad you :(

Mr. Xcoder

@cairdcoinheringaahing No, I couldn't post

I have the 05AB1E 20 mins ago

caird coinheringaahing

07:11

Look at the next one tho

Mr. Xcoder

The seq of ones?

caird coinheringaahing

oeis.org/A000001

Mr. Xcoder

Of no

Wait, Add++ is taken

Delete your answer please

@cairdcoinheringaahing ^

Oh no, it's not

Sorry

You have deleted it >_< (the older Add++)

caird coinheringaahing

@Mr.Xcoder yeah, I really want to demonstrate my languages in this, but the sequences can't be impossible

Mr. Xcoder

@cairdcoinheringaahing I already solved it in Swift

I am just waiting for an hour to pass

caird coinheringaahing

07:22

firgers crossed you don't get ninja'd

@Mr.Xcoder do you know Javascript?

Mr. Xcoder

@cairdcoinheringaahing No, I only know a tiny bit since I tried to learn HTML

@cairdcoinheringaahing Dang, I found a bug that invalidates my answer. I have to rewrite it.

caird coinheringaahing

@Mr.Xcoder you have 15 minutes tho

Mr. Xcoder

My code is already ~1k bytes long

caird coinheringaahing

@Mr.Xcoder we need higher numbers, more interesting sequences

Mr. Xcoder

I only have 11 mins

AHhhh

caird coinheringaahing

07:33

@Mr.Xcoder you are assuming that everyone else is going to post at the same time. No-one cares about it any more :)

Mr. Xcoder

I know, I just want to FGITW it

caird coinheringaahing

@BlackCap congrats on 2K!

Mr. Xcoder

@cairdcoinheringaahing I gave up, I couldn't fix it because the operations are too complex for Swift

caird coinheringaahing

I don't understand the oeis page :(

Mr. Xcoder

CMC: n - > n^2-√n

caird coinheringaahing

07:45

@Mr.Xcoder test cases?

Mr. Xcoder

@cairdcoinheringaahing 4 -> (square: 16, square root: 2) -> 14

9 -> 78

5 -> 22.76393202250021

Wow, OEIS is so slow

caird coinheringaahing

Has Maple gone yet?

Mr. Xcoder

@cairdcoinheringaahing Yes

@cairdcoinheringaahing Look at the new answer

caird coinheringaahing

Look at Lynn's answer!

Mr. Xcoder

@cairdcoinheringaahing Ninja'd

caird coinheringaahing

07:53

@Mr.Xcoder actually maple hasn't gone... interesting

Mr. Xcoder

Wait,,,

@cairdcoinheringaahing The sequence is incorrect: Incorrect g.f. deleted by N. J. A. Sloane, Sep 20 2008

OR.... That's the extension

caird coinheringaahing

@Mr.Xcoder ~~if it was incorrect, it wouldn't be on there~~ oeis.org/A000017

Mr. Xcoder

@cairdcoinheringaahing It's the extension

Wait, aren't there finite sociable numbers?

Qwerp-Derp

Is there a challenge where you have to output all permutations of your source code?

Mr. Xcoder

@Qwerp-Derp I think there is

Not sure though

@Qwerp-Derp But 1-byte solutions like 1... How would you handle those?

Qwerp-Derp

07:58

Good point

Actually I have a better challenge

Anagram chain quine

So a program outputs another program that uses all the same bytes, but in a different order

And that chain continues on

Mr. Xcoder

22

Q: Golf an Anagram Quine

In this question I asked you to guess an anagram quine based on its output. However it looks like we don't have a question asking to golf an anagram quine yet. So your task will be to make the shortest anagram quine that you can. What is an anagram quine? An anagram quine is a non empty progr...

Qwerp-Derp

Until it returns to the starting quine

Mr. Xcoder

I gtg now

Qwerp-Derp

@Mr.Xcoder Wait till I finish... :(

Bye

Mr. Xcoder

@Qwerp-Derp Sorry, I am in a rush... I really have to go. I'll ping you when I'm back

Qwerp-Derp

08:02

@Mr.Xcoder Oh, I was referring to you posting that link before I finished explaining my concept :P

Sorry for the confusion

caird coinheringaahing

@Qwerp-Derp it looks like it won't be a dupe codegolf.stackexchange.com/questions/tagged/…

Qwerp-Derp

Hmmm, I'll post it in the sandbox

Mr. Xcoder

@Qwerp-Derp I'm back. I had an emergency

caird coinheringaahing

I got 8 minutes before I can post again

Qwerp-Derp

(To both of you) what happened?

caird coinheringaahing

08:14

@Qwerp-Derp answer chaining question

31

Q: One OEIS after another

This is an answer chaining question that uses sequences from OEIS, and the length of the previous submission. This answer chaining question will work in the following way: I will post the first answer. All other solutions must stem from that. The next user (let's call them userA) will find the...

sequence answer-chaining

Qwerp-Derp

@cairdcoinheringaahing Oh

Mr. Xcoder

@Qwerp-Derp A home situation

Qwerp-Derp

@Mr.Xcoder Ah

caird coinheringaahing

@Qwerp-Derp how good are you at sequences?

Qwerp-Derp

@cairdcoinheringaahing I'm alright, I'm thinking of a solution for the current one

Mr. Xcoder

08:16

I now see I have two answers on your question :)

Hardcoding is the solution

caird coinheringaahing

@Mr.Xcoder I have 2 as well. Leaky has about 1 an hour :)

Mr. Xcoder

@cairdcoinheringaahing @Qwerp-Derp What languages do you know?

caird coinheringaahing

@Mr.Xcoder github.com/SatansSon?tab=repositories

Qwerp-Derp

@Mr.Xcoder Clojure is probably the only usable one in the challenge :P

Mr. Xcoder

@Qwerp-Derp No, in general

Qwerp-Derp

08:18

Oh

Clojure, Ruby, Python, JS, Java, Dart

Mr. Xcoder

I know Swift 2, Swift 3, Python 2, Python 3, Pyth

And I am planning to learn Jelly

Or 05AB1E

@cairdcoinheringaahing How is the Jelly training going?

caird coinheringaahing

@Mr.Xcoder if you're planning to learn Jelly, I have 1 word of advice: don't

Mr. Xcoder

@cairdcoinheringaahing Why? It's the best golf-lang. I mean, except for the Hypertraining, it's ok

@cairdcoinheringaahing Also, what documentation do you use for learning Jelly?

caird coinheringaahing

@Mr.Xcoder github.com/DennisMitchell/jelly/wiki

Mr. Xcoder

@cairdcoinheringaahing Thanks

@cairdcoinheringaahing Does Jelly have a fancy search bar (like Pyth does)?

caird coinheringaahing

08:22

@Mr.Xcoder Jelly is a nice language once you know it, but until then, its horrible in its memory system

@Mr.Xcoder No but just use Ctrl-F

Mr. Xcoder

@cairdcoinheringaahing I am on Mac >_<

caird coinheringaahing

@Mr.Xcoder Cmd-F

Mr. Xcoder

@cairdcoinheringaahing :D, I have to set up a custom keyboard layout

caird coinheringaahing

@Mr.Xcoder copy and paste

Mr. Xcoder

@cairdcoinheringaahing That is not really handy

caird coinheringaahing

08:24

If you actually want to learn it, start out with some easy challenges before applying

I've got nothing on right now, so do you want to start?

Mr. Xcoder

@cairdcoinheringaahing Give me a very, very easy one

caird coinheringaahing

@Mr.Xcoder add two numbers, 1 byte

Mr. Xcoder

+?

caird coinheringaahing

@Mr.Xcoder yep

Now subtract two numbers

Mr. Xcoder

-?

caird coinheringaahing

08:25

Nope

tio.run/#jelly

Use that to test

Mr. Xcoder

tio.run/##y0rNyan8/1/3////xv9NAA

It works ^

@cairdcoinheringaahing ?

caird coinheringaahing

Does it? tio.run/##y0rNyan8/1/3////pgb/TQA

Mr. Xcoder

Oh, coincidence

Wait, searching now

caird coinheringaahing

oshit i've gtg rn, but try these

Mr. Xcoder

@cairdcoinheringaahing I'll ping you every time I solve one

@cairdcoinheringaahing Subtraction: _

caird coinheringaahing

08:31

@Mr.Xcoder yep

Mr. Xcoder

@cairdcoinheringaahing Multiplication: ×, Division: ÷, Integer division: :, Modulus: %, Negate a number: N

caird coinheringaahing

@Mr.Xcoder all correct

Mr. Xcoder

Absolute value: A

caird coinheringaahing

The first few are all builtins. It gets harder later

Mr. Xcoder

@cairdcoinheringaahing I'll still ping you when I solve some

@cairdcoinheringaahing The nth prime: ÆN

caird coinheringaahing

08:35

@Mr.Xcoder and the Nth fibonacci?

Mr. Xcoder

@cairdcoinheringaahing Now solving

~~solving~~ serching

@cairdcoinheringaahing ÆḞ

This one is harder: Create an N×M 2D array (list of lists) of anything. Even inconsistent values are allowed.

@cairdcoinheringaahing Hint on the above one ^?

caird coinheringaahing

@Mr.Xcoder I'm trying to find my solution now

@Mr.Xcoder inconsistent values are allowed, but they don't have to be all inconsistant

Mr. Xcoder

I don't know how to create a list yet

caird coinheringaahing

Can you create a list from [1...N]?

Mr. Xcoder

@cairdcoinheringaahing I do

caird coinheringaahing

08:44

@Mr.Xcoder how then?

Mr. Xcoder

R

Now finding the other atom

@cairdcoinheringaahing Just give me the other character

caird coinheringaahing

@Mr.Xcoder look for a way of repeating a list

Qwerp-Derp

138 is a really frustrating number, far out

Mr. Xcoder

@cairdcoinheringaahing xR

Is that correct?

caird coinheringaahing

@Mr.Xcoder yep. Exactly the same as mine

Qwerp-Derp

08:48

[138 150 222 234 312 528 960 2088 3762 5598 6570 10746 13254 13830 19434 20886 21606 25098 26742 26754 40446 63234 77406 110754 171486 2
53458 295740 647748 1077612 1467588 1956812 2109796 1889486 953914 668966 353578 176792 254128 308832 502104 753216 1240176 2422288 2697
920 3727264 3655076 2760844 2100740 2310856 2455544 3212776 3751064 3282196 2723020 3035684 2299240 2988440 5297320 8325080 11222920 153
59480 19199440 28875608 25266172 19406148 26552604 40541052 54202884 72270540 147793668 228408732 348957876 508132204 404465636 30370837

Mr. Xcoder

@cairdcoinheringaahing Jelly doesn't seem that hard

caird coinheringaahing

@Mr.Xcoder try the "Draw a diagonal line"

Mr. Xcoder

@cairdcoinheringaahing Wait

Qwerp-Derp

This is how far I've gotten with 138, where the next term in the sequence is the sum of the factors before it

Mr. Xcoder

I try to reverse an array

caird coinheringaahing

08:49

@Mr.Xcoder once you get beyond 2 bytes, it starts getting dificult

Mr. Xcoder

@cairdcoinheringaahing Ṛ

@cairdcoinheringaahing Mind if I solve them in order?

caird coinheringaahing

@Mr.Xcoder sure, its up to you

@Mr.Xcoder but the reverse an array can be better

Mr. Xcoder

@cairdcoinheringaahing U?

caird coinheringaahing

@Mr.Xcoder yep. Do you know why they're different?

Mr. Xcoder

@cairdcoinheringaahing Type or performance?

caird coinheringaahing

08:51

@Mr.Xcoder what does U do that Ṛ doesn't?

Mr. Xcoder

Upends

caird coinheringaahing

@Mr.Xcoder that's the same as reverse

Mr. Xcoder

@cairdcoinheringaahing Vectorizes?

caird coinheringaahing

@Mr.Xcoder do you know what vectorizing is?

Mr. Xcoder

@cairdcoinheringaahing Not yet, planning to find out

caird coinheringaahing

08:53

@Mr.Xcoder should I tell you?

Mr. Xcoder

@cairdcoinheringaahing Yes

caird coinheringaahing

Vectorizes means that it happens to each, rather than just to one

Mr. Xcoder

@cairdcoinheringaahing I see

Qwerp-Derp

I'm pretty sure https://oeis.org/A003416 is unachieveable without hardcoding

Mr. Xcoder

So [1,2],1,2,3 would become [[2, 1], 1, 2, 3]

caird coinheringaahing

08:54

@Mr.Xcoder like this

Mr. Xcoder

@cairdcoinheringaahing What's the built-in for 1/n

?

caird coinheringaahing

@Mr.Xcoder Search for 1 ÷ z

Mr. Xcoder

It's İ

caird coinheringaahing

Exactly

Mr. Xcoder

I'll be back in ~30 seconds

> Given a prime number N, find the prime after N (e.g. f(47)=53) Minimum needed bytes: 2

@cairdcoinheringaahing Æn

caird coinheringaahing

08:59

@Mr.Xcoder yes. Now you get to the more difficult stuff

Mr. Xcoder

@cairdcoinheringaahing Can't wait to :)

caird coinheringaahing

I've gtg run tho, so keep working on it

Mr. Xcoder

Still ping you

caird coinheringaahing

@Mr.Xcoder once you've done this one in < 9 bytes, try the Diagonal line one to get used to strings, then apply for Hypertraining. That's what I did :)

Mr. Xcoder

@cairdcoinheringaahing < 9 bytes.... never

@cairdcoinheringaahing Any hint?

Before you leave?

I think I can combine Ẇ and R

Anyone here that knows Jelly?

What variable does Ðf use?

caird coinheringaahing

10:00

@Mr.Xcoder sorry about that. What do you need?

Cows quack

@Qwerp-Derp what is that?

Qwerp-Derp

10:18

@Cowsquack Aliquot sequence of 138

Mr. Xcoder

@cairdcoinheringaahing Can you explain me how to use Ðf?

caird coinheringaahing

@Mr.Xcoder Ðf filters z, depending on whether the previous atom results in true of false.

Mr. Xcoder

@cairdcoinheringaahing Can you also explain the principle of link? I don't really understand how that work

caird coinheringaahing

For example, to find all prime numbers below the input, this works

Mr. Xcoder

@cairdcoinheringaahing And If I want to compare stuff to the current thing, what should I use?

I want to check if the sum of the subset is equal to the input

I can use S to sum the array, = to compare, but I do not know what to sum.

caird coinheringaahing

10:28

If the thing uses more that 1 builtin e.g. =10, you can create a new link. for example

Mr. Xcoder

Like S<something>=³, what's the something?

caird coinheringaahing

the input?

Mr. Xcoder

@cairdcoinheringaahing No, let me code it and I'll ask

caird coinheringaahing

@Mr.Xcoder do you mean like tio.run/##y0rNyan8/982mCvo4a62w@2HJ6T9///f0AAA

Mr. Xcoder

@cairdcoinheringaahing I have ẆR, and I want to filter those whose sum equal the input.

How do I filter those properly?

NVM

@cairdcoinheringaahing Let's say I add this as an argument: [1,2,3,4], [1,2,3], [2,2,2]. How do I filter those whose sum is 6?

caird coinheringaahing

10:34

@Mr.Xcoder tio.run/##y0rNyan8/z/Y1ozrcPvhCWn///…

Mr. Xcoder

@cairdcoinheringaahing What's Ç?

Last link as a monad?

caird coinheringaahing

@Mr.Xcoder each line in a Jelly program is a function, with only the last being executed by default. Ç calls the previous function (link) with 1 argument (monadically)

Mr. Xcoder

@cairdcoinheringaahing Ok, give me a simple filter task (not in the problems to try page)

caird coinheringaahing

@Mr.Xcoder given an integer, find all prime numbers strictly less than it

Mr. Xcoder

@cairdcoinheringaahing Ok, thanks

@cairdcoinheringaahing ÆR

No, it does not work

It is strictly less

caird coinheringaahing

10:41

@Mr.Xcoder do it without using a builtin. Your code must have Ðf or Ðḟ in it

Mr. Xcoder

@cairdcoinheringaahing That's what I was doing now :)

caird coinheringaahing

spoiler, no Ðf or Ðḟ

Mr. Xcoder

I have ÆPÐf, but I must work with strictly

caird coinheringaahing

spoiler, 5 bytes

Mr. Xcoder

I have 3 bytes: ’ÆR, uses ’ to decrement and the built-in then, working on the Ðf one

@cairdcoinheringaahing ḶÆPÐf, Lowered range Ḷ, If it is prime: ÆP, Ðf - filter

Oh, that were your solutions too >_>

caird coinheringaahing

10:46

@Mr.Xcoder good. Now try "Given an integer, find all triangular numbers strictly less than it"

Mr. Xcoder

Don't spoiler me, because if I figure it out, I feel like you think I copied them

caird coinheringaahing

@Mr.Xcoder I gave you the benefit of the doubt :)

Mr. Xcoder

@cairdcoinheringaahing Give me other numbers than Triangular, I really dislike Shape-Numbers

caird coinheringaahing

@Mr.Xcoder stick with it, but here is a hint

Mr. Xcoder

8n+1 is a perfect square, ok, will stick with it

Cows quack

10:50

@cairdcoinheringaahing why doesn't this work: tio.run/##y0rNyan8/z9IO8Ym@P///@YA?

Mr. Xcoder

Does Jelly have a perfect square built-in?

caird coinheringaahing

@Mr.Xcoder yes.

@Cowsquack I don't get what the <S is for?

Cows quack

< is to find numbers less than the argument, and S is to sum them

but it doesn't sum them ;_;

caird coinheringaahing

@Cowsquack because it evaluates to "which items in the list are less than the sum of the argument" e.g. => [1,2,3,4] 3 => [1,1,0,0]`

You'd need to separate < and S

Cows quack

how?

caird coinheringaahing

10:54

github.com/DennisMitchell/jelly/wiki/…

Mr. Xcoder

@cairdcoinheringaahing Why doesn't this: Æ²‘×8ÐfḶ work?

Nor does this:

Æ²‘×8
ÇÐfḶ

Cows quack

then my solution is at 6 bytes

Mr. Xcoder

@cairdcoinheringaahing ?

caird coinheringaahing

@Mr.Xcoder tio.run/##y0rNyan8//…

Mr. Xcoder

@cairdcoinheringaahing Can I just check if a number is triangular for now?

Cows quack

10:59

@cairdcoinheringaahing what are things in parentheses like (1/0)?

caird coinheringaahing

@Mr.Xcoder for the first link, you've got the correct atoms, but in the wrong order.

@Cowsquack the results

Transcript for