16 Pairs Problem
I need to generate all the 16 ordered pairs (y,z) using integers (x) : 1,2,3....16 ,where (y,z) are the 16 combinations of 2,-2,6,-6. In need a formula for both y and z.
Output should be like ( y=f(x),z=g(x) ), x=1,2....16. So, if I substitute x=1,2...16 in ( y=f(x),z=g(x) ), I should get all the 16 ordered pairs.
The answer is 0.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!