flawr

Also I'm not sure if we've had something similar.

^ just a rough idea I had, but I have no idea how much it would even make sense. If anyone has any inputs let me know, I'd be happy to discuss!

@mousetail what about olds?

@mousetail thanks for the link, I thought there must have been something similar, but didn't find it in my first round of searching!

@LuisMendo but double has +-Inf, it cannot possibly be finite? :D

@SandboxPosts <--- anyway would anyone mind taking a look at this challenge?

can't have been more than a few months

but it's barely a pandemic

and a few years? It cant have been possibly more than a few months since the monica disaster

you mean regarding the AI stuff?

Again?

haven't been here in a while:)

... au chocolat

@UnrelatedString mrob.com/pub/seq/floretion.html

looks nice

good afternoon, just wanted to say hi and share this: loda-lang.org - it might be interesting for oeis enthusiasts!

can you also access the ones of other users?

oooh neat:)

see, the wrong hat makes your CTU (central thinking unit) completely confused

so it definitely is christmas time now

I'm pretty sure halloween happened last year

I must say I'm a little bit disappointed that you wear a non-christmassy hat now that we're in the christmas season

@cairdcoinheringaahing 'grats! may the hat protect your brain cells!

@WheatWizard will two mods be elected?

@Neil In case you're using numpy arrays instead of lists, you can just B[A] (assuming A is boolean)

right I know, but it would be most elegant:)

I'd go for arbitrary size integers:)

so that would be one avenue to solve the proposed challenge

with that theorem you can bound the range in which you have to search for solutions

(hence it would have a different focus than your original proposal)

or work with a methdo that works for all ranges

nothing, but they'd have to find the range themselves

and finding the solutinos itself would be relatively simple, but there would be many ways to approach it

That would make it trivial to reason about the correctness

e.g: Input is an arbitrary polynomial with integer coefficients where all real solutions are integers too. And the output should be all the integer solutions.

My suggestion is making a challenge that has a slightly different focus

@graffe do you know about the gershgorin circles?

brb (in a minute)

@graffe that is not actually much more difficult, just a little bit more fluff

with only integer solutions

but not sure if it has been done: you could extend your challenge to arbitrary polynomials

sure!

can happen to anyone:)

:)

you only need to do it 201 times

but why 201^5 times?

to check if a number is a solution, you just need to plug it into the equation and see if 0 comes out, no?

then I guess many people would just iterate over the integers until all solutions have been found

What would be your criterion for correctness?