1) Choose any 6 numbers from first 7 natural numbers, express the other number using these 6 numbers exactly once and only one operator. This should work for any choice of 6 numbers. What is the operator that has to be chosen?

2) Replace 6 by (n-1) and 7 by n in (1), find for which n, this logic works. If the chosen numbers have to be used at least once, find the other n values for which this logic works.

I actually want to give it in the algorithms, but there is
nothing there except the expression and the logic behind it.
So, I gave it in numbers, I should have mentioned it.
I'm sorry for the incovenience for that "only one operator" statement.

The logic will be really cool, try to solve this.

Edited on August 27, 2007, 2:49 am

Posted by Praneeth on 2007-08-27 02:49:06