Consecutive integers and boxes

Logic Level 2

1    2        n  n number of ’s  (n+1)=n+2\large 1 \; \underbrace{\square \; 2 \; \square \; \cdots \; \square \; n \; \square}_{n \text{ number of }\square\text{'s}} \; (n+1) = n+ 2

What is the minimum value of the positive integer n>1n>1 such that we can fill in all the boxes above by using at least one of the four mathematical operators ( +,,×,÷+, -, \times , \div ) and the equation holds true?

Note: Order of operations (BODMAS) applied.

×

Problem Loading...

Note Loading...

Set Loading...