Hard eggs

There is a building with n floors and you are given k hard eggs. It is given that if an egg breaks if thrown from floor x, it will break if thrown from floor y > x. Now, the task is to find the maximum floor throwing from which the egg would not break(hereon the threshold). To perform this task, we can do this operation one or more times. One operation is defined by throwing the egg from any floor