Ruby

Write a method detect_int that returns the first positive integer for which an arbitrary number of lambdas returns true. If no arguments are passed in, then detect_int should return 1.

For example:

lam1 = lambda { |x| x > 9 }
lam2 = lambda { |x| x**0.5 % 1 == 0 }

detect_int             # => 1
detect_int lam1        # => 10
detect_int lam2        # => 1
detect_int lam1, lam2  # => 16

lam1 = x => x > 9
lam2 = x => x**0.5 % 1 == 0

detect_int()             // => 1
detect_int(lam1)         // => 10
detect_int(lam2)         // => 1
detect_int(lam1,lam2)    // => 16

The testing rubric will never ask for a number that does not exist, like:

detect_int(lambda { |x| x.odd? }, lambda { |x| x.even? })      // => !??

detect_int(n=>n%2==1, n=>n%2==0)      // => !??

Note that loops constructed using the loop { block } syntax are limited to 5000 iterations, but solutions will not be constrained to integers less than 5000.

For examples, see the example test cases.