Pencil attack!
There are 100 heaps on the table. The first conatins exactly 1 pencil. The second conatins exactly 2 pencils. The third contains exactly 3 pencils. And so on... The 100th contains exactly 100 pencils.
In a step we can choose some (minimum one) heap(s) and collect exactly the same number of pencils from each chosen heap.
What is the minimum number of steps we need to collect all of the pencils?
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!