Given a polynomial function f (e.g. as a list p of real coefficients in ascending or descending order), a non-negative integer n, and a real value x, return:    f n(x) i.e. the value of f (f (f (…f (x)…))) for n applications of f on x. Use reasonable precision and rounding. Example cases p =...

Title cops-and-robbers code-golf This is a cops-and-robbers challenge, the robbers thread can be found here. ADD LINK Your task is to write some code that produces a memory leak in as few as bytes as possible. However, you should try and hide how your code does this as the robbers will be ...

(This challenge is very similar, but this current challenge has additional complications.) Imagine a 2-dimensional room, where the walls are plated with flat mirrors. Suddenly, a beam of light strikes into the room, where a piece of wall is missing! The lightbeam dances around the room, get...

I have a bunch of boards I need to stack in as small a space as possible. Unfortunately, the boards fall over if I stack them more than 10 high. I need a program to tell me how to stack the boards to take as little horizontal space as possible, without stacking boards more than ten high, or hav...

As described in this question: Dropsort, designed by David Morgan-Mar, is an example of a linear-time "sorting algorithm" that produces a list that is, in fact, sorted, but contains only some of the original elements. Any element that is not at least as large as the maximum of the elements pr...