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 ...

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...

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...

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...

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...