Number Properties and Arithmetic

232 questions

Question 221Question

The positive integer nn has a prime factorization of the form 2a×3b×5c2^a \times 3^b \times 5^c, where aa, bb, and cc are positive integers. If nn is divisible by both 12 and 15, and nn has exactly 24 positive integer divisors, what is the least possible value of nn?

Show answer & explanation

Answer: 360

Answer

The least possible value of nn is 360.
To find the least value of n=2a×3b×5cn = 2^a \times 3^b \times 5^c divisible by 12=22×312 = 2^2 \times 3 and 15=3×515 = 3 \times 5, we require a2a \ge 2, b1b \ge 1, and c1c \ge 1. The number of positive divisors is (a+1)(b+1)(c+1)=24(a+1)(b+1)(c+1) = 24. Testing valid factor triples for 24 with a+13a+1 \ge 3, b+12b+1 \ge 2, and c+12c+1 \ge 2 gives possible values n=480n = 480 (from a=5,b=1,c=1a=5, b=1, c=1), n=360n = 360 (from a=3,b=2,c=1a=3, b=2, c=1), n=540n = 540 (from a=2,b=3,c=1a=2, b=3, c=1), and n=600n = 600 (from a=3,b=1,c=2a=3, b=1, c=2). The minimum among these valid integers is 360.

Step-by-Step Solution

1
Determine the minimum exponent constraints from divisibility conditions.
Since nn is divisible by 12=22×3112 = 2^2 \times 3^1, we must have a2a \ge 2 and b1b \ge 1. Since nn is divisible by 15=31×5115 = 3^1 \times 5^1, we must have b1b \ge 1 and c1c \ge 1. Combining these, a2a \ge 2, b1b \ge 1, and c1c \ge 1.
Divisibility requires that the prime factorization of nn contains at least the prime powers present in the prime factorizations of 12 and 15.
2
Set up the total divisor count equation.
The total number of positive integer divisors of n=2a×3b×5cn = 2^a \times 3^b \times 5^c is given by (a+1)(b+1)(c+1)=24(a+1)(b+1)(c+1) = 24.
The divisor counting formula states that for a number with prime factorization p1e1p2e2p_1^{e_1} p_2^{e_2} \dots, the total number of positive divisors is (e1+1)(e2+1)(e_1+1)(e_2+1)\dots
3
Find all integer factor triples (a+1,b+1,c+1)(a+1, b+1, c+1) that multiply to 24 subject to a+13a+1 \ge 3, b+12b+1 \ge 2, and c+12c+1 \ge 2.
The valid factorizations of 24 into three factors meeting the bounds are:
- (6,2,2)    (a,b,c)=(5,1,1)(6, 2, 2) \implies (a, b, c) = (5, 1, 1), giving n=25×31×51=480n = 2^5 \times 3^1 \times 5^1 = 480
- (4,3,2)    (a,b,c)=(3,2,1)(4, 3, 2) \implies (a, b, c) = (3, 2, 1), giving n=23×32×51=360n = 2^3 \times 3^2 \times 5^1 = 360
- (3,4,2)    (a,b,c)=(2,3,1)(3, 4, 2) \implies (a, b, c) = (2, 3, 1), giving n=22×33×51=540n = 2^2 \times 3^3 \times 5^1 = 540
- (4,2,3)    (a,b,c)=(3,1,2)(4, 2, 3) \implies (a, b, c) = (3, 1, 2), giving n=23×31×52=600n = 2^3 \times 3^1 \times 5^2 = 600
To minimize n=2a×3b×5cn = 2^a \times 3^b \times 5^c, we must evaluate all valid permutations of exponents consistent with the divisor product constraint.
4
Compare the resulting values of nn to find the minimum.
Comparing 480, 360, 540, and 600, the smallest value is 360.
Assigning the larger exponent 3 to the smallest prime base 2 and exponent 2 to prime base 3 minimizes the overall product.

Key Concept

Divisor Counting Formula and Prime Factorization Constraints
Estimated Time:2m 0s
Question 222Question

Set SS consists of nn consecutive integers listed in increasing order. The product of the least integer and the greatest integer in Set SS is equal to 00. If the sum of all the integers in Set SS is 2121, how many integers are in Set SS?

Show answer & explanation

Answer: 7

Answer

7
The given sum of the consecutive integers is positive (2121), which requires the set of consecutive integers to start at 00 rather than end at 00. Setting up the sum formula for consecutive integers from 00 to kk gives k(k+1)2=21\frac{k(k+1)}{2} = 21, solving to k=6k = 6. Including 00, the terms in the set are 0,1,2,3,4,5,60, 1, 2, 3, 4, 5, 6, which yields 60+1=76 - 0 + 1 = 7 integers in total.

Step-by-Step Solution

1
Analyze the condition for the product of the least and greatest integers.
Since the product of the least integer aa and greatest integer bb is 00, at least one of these extreme terms must be 00.
By the zero-product property, ab=0    a=0a \cdot b = 0 \implies a = 0 or b=0b = 0.
2
Determine which extreme integer is equal to 0.
The least integer aa must be 00.
If b=0b = 0, all integers in the set would be 0\leq 0, so their sum would be 0\leq 0. Since the given sum is 21>021 > 0, the set must consist of non-negative integers starting at 00.
3
Set up the sum equation for consecutive integers starting at 0.
k(k+1)2=21    k(k+1)=42    k=6\frac{k(k+1)}{2} = 21 \implies k(k+1) = 42 \implies k = 6.
The sum of integers from 00 to kk is 0+k(k+1)2=210 + \frac{k(k+1)}{2} = 21.
4
Count the total number of terms in the set.
n=60+1=7n = 6 - 0 + 1 = 7.
The number of integers in an inclusive range from aa to bb is given by ba+1b - a + 1.

Key Concept

Consecutive Integers, Zero Property, and Inclusive Term Counting
Estimated Time:1m 30s
Question 223Question

Let N=24×32×5N = 2^4 \times 3^2 \times 5. How many distinct prime factors does the integer N+9N + 9 have?

Show answer & explanation

Answer: 1

Answer

The integer N+9N + 9 has 1 distinct prime factor.
Evaluating N=24×32×5N = 2^4 \times 3^2 \times 5 gives 720720. Adding 9 yields 729729, which prime factorizes as 363^6. Because 3 is the only unique prime base in this expression, N+9N + 9 has exactly 1 distinct prime factor.

Step-by-Step Solution

1
Calculate the numerical value of NN from its prime factorization.
N=24×32×5=16×9×5=720N = 2^4 \times 3^2 \times 5 = 16 \times 9 \times 5 = 720
Evaluating NN is necessary to compute N+9N + 9.
2
Add 9 to NN to find the value of N+9N + 9.
N+9=720+9=729N + 9 = 720 + 9 = 729
The question asks for the distinct prime factors of the sum N+9N + 9.
3
Find the prime factorization of 729.
729=36729 = 3^6
Prime factorization reveals the prime bases of the integer.
4
Count the number of distinct prime factors of 729.
The only distinct prime factor is 3, so the count is 1.
Distinct prime factors are the unique prime numbers appearing in the prime factorization.

Key Concept

Prime Factorization of an Expression Sum
Estimated Time:1m 30s
Question 224Question

Set SS consists of consecutive integers. The sum of all positive integers in set SS is 300300, and the median of set SS is 4.5-4.5. How many negative integers are in set SS?

Show answer & explanation

Answer: 33

Answer

The set S contains 33 negative integers.
To find the number of negative integers in set S, first determine the maximum positive integer N in the set using the sum formula for consecutive positive integers: \frac{N(N+1)}{2} = 300, which yields N = 24. Next, use the property that for an evenly spaced set, the median is the average of the smallest and largest numbers: -4.5 = \frac{\text{Smallest} + 24}{2}. Solving for the smallest integer gives -33. Finally, count the negative integers in set S, which run from -33 to -1 inclusive: -1 - (-33) + 1 = 33.

Step-by-Step Solution

1
Find the largest integer in Set S
The largest integer is 24.
The positive integers in set S must form a sequence from 1 to N. The sum of positive integers is given by \frac{N(N + 1)}{2} = 300, which simplifies to N(N + 1) = 600. Since 24 \times 25 = 600, N = 24.
2
Find the smallest integer in Set S using the median formula
The smallest integer is -33.
In any set of consecutive integers, the median is equal to the arithmetic mean of the smallest and largest terms: \text{Median} = \frac{\text{Smallest} + \text{Largest}}{2}. Substituting -4.5 for the median and 24 for the largest term gives -4.5 = \frac{\text{Smallest} + 24}{2} \implies \text{Smallest} + 24 = -9 \implies \text{Smallest} = -33.
3
Count the number of negative integers in Set S
There are 33 negative integers.
The negative integers in set S range from -33 to -1, inclusive. The count is calculated as -1 - (-33) + 1 = 33.

Key Concept

Properties of consecutive integer sets, median-mean equivalence, and inclusive range counting
Estimated Time:1m 30s
Question 225Question

Set SS consists of consecutive integers from aa to bb, inclusive, such that a<0<ba < 0 < b. The number of negative integers in set SS is equal to three times the number of positive integers in set SS. If the sum of all elements in set SS is 68-68, how many integers are in set SS?

Show answer & explanation

Answer: 17

Answer

17
Set SS consists of 1212 negative integers (12-12 through 1-1), 44 positive integers (11 through 44), and the integer 00. The sum of positive integers is 1010 and the sum of negative integers is 78-78, giving a total sum of 68-68. The total number of integers in the set is 12+4+1=1712 + 4 + 1 = 17.

Step-by-Step Solution

1
Define the number of terms and bounds of set SS in terms of positive integers bb.
The positive integers are 1,2,,b1, 2, \dots, b, so there are bb positive integers. The negative integers are 1,2,,a-1, -2, \dots, a. Since the number of negative integers is 33 times the number of positive integers, there are 3b3b negative integers, which means a=3ba = -3b. Set SS also includes 00.
Expressing all elements in terms of bb allows setting up a single variable equation.
2
Calculate the sum of all elements in set SS as a function of bb.
The sum of the positive integers is b(b+1)2\frac{b(b+1)}{2}. The sum of the negative integers is 3b(3b+1)2-\frac{3b(3b+1)}{2}. The total sum is b(b+1)23b(3b+1)2=b2+b9b23b2=8b22b2=4b2b\frac{b(b+1)}{2} - \frac{3b(3b+1)}{2} = \frac{b^2 + b - 9b^2 - 3b}{2} = \frac{-8b^2 - 2b}{2} = -4b^2 - b.
The sum of consecutive integers from 11 to nn is n(n+1)2\frac{n(n+1)}{2}.
3
Solve for bb using the given sum of 68-68.
4b2b=68    4b2+b68=0-4b^2 - b = -68 \implies 4b^2 + b - 68 = 0. Factoring gives (4b+17)(b4)=0(4b + 17)(b - 4) = 0. Since bb must be a positive integer, b=4b = 4. Therefore, a=3(4)=12a = -3(4) = -12.
Solving the quadratic equation identifies the exact boundaries of the set.
4
Calculate the total number of integers in set SS.
The set contains integers from 12-12 to 44, inclusive. The total count of integers is 4(12)+1=174 - (-12) + 1 = 17.
The number of integers in an inclusive range [a,b][a, b] is given by ba+1b - a + 1.

Key Concept

Consecutive Integers and Number Sets
Question 226Question

If xx and yy are integers such that 8x4-8 \le x \le 4 and 2y5-2 \le y \le 5, xy2>0x y^2 > 0, and x3y<0x^3 y < 0, how many distinct integer values are possible for the product xyx y?

Show answer & explanation

Answer: 6

Answer

The total number of distinct integer values for the product xyx y is 6.
Analyzing the given inequalities reveals sign constraints on both variables: xy2>0x y^2 > 0 forces x>0x > 0 (since y2>0y^2 > 0 for non-zero yy), limiting xx to integer values 1,2,3,41, 2, 3, 4. Then x3y<0x^3 y < 0 forces y<0y < 0 (since x3>0x^3 > 0), limiting yy to integer values 2,1-2, -1. Multiplying each value of xx by each value of yy gives the products 1,2,3,4,6,8-1, -2, -3, -4, -6, -8, which constitutes exactly 6 distinct values.

Step-by-Step Solution

1
Determine the sign and allowable integer values of xx
x{1,2,3,4}x \in \{1, 2, 3, 4\}
Since y2y^2 is strictly positive for any non-zero real number yy, xy2>0x y^2 > 0 implies x>0x > 0 and y0y \neq 0.
2
Determine the sign and allowable integer values of yy
y{2,1}y \in \{-2, -1\}
Because x>0x > 0, x3x^3 is also positive. For x3y<0x^3 y < 0, yy must be negative.
3
Calculate products for all valid pairs of (x,y)(x, y) and remove duplicates
The distinct product values are 1,2,3,4,6,8-1, -2, -3, -4, -6, -8, giving 6 values in total.
Evaluating xyx y for x{1,2,3,4}x \in \{1, 2, 3, 4\} and y{2,1}y \in \{-2, -1\} yields 1,2,3,4-1, -2, -3, -4 when y=1y = -1 and 2,4,6,8-2, -4, -6, -8 when y=2y = -2.

Key Concept

Even powers of non-zero numbers are always positive, while odd powers preserve the sign of the base number.
Question 227Question

If K=2a×3b×5cK = 2^a \times 3^b \times 5^c, where aa, bb, and cc are positive integers, such that 15K15K has 15 more positive factors than KK, and 6K6K has 12 more positive factors than KK, what is the total number of positive factors of KK?

Show answer & explanation

Answer: 12

Answer

The total number of positive factors of KK is 12.
By setting up factor count equations from prime exponents, we find a=2,b=1,c=1a=2, b=1, c=1. Applying the formula (a+1)(b+1)(c+1)(a+1)(b+1)(c+1) yields (3)(2)(2)=12(3)(2)(2) = 12.

Step-by-Step Solution

1
Set up the formula for the number of positive factors of KK, 15K15K, and 6K6K.
For K=2a3b5cK = 2^a \cdot 3^b \cdot 5^c, the number of factors is d(K)=(a+1)(b+1)(c+1)d(K) = (a+1)(b+1)(c+1). For 15K=2a3b+15c+115K = 2^a \cdot 3^{b+1} \cdot 5^{c+1}, d(15K)=(a+1)(b+2)(c+2)d(15K) = (a+1)(b+2)(c+2). For 6K=2a+13b+15c6K = 2^{a+1} \cdot 3^{b+1} \cdot 5^c, d(6K)=(a+2)(b+2)(c+1)d(6K) = (a+2)(b+2)(c+1).
Prime factorizations determine the number of positive factors via the product of (exponent + 1).
2
Express the given factor differences algebraically.
d(15K)d(K)=(a+1)[(b+2)(c+2)(b+1)(c+1)]=(a+1)(b+c+3)=15d(15K) - d(K) = (a+1)[(b+2)(c+2) - (b+1)(c+1)] = (a+1)(b+c+3) = 15. Also, d(6K)d(K)=(c+1)[(a+2)(b+2)(a+1)(b+1)]=(c+1)(a+b+3)=12d(6K) - d(K) = (c+1)[(a+2)(b+2) - (a+1)(b+1)] = (c+1)(a+b+3) = 12.
Factor out common terms to simplify the system of equations.
3
Solve for the positive integers aa, bb, and cc.
Since b1b \ge 1 and c1c \ge 1, b+c+35b+c+3 \ge 5. The only factor of 15 greater than or equal to 5 is 5 (since b+c+3=15b+c+3=15 would require a=0a=0). Thus b+c+3=5    b=1,c=1b+c+3=5 \implies b=1, c=1 and a+1=3    a=2a+1=3 \implies a=2. Checking in the second equation: (1+1)(2+1+3)=26=12(1+1)(2+1+3) = 2 \cdot 6 = 12, which holds.
Integer constraints limit the potential factor pairs of 15.
4
Calculate d(K)d(K).
d(K)=(2+1)(1+1)(1+1)=322=12d(K) = (2+1)(1+1)(1+1) = 3 \cdot 2 \cdot 2 = 12.
Substitute a=2,b=1,c=1a=2, b=1, c=1 into the factor counting formula.

Key Concept

Prime Factorization and Number of Divisors
Estimated Time:2m 0s
Question 228Question

Let mm and nn be integers such that 4m6-4 \le m \le 6 and 8n3-8 \le n \le 3. If m2n<0m^2 n < 0 and m+n>0m + n > 0, what is the minimum possible value of the product mnm \cdot n?

Show answer & explanation

Answer: -30

Answer

The minimum possible value of mnm \cdot n is 30-30.
The correct answer is -30. Analyzing m2n<0m^2 n < 0 shows that nn must be negative and mm cannot be zero. The condition m+n>0m + n > 0 implies m>n=nm > -n = |n|, making mm positive. Since m6m \le 6, the maximum possible value for n|n| is 5, which corresponds to n=5n = -5. When n=5n = -5, mm must be strictly greater than 5, leaving m=6m = 6 as the only valid value. The product is 6×(5)=306 \times (-5) = -30, which is the minimum value achievable under all constraints.

Step-by-Step Solution

1
Determine the signs of mm and nn using the given inequalities.
n<0n < 0 and m>0m > 0 with m0m \ne 0.
Since m2m^2 is strictly positive for any non-zero integer mm, m2n<0m^2 n < 0 forces n<0n < 0. Then m+n>0m + n > 0 requires m>n>0m > -n > 0.
2
Find the range of valid integer values for nn.
n{5,4,3,2,1}n \in \{-5, -4, -3, -2, -1\}.
Since m6m \le 6 and m>nm > -n, we must have n5-n \le 5, which gives n5n \ge -5.
3
Evaluate the minimum product mnm \cdot n across all allowed values of nn.
The minimum product is 30-30, occurring when n=5n = -5 and m=6m = 6.
To minimize a negative product, maximize the absolute product mnm \cdot |n|. When n=5n = -5, mm must be 66, yielding 6(5)=306 \cdot (-5) = -30.

Key Concept

Positive and Negative Number Properties with Inequalities
Question 229Question

If xx and yy are non-zero real numbers such that xyx>2\frac{x - y}{x} > 2 and xy2<0x y^2 < 0, which of the following inequalities must be true?

Show answer & explanation

Answer: x+y>0x + y > 0

Answer

x+y>0x + y > 0
From xy2<0x y^2 < 0, since y0y \neq 0, y2y^2 is strictly positive, which forces x<0x < 0. Next, expanding xyx>2\frac{x - y}{x} > 2 by multiplying both sides by negative xx reverses the inequality direction to xy<2xx - y < 2x. Subtracting xx from both sides gives y<x-y < x, which is equivalent to x+y>0x + y > 0. Thus, x+y>0x + y > 0 must always be true.

Step-by-Step Solution

1
Determine the sign of xx using xy2<0x y^2 < 0.
Since y0y \neq 0, y2>0y^2 > 0. For the product xy2x y^2 to be negative, xx must be negative (x<0x < 0).
A positive quantity multiplied by a negative quantity yields a negative product.
2
Simplify the inequality xyx>2\frac{x - y}{x} > 2 taking the sign of xx into account.
Multiplying both sides by xx (and reversing the inequality because x<0x < 0) gives xy<2xx - y < 2x.
Multiplying or dividing an inequality by a negative value reverses the inequality sign.
3
Rearrange the terms of xy<2xx - y < 2x to isolate the relationship between xx and yy.
Subtracting xx from both sides yields y<x-y < x, which rearranges to x+y>0x + y > 0 (or y>xy > -x).
Adding yy to both sides converts y<x-y < x directly into x+y>0x + y > 0.

Key Concept

Deducing signs and algebraic bounds in inequalities involving negative variables
Estimated Time:1m 30s
Question 230Question

If aa, bb, and cc are non-zero real numbers such that ab2c3<0a b^2 c^3 < 0 and ab>0\frac{a}{b} > 0, which of the following expressions MUST be negative?

Show answer & explanation

Answer: a2bca^2 b c

Answer

The expression a2bca^2 b c must be negative.
For any non-zero real number aa, the term a2a^2 is strictly positive. The given conditions show that b2>0b^2 > 0, which simplifies ab2c3<0a b^2 c^3 < 0 to ac<0a c < 0, proving aa and cc have opposite signs. Furthermore, ab>0\frac{a}{b} > 0 means aa and bb have the same sign. Combining these facts shows that bb and cc must always have opposite signs, so bc<0b c < 0. Therefore, a2bc=(a2)(bc)=(+)×()<0a^2 b c = (a^2)(b c) = (+) \times (-) < 0 in all valid cases.

Step-by-Step Solution

1
Analyze the sign implication of ab2c3<0a b^2 c^3 < 0.
ac<0a c < 0, meaning aa and cc have opposite signs.
Because b0b \neq 0, b2b^2 is strictly positive (b2>0b^2 > 0). Dividing ab2c3<0a b^2 c^3 < 0 by b2b^2 yields ac3<0a c^3 < 0. Since c3c^3 has the exact same sign as cc, it follows that ac<0a c < 0.
2
Analyze the sign implication of ab>0\frac{a}{b} > 0.
aa and bb must have the same sign (ab>0a b > 0).
A quotient of two non-zero numbers is positive if and only if both numbers have the same sign.
3
Combine sign conditions to evaluate the possible cases for a,b,ca, b, c.
Either Case 1: a>0,b>0,c<0a > 0, b > 0, c < 0, or Case 2: a<0,b<0,c>0a < 0, b < 0, c > 0.
If a>0a > 0, then b>0b > 0 (from step 2) and c<0c < 0 (from step 1). If a<0a < 0, then b<0b < 0 (from step 2) and c>0c > 0 (from step 1).
4
Test the expression a2bca^2 b c under both cases.
In Case 1: (+)2(+)()=()(+)^2 \cdot (+) \cdot (-) = (-). In Case 2: ()2()(+)=()(-)^2 \cdot (-) \cdot (+) = (-). Thus a2bc<0a^2 b c < 0 always.
Since a2>0a^2 > 0 for all non-zero real numbers aa, and bb and cc have opposite signs in every valid scenario (bc<0b c < 0), the product a2(bc)a^2 (b c) is always strictly negative.

Key Concept

Deducing signs of variables using exponent rules and inequalities
Estimated Time:1m 30s
Question 231Question

Let aa, bb, and cc be integers such that 5a3-5 \le a \le 3, 4b6-4 \le b \le 6, and 3c4-3 \le c \le 4. If ab<0a b < 0 and bc2>0b c^2 > 0, what is the maximum possible value of the expression acb\frac{a - c}{b}?

Show answer & explanation

Answer: 2

Answer

The maximum possible value of the expression is 2.
From bc2>0b c^2 > 0, since c2>0c^2 > 0 for any non-zero real number cc, it follows that b>0b > 0 and c0c \neq 0. Given ab<0a b < 0 and b>0b > 0, aa must be strictly negative (a<0a < 0). To maximize acb\frac{a - c}{b} where b>0b > 0, we maximize the numerator (ac)(a - c) and minimize the denominator bb. The maximum negative integer for aa is 1-1, and the minimum integer for cc is 3-3, giving a maximum numerator of 1(3)=2-1 - (-3) = 2. The minimum positive integer for bb is 11. Hence, the maximum value is 21=2\frac{2}{1} = 2.

Step-by-Step Solution

1
Analyze the sign of bc2>0b c^2 > 0
b>0b > 0 and c0c \neq 0
The square of any non-zero real number is strictly positive (c2>0c^2 > 0), so bb must be positive for the product bc2b c^2 to be positive.
2
Analyze the sign of ab<0a b < 0
a<0a < 0
Since b>0b > 0, aa must be negative for their product to be less than zero.
3
Determine candidate integer sets
a{5,4,3,2,1}a \in \{-5, -4, -3, -2, -1\}, b{1,2,3,4,5,6}b \in \{1, 2, 3, 4, 5, 6\}, c{3,2,1,1,2,3,4}c \in \{-3, -2, -1, 1, 2, 3, 4\}
Filter the given intervals by the sign restrictions (a<0a < 0, b>0b > 0, c0c \neq 0).
4
Optimize numerator (ac)(a - c) and denominator bb
a=1a = -1, c=3c = -3, b=1b = 1
To maximize a quotient with a positive denominator, make the numerator as large as possible (ac=1(3)=2a - c = -1 - (-3) = 2) and the denominator as small as possible (b=1b = 1).
5
Evaluate the maximum value
2
1(3)1=21=2\frac{-1 - (-3)}{1} = \frac{2}{1} = 2.

Key Concept

Deducing sign constraints from products and powers of variables and optimizing algebraic quotients under sign and domain restrictions.
Estimated Time:1m 30s
Question 232Question

If mm and nn are real numbers such that m<0<nm < 0 < n and m23mn4n2=0m^2 - 3mn - 4n^2 = 0, what is the value of m+2nmn\frac{m + 2n}{m - n}?

Show answer & explanation

Answer: -0.5

Answer

The value of the expression is -0.5.
Factoring m23mn4n2=0m^2 - 3mn - 4n^2 = 0 yields (m4n)(m+n)=0(m - 4n)(m + n) = 0, giving solutions m=4nm = 4n or m=nm = -n. Given m<0<nm < 0 < n, mm is negative and nn is positive, so mm and nn must have opposite signs. The solution m=4nm = 4n implies that mm and nn have the same sign (both positive), which violates m<0m < 0. Therefore, mm must equal n-n. Substituting m=nm = -n into m+2nmn\frac{m + 2n}{m - n} results in n+2nnn=n2n=0.5\frac{-n + 2n}{-n - n} = \frac{n}{-2n} = -0.5.

Step-by-Step Solution

1
Factor the quadratic equation m23mn4n2=0m^2 - 3mn - 4n^2 = 0.
(m4n)(m+n)=0(m - 4n)(m + n) = 0
Factoring allows determination of the possible linear relationships between mm and nn.
2
Apply the sign condition m<0<nm < 0 < n to eliminate the invalid case.
m=nm = -n
Since n>0n > 0, 4n4n must be positive. Setting m=4nm = 4n would make m>0m > 0, contradicting m<0m < 0. Thus, m+n=0m + n = 0, giving m=nm = -n.
3
Substitute m=nm = -n into m+2nmn\frac{m + 2n}{m - n}.
\frac{-n + 2n}{-n - n} = \frac{n}{-2n} = -0.5
Replacing mm with n-n simplifies the ratio to a constant value.

Key Concept

Positive and Negative Number Properties in Quadratic Constraints
PreviousPage 12 / 12
Number Properties and Arithmetic Practice Questions — GMAT — Page 12 | Examkin