12:23 AM
0

The coefficients of a perfect square polynomial can be calculated by the formula \\$(ax)^2 + 2abx + b^2\\$, where both a and b are integers. The objective of this challenge is to create a program is to create a program that not only can find if an input trinomial is a perfect square, but also find ...

3 hours later…
3:52 AM
I think it looks good

4 hours later…
7:49 AM
0

Background Information An iterated function fn(x) is defined as f(f(f(x)...) for n times. For instance if f(x)=2x+2, then f2(x)=f(f(x))=4x+6. But this definition only works for an integer iteration value. Bbased on the rule that fa+b(x) = fa(fb(x)) , one could use a definition where f1/2(x) sati...

9 hours later…
4:54 PM
1

I tested the waters on this sort of question with python, but now I get to the real question I want to ask. restricted-source challenges are uniquely rewarding in Haskell because of Haskell's strict rule set. Type coercion which is the bread and butter for other languages in these sort of challe...

2 hours later…
7:23 PM
0

The purpose of this challenge is to figure out whether all the dominoes will fall, given an input string representing a top view of the table. Input format The program can take the input as a single string with newlines or a list of strings. Spaces denote, well, empty spaces, and the rest represe...

7:48 PM
2

Inspired by Find the largest fragile prime. By removing at least 1 digit from a positive integer, we can get a different non-negative integer. Note that this is different to the Remove function in the linked question. We say a prime number is delicate if all integers generated this way are not pr...

1 hour later…
8:52 PM
London, United Kingdom
-10,395
Jesus, that's a lot of rep given away in a year :P

I used to be first place in terms of rep given away. I need to step my game up

@WheatWizard Adám's APL deadline-less bounties look to be fairly doable bounties to claim, so I'd recommend something like that :P

2 hours later…
11:25 PM
Any last minute nominations?