Find the least amount of different numbers to pick from positive integers that are at most 100 to guarantee two pairs of numbers that add up to 101.
Find the least amount of different numbers to pick from positive integers that are at most 100 to guarantee two pairs of numbers that add up to 101.
Algebra: Structure And Method, Book 1
(REV)00th Edition
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Chapter4: Polynomials
Section4.2: Adding And Subtracting Polynomials
Problem 13ST
Related questions
Question
Find the least amount of different numbers to pick from positive integers that are at most 100 to guarantee two pairs of numbers that add up to 101.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Elementary Algebra
Algebra
ISBN:
9780998625713
Author:
Lynn Marecek, MaryAnne Anthony-Smith
Publisher:
OpenStax - Rice University
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Elementary Algebra
Algebra
ISBN:
9780998625713
Author:
Lynn Marecek, MaryAnne Anthony-Smith
Publisher:
OpenStax - Rice University