0 votes 0 votes Show that among any n + 1 positive integers not exceeding 2n there must be an integer that divides one of the other integers. Mathematical Logic pigeonhole-principle combinatory + – ankit aingh asked May 12, 2018 ankit aingh 1.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply pankaj_vir commented May 12, 2018 reply Follow Share https://math.stackexchange.com/questions/2077929/induction-to-prove-that-a-set-of-n1-integers-between-1-and-2n-has-at-leas 0 votes 0 votes Please log in or register to add a comment.