The Nineteenth Byte

Rats I got beaten to the punch

Anonymous

@flawr If you read on, you will see that you may assume |gamma(t)| < 10^9

But why do you ask for an upper limit of 10^7 then????

11:45 PM

@TanMath The digits function in Julia returns an array of the digits of its input in reverse order. Thus it has to be reversed to get it in the desired order.

@AlexA. oh...

@AlexA. and this? x = map(i -> parse(join(i)), p)

Calvin's Hobbies

@Mego Flawr has a point. The t limits and gamma(t) limits are conflicting rules

I mean then you could make an upper bound of t<14...

Anonymous

@Calvin'sHobbies They're not conflicting, per se, but they are confusing. I'm going to clarify that.

gamma(14) = 6.2270e+009

please provide a range for t wher |gamma(t)|<10^9 ...

11:49 PM

@TanMath p is an array of arrays corresponding to partitions of the digits. For example, if you have [[1,2],1], this corresponds to the partition [12,1]. In order to get to that, you have to join the digits, so you map join to each element of [[1,2],1], yielding ["12","1"]. But we need them as integers, so we parse them as well, yielding the desired [12,1]. Does that make sense?

@AlexA. yep! thanks!

No problem :)

Now I remember why I hate Octave

@AlexA. Do you know Octave?

A bit.

@quartata why..

11:50 PM

@(t){quadcc(@(x){x.^(t-1).*exp(-x)},0,Inf)}

TheDoctor

3

A: Count up forever

Marbelous, 11450 4632 bytes Printing decimals is a pain!! Definitely not winning with this one, but I though I'd give it a shot. I hope it's ok that it pads the output to 40 zeros (to fit 2^128). 00@0..@1..@2..@3..@4..@5..@6..@7..@8..@9..@A..@B..@C..@D..@E..@F..@G..@H..@I..@J \\++..00..00..00....

fixed it (only 4 thousand bytes now!)

Throws

error: quadcc: integrand F must return a single, real-valued vector

Y

For one I don't think you need the curly braces in the inner function handle

(I don't think that'll help the error though)

It actually did....

Calvin's Hobbies

Also the squiggly braces need to match

11:52 PM

But now it says the integral was divergent which it wasn't

Hmm

Oh really? You removed the braces and it worked?

@mego Please also provide a reasonable lower bound!!!

@AlexA. I don't think it is doing what it is supposed to be doing now though.

@quartata It diverges close to 0. Try using a small number rather than 0 as the lower bound.

How about eps

11:53 PM

Yeah I was just about to ask if Octave had epsilon

Martin Büttner

@TheDoctor does the interpreter actually require all those trailing empty cells?

@quartata It does, it's eps.

It's doing some strange stuff now though.

3->2

TheDoctor

i think so, too busy to test atm

Btw though, "You may not use a built-in Gamma function to solve this task, nor may you use built-in numeric or symbolic integration functions."

11:53 PM

-2.5->5.4445e+38

@AlexA. Wait, whattt?

Oh nevermind then.

bleh

I have to implement a integration rule myself

How is this C one 85 bytes

hey, is there like a taylor series for the gamma function?

Anonymous

@quartata It uses the explicit formula. I'm running it on the test data; I'll check back in a few weeks.

@Mego Please also provide a reasonable lower bound...

@Mego yeah...

I suggest a lower bound of 0 as the gamma function does pretty wild things...

11:56 PM

@flawr For input?

Anonymous

@flawr Then you lose half the fun :)

@Mego That approximation is so slow, I wonder if it should even count as valid

@Mego Comon, YOU said you do not want to spend time finding those intervals, but you expect to do so from the participants??????

@flawr Math

Calvin's Hobbies

@quartata It's unfair to go changing rules now

Anonymous

11:58 PM

@flawr For every consecutive set of negative integers, there is an open set between them that contains t values for which |Γ(t)| < 10^9 . There are 1 billion of them. Enumerating them would be costly, both in time and in text. You do not need to know the exact ranges - just assume that the input will be in them.

@Calvin'sHobbies I know, but we have no way of validating it because it is so damn slow

Anonymous

If the input would produce an output x such that |x| >= 10^9, I don't care what your program does.