Split by common divisors, count |b| values
6.NS.B.47.NS.A.26.NS.C.7
Generated variants — 12
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $4$ and $6$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $6$ and $9$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $6$ and $10$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $8$ and $12$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $8$ and $12$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $9$ and $15$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $10$ and $15$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives ; gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $12$ and $18$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $12$ and $20$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $14$ and $21$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $18$ and $27$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
How many ordered pairs of integers satisfy both of the following conditions?
- (a) and are both integers.
- (b)
Show solution
1 · Understandwhat's really being asked
Count integer pairs where divides both and , and is at least but less than .
Givens
- and are integers.
- and are integers.
Unknowns
- The number of ordered pairs .
Constraints
- because it is a denominator.
- Each allowed value of (other than ) gives two values of .
2 · Planchoose the strategy
#2 Make a Systematic List
Condition (a) leaves only a few choices for , so split into one case per . In each case, condition (b) becomes a range for , and each value of gives two values of , one positive and one negative.
3 · Execute5 carry out the plan
1Find the sign of a
2List the choices for a
3Turn (b) into a range for |b|
4Read off |b| in each case
5Count the pairs
4 · Reviewdoes it hold up?
Spot-check a pair from each case: gives ; gives ; gives ; gives , all in . And gives exactly , correctly excluded.
Standardsmin grade 7
6.NS.B.4Find GCF and LCM; distributive property with a common factor — Finding the common divisors of $12$ and $30$.7.NS.A.2Apply and extend understanding of multiplication and division of rational numbers — Using the sign rule for quotients to see that $a$ must be positive.6.NS.C.7Order and absolute value of rational numbers — Turning the bound on $|b|$ into the integers $b$ at those distances from $0$.
Where next?
← Back to the problem: Split by common divisors, count |b| values