Gonna Need A Big Chalkboard

A student randomly chooses \(m\) distinct numbers from among the first 2017 positive integers and writes them all on a chalkboard.

She then chooses two of the numbers written on the chalkboard, erases them both, and writes down their least common multiple. She repeats this process until only one number remains on the chalkboard.

What is the smallest integer \(m\) such that the final number is guaranteed to be a multiple of 128?

It may be helpful to note that \(128=2^{7}\) and 2017 is prime.

An example of the process with \(m=4.\)

An example of the process with \(m=4.\)


Bonus: Can you come up with a simple formula for the smallest \(m\) such that the final number is a multiple of \(n\), where \(n\) is a positive integer?

×

Problem Loading...

Note Loading...

Set Loading...