Yahoo Answers is shutting down on May 4th, 2021 (Eastern Time) and beginning April 20th, 2021 (Eastern Time) the Yahoo Answers website will be in read-only mode. There will be no changes to other Yahoo properties or services, or your Yahoo account. You can find more information about the Yahoo Answers shutdown and how to download your data on this help page.

Trending News

Promoted
Will
Will asked in Science & MathematicsMathematics · 5 years ago

Let xi, I = 1,2, …, n be distinct integers. What should be the value of n so that there are at least two integers...?

Let xi, I = 1,2, …, n be distinct integers. What should be the value of n so that there are at least two integers, xj and xk such that xjMOD5 = xkMOD5?

Note: The definition of xMODy is the remainder when x is divided by y

1 Answer

Relevance
  • Julius N
    Lv 7
    5 years ago

    if you look at the set of all integers mod 5, there are only 5 of them = {0,1,2,3,4}

    if you have a set of 6 integers (actually, they don't even have to be distinct), at least two of them must be equal mod 5.

    so the answer is n ≥ 6

Still have questions? Get your answers by asking now.