Think Perfectly!
Let be set of perfect square . In set there exists two distinct elements whose difference is always divisible by 10.
Then find the minimum number of elements in set .
The answer is 7.
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!