Skip to main content

Timeline for Sandbox for Proposed Challenges

Current License: CC BY-SA 4.0

10 events
when toggle format what by license comment
Apr 3, 2020 at 18:26 history edited Wheat WizardMod CC BY-SA 4.0
deleted 1503 characters in body
Apr 3, 2020 at 7:27 comment added user92069 Let the first and second items of the list be x and y respectively. This checks whether input-x is divisible by y-x. (Doesn't work sometimes, I'll take a look.)
Apr 2, 2020 at 15:52 history edited Wheat WizardMod CC BY-SA 4.0
added 1117 characters in body
Apr 2, 2020 at 13:14 comment added Wheat Wizard Mod @xnor I don't think I will limit it to positive integers because positive integers are not bounded below, meaning sequences could only increase. This pretty radically changes the content of the challenge.
Apr 2, 2020 at 12:35 comment added xnor I don't know what you want to allow, but some other possible implementations of infinite lists could be as a generator function that produces a new value on each call, or a black-box function taking a natural n and giving the n'th value.
Apr 2, 2020 at 8:36 comment added simonalexander2005 In some languages the input could be a stream or iterator
Apr 2, 2020 at 6:14 comment added Mitchell Spector How do you propose taking an infinite list as input? I think the natural approach would use as "input" a program (or function with no arguments) that runs forever; the list would consist of the numbers that it outputs when run. (This would be sort of like a plug-in that your answer could use.) The problem is that that might make the challenge trivial. But I'm not sure how else to take the input list.
Apr 2, 2020 at 4:26 comment added xnor I like this idea. Do we have a default for taking "infinite lists" as input? I'd mildly suggest limiting the numbers to positive integers on general principle.
Apr 1, 2020 at 20:56 history edited Wheat WizardMod CC BY-SA 4.0
added 11 characters in body
Apr 1, 2020 at 20:30 history answered Wheat WizardMod CC BY-SA 4.0