0010 == lambda x: x == identity == print

oh

you just mean a language with a binary alphabet

I would like to answer with with whatever the standard rule is, but I don't know what the standard rule is.

well, there's also Unary, but that won't score very well ;)

@durron597 I think external libraries are usually the challenge author's call

@MartinBüttner you don't need binary alphabet, that's just a coincidence

if CJam had a -b flag for interpreting 0/1 input, that would work too

hmm, right, I meant binary alphabet, just didn't know it :)

Heck yes. I'm sad for gender inequality, but stoked that more people named John are CEO than anyone else. nytimes.com/2015/03/03/upshot/…

@MartinBüttner I don't know what sort of can of worms I'm opening up if I say yes

@Bigtoes not every multiple

Really? How long does it last? I only tested the first four. Extrapolation sucks...

there's one missing around 24k

but it continues afterwards

so the 7th multiple is missing

I wonder if the 14th is :)

it'll take a while, but I'll let you know ;)

my search is somewhere around 35k now, and so far I haven't found any numbers that aren't multiples of the first, and none of them are substantially beyond 4N

It is... it's 3.98N.

What a weird sequence.

@durron597 This kind of worm.

@MartinBüttner ok, 4N is defs not the bound here what you are talking about, but it is the bound for the algorithm that I have, to not to mess up the first N numbers. Although I did not think that swaps from < N numbers will affect Nth swap with N2* th

but if you cannot find anything with more than 5N difference, that I would opt for that :P

5N is just as random a guess as 4N

include a proof that it's enough or use (N+1)^2

(or just ditch the array manipulation altogether, because the other approach is shorter anyway :P)

Why do we not consider things like ⎕IO=0 mode for APL in the code size ?

just like we do for flags in other languages.

@Bigtoes 10 and 11 were missing, 12 is included again

@PhiNotPi Oh I would have guessed this kind of worm.

Binary lambda calculus wouldn't though as if the input is binary the output is binary too.

@MartinBüttner is there a proof that prime numbers are not in this sequence ?

I haven't seen one, but I'm sure I could come up with one, it seems fairly intuitive when you think about it

why do you ask?

well in an infinite sequence, if we cannot say that prime number appears at some N, then maybe we also cannot say that 9N bound is broken at some N :D

whether prime numbers appear or not is completely irrelevant for the challenge

no submission relies on that

Every prime p gets shifted to 2p first. Then on the 2pth iteration, it gets shifted again since 2p's only factors are 2 and p. Repeat for every 2^n p, and you see it only ever gets shifted rightward.

ninja'd

so.. even N^2 bound is not sufficient for prime numbers... right ? :P

the challenge doesn't ask you to find the position of a number in the shotgun sequence

it gives you a position and asks for the number at that position

there are numbers at prime positions

and those numbers will be less than or equal to N^2

I meant for an N where shotgun(N) is prime

but such an N doesn't exist

Has anyone managed to prove that 10 never appears either?

that's same as saying that Infinity does not exist

Infinity is merely a concept.

A concept that exists

@Optimizer ... what?

@durron597 I think all numbers which are swapped upwards on their first swap don't appear

no that can't be right

6 is one of those numbers

@Optimizer Infinity is not a number. Infinity represents a value increasing without bounds.

who says that infinity is increasing?

I totally think that its a constant

I'd say infinity is an entity that's defined to be larger than any real number

@MartinBüttner I also love that (obviously...). It even brings up ones I never posted to the answer (presumably via the chatroom)

I think they're all from the chatroom

Infinity is a concept

Real numbers are closed on addition, in other words if you add two real numbers you get another real number

however you can't add two reals and get infinity

Someone ruined our fun

imgur.com/74LbjRr linky

On the bright side, I had no idea that National Grammar Day existed. Now I do

National grammar day!

Ich bin auch so ein Orthograph mit Faschismushintergrund.

Our CEO appropriately responded with this: morningglory2.files.wordpress.com/2006/03/grammarpolice.jpg

lol

So weird to see him being funny

oh sweet, I've reached the top of one of the review queues

i asked my math phd friend about 10 not appearing

he said that "in the same way that primes p don't appear because they get swapped at step p, anything that happens to be in slot n at step n will also never appear"

1 is at slot 1 at 1st step

indexed by which number you're swapping

@FUZxxl What is an orthograph?

@Optimizer please don't approve prettify-only edits for challenges that aren't on the front page anyway :/

"I 'm also such a OrthoGraph with fascism background"

@MartinBüttner I don't see any harm

so because 10 is in slot 9 at step 9, 10 never appears.

right

now the question is, why does it get swapped into slot 9 ;)

The winky face means he has you right where he wants you.

@Rainbolt An orthographer is someone who studies orthography.

Hmmm. I might use Bailtron as my screenname in whatever MMO I play next

Orbilnat works as well

matcher.locals[localIndex] = ~i; // HACK

Like Rainbolt is not different enough

If I were playing a mage that conjures rain, then sure. But that sounds lame.

Bailtron sounds so much cooler. It's like a transformer that helps people stay out of jail.

tron are only at the end of bad transformers

so its more like preventing people's Bail

Iron blat

Lion brat

Ant broil

Ant Bilor

Tin Ram

Martin is A burnt tent rim

A bürnt tent rim

@MartinBüttner going 16M+ by EOD

what?

@Bigtoes 14 was indeed missing

Time

I have no clue what you're talking about

Poor Optimizer. He's "Ire zit mop"

@Bigtoes I've got the first on that's not a multiple of 3465

69615

I'm not anything, I don't think.

Peb

@PhiNotPi Catch 22 states that it is impossible to prove that you don't think.

@PhiNotPi Bigtoes established earlier that you're "hop in pit"

pot in hip ?

Hipin' Top

Brat Nutriment

A Bitten Mr Runt

*Mr Rünt

Arm Bitten Runt

@MartinBüttner That's surprisingly coherent.

3 in a row goddammit

wow this has literally nothing to do with the words :D

The story does! You do better :P

no, lol, it's good

I was just expecting a challenge that would do something with words and you just couldn't decide on the words to use

I'm looking at this problem: codechef.com/problems/KINGSHIP

and it seems way too easy

simply take the (sum(list)-min(list))*min(list)

woooooo, Rainbolt is golfing!

@Rainbolt as my initial submission, yours doesn't check if the initial 0 is below the threshold

Is that so?

Give me an example that it fails

@Rainbolt f(5,{}) or f(5,{10})

@Rainbolt Why is the input a set not a list?

:+g -> :&

:|

thanks though

@MartinBüttner What output would you expect for print f(5,{10})?

For me, it outputs 1. Is that unexpected?

0

"So a positive T means the result is always falsy."

0 because the starting balance is 0, which is less than 5

Do I have my truthies and falsies backwards :(

Oh duh. I just need to swap two lines to check first then add

no I think it's correct otherwise

yes

Gah. But then I need an additional check after the last add

Don't obliterate my post yet I'm working on it

@Optimizer 0 [2 5 6 9] fails

as do two truthy examples from the post

hitting the threshold is fine, but you must not go below it

Taking me too long. Gonna delete then fix then undelete

oh, crap but I've got truthy and falsy the wrong way round...

Better now? codegolf.stackexchange.com/a/47388/18487

range(len(l)) makes me cringe

Straightforward but inefficient ;)

@Calvin'sHobbies can I take the list in an unrolled form? i.e. a variadic function that take parameters T, x1, x2, x3, ...

Yes.

lovely

Didn't know python had an any operator

for loop plus if statement = any

Aww heck there's an all too

not any becomes all

Woo! 32 mins to hnq

I don't see it

if someone upvoted the answers it would help :P

Cool. My only vote is the one Martin asked for

range len is really bothering me. I don't see anything in tips about that

I wanna iterate from 0 to size of list

@randomra how do you write an empty list in J?

never mind, got it

I love the ninja case that is tripping everyone (including myself) up

Hehe that snarky edit by @Calvin

@feersum You there?

yes?

g=lambda a,t:t<=0<(a and f(a[1:],t-a[0]))
print g(-1,[1,2,3])

Outputs false

Is that expected?

the array is supposed to be first

ah

g=lambda a,t:t<=0<(a and f(a[1:],t-a[0]))
print g([1,2,3],-1)

Traceback (most recent call last):
  File "<stdin>", line 3, in <module>
  File "<stdin>", line 2, in <lambda>
  File "<stdin>", line 1, in <lambda>
TypeError: object of type 'int' has no len()

@feersum That doesn't work either

Wait a sec

I think my session is messed up

Oh gah

I changed your func to g and didn't notice it was recursive

Excuse my ignorance

Beat me by a mile haha

beautiful

Ctrl+K if you were trying to post ascii art

   ___  __   _ _  __     __  ___  _
  / _ \/ /  (_) |/ /__  / /_/ _ \(_)
 / ___/ _ \/ /    / _ \/ __/ ___/ /
/_/  /_//_/_/_/|_/\___/\__/_/  /_/

It was with Ctrl+K, but didn't exactly work out.

hm, I wanted to do durron's challenge in Prelude, but I couldn't be bothered after Elizabeth ...

I need to make that Prelude metagolf challenge

I have a very rudimentary Core War parser done.

If somebody is willing to try to write an example entry, I guess I'd appreciate it.

@MartinBüttner Reuse your quine and encode the string as two digits each? :P

hmmmm :)

right, without newlines, I can use an offset

trying CH's challenge now though