not much of a pure thinker, but have come across a problem which states the following:find the number, N, which lets the numbers 1 through to 10 divide it and leave a remainder 1, but when divided by 11 leaves no remainder.tks people look forward to hearing some answers
maybe i'm way off the mark, but if you take the two general inequalities for the existence of a traingle, and using a monte carlo type simulation, i.e by making arbitrary cuts in the sticks and then averaging, the density is just under 0.33... thoughts?