The Nineteenth Byte

« first day (1517 days earlier) ← previous day next day → last day (3624 days later) »

TheBestOne

03:10

@Rainbolt The Anthem insurance company just mailed me about the incident you mentioned in chat a few weeks ago. It must of been pretty bad because I'm not even old enough to buy insurance yet.

7 hours later…

Martin Büttner

10:13

@feersum does your pluralisation proposal have your own implicit upvote?

feersum

@MartinBüttner I suppose so

3 hours later…

Rainbolt

13:02

@TheBestOne What issue was that? I don't recall having insurance problems

I mean, other than the fact that unsolicited callers keep harassing me by phone. But I don't recall mentioning that here

1 hour later…

TheBestOne

14:33

Feb 9 at 19:01, by Rainbolt

FML. My insurance company just reported that my social security number was breached.

Rainbolt

@TheBestOne I had completely forgotten about that. I think someone found a website where I could find out if I was at risk. I wasn't. I changed the password for my two email accounts and forgot it happened.

Optimizer

15:20

@MartinBüttner more than 1 day and pebble time is hitting 20M in 90K

Martin Büttner

15:38

90k backers?

Optimizer

money . dude

85K now

so you can get an idea of the speed.

Martin Büttner

Oh, you mean there is 90k left, I see.

Not bad

2 hours later…

orlp

17:29

Good luck guys

Q: Computing truncated digit sums of e^n

Given an integer n output the sum of the first n decimal digits of the fractional part of en. Example input and outputs: 1 → 7 2 → 11 3 → 13 4 → 23 5 → 14 50 → 230 500 → 2360 5000 → 22819 Built-in functions computing digits of e or evaluating either power series or continued ...

Oops

nevermind that, that's way easier than I intended

due to there being a direct power series for x to the power of n

orlp

17:54

fixed the problem by switching to pi^n

Optimizer

still how many terms to take to get precise first n digits ?

was the question ..

I think digits of pi has been done. and summing them up is trivial enough to be a dupe

maybe digits of power of pi have not been done

@orlp you need to update those examples

orlp

@Optimizer I did

Q: Computing truncated digits sums of powers of pi

Given a positive integer n output the sum of the first n decimal digits of the fractional part of πn. Example input and outputs: 1 → 1 2 → 14 3 → 6 4 → 13 5 → 24 50 → 211 500 → 2305 5000 → 22852 Built-in functions computing digits of π or ...

code-golf math arithmetic pi

is the new question

Optimizer

oh ..

reload.

orlp

@Optimizer I deleted the question and created a new one, because I couldn't edit a deleted question, and I wouldn't want to undelete my question before making the edits.

nothing is worse than working on a challenge, and the challenge changing

VisualMelon

18:21

I think having your hands cut off might compare

Optimizer

melons don't have hands!

orlp

Neither do llama's

VisualMelon

Indeed, I speak from experiance

I wasn't always a Melon

orlp

LOL I thought your avatar was a duck when it was as small as it is here in chat

Geobits

That's okay, he thought melon's was a melon :P

orlp

18:27

or maybe you're an alpaca

I just don't know :(

3 hours later…

Optimizer

21:37

Its a llama.

TheBestOne

22:01

Optimizer is also gift-wrapped.

PhiNotPi

It is possible to write a program to output every provable statement?

I think so: starting with the axioms, there are only a finite number if actions that can be done in a single "step" of a proof.

Exhaustively do all of them, and repeat the process on the new set of proven statements.

Can this be converted into a challenge?

Optimizer

too broad ?

Martin Büttner

@PhiNotPi I don't think so. There was something in GEB about this...

PhiNotPi

I know it's impossible to output all true statements (incompleteness theorem and such)

Martin Büttner

22:20

What about statements that need an infinite number of deductions to be proven? (Like induction essentially, but in a generalised sense.)

BrainSteel

You would probably need clear limits on the complexity of the problem. Proving simple logical deductions is feasible, I suppose.

PhiNotPi

I'm thinking about geometry as the subject (think Euclid's 5 axioms)

I'm reading about mathematical induction, to see if it can be done.

BrainSteel

Do you mean these?

PhiNotPi

Does anyone else remember the proofs done as part of high-school geometry? That's what I am getting at.

@BrainSteel Yes, those are the five main axioms, although there's a bunch of other rules like the transitive property of equality and such.

BrainSteel

I remember them fairly well. I'm going to start teaching geometry to a couple students this summer. I don't know how to formulate a challenge about them.

PhiNotPi

22:35

Maybe it is only possible to list out everything provable by first order logic?

Well, the simplest idea would be "write the shortest program that will output all provable statements"