Number Properties and Arithmetic Practice Questions — GMAT — Page 3

Question 41Question →

For a positive integer $N = 2^a \times 3^b \times 5^c$ , where $a$ , $b$ , and $c$ are positive integers, the integer $\frac{N}{2}$ has $40$ positive factors, the integer $\frac{N}{3}$ has $36$ positive factors, and the integer $\frac{N}{5}$ has $24$ positive factors. What is the total number of positive factors of $N^2$ ?

96

210

231

462

576

Show answer & explanation

Answer: 231

Answer

231 positive factors

The correct answer is 231. By representing the factor counts of

\frac{N}{2}

,

\frac{N}{3}

, and

\frac{N}{5}

algebraically, we establish a system of equations for the exponents

a, b, c

. Solving this system yields

a=5

,

b=3

, and

c=1

. Squaring

N

doubles each exponent, giving

N^2 = 2^{10} \times 3^6 \times 5^2

. Applying the factor count formula gives

(10+1)(6+1)(2+1) = 231

.

Step-by-Step Solution

1

Set up equations for the number of positive factors of N/2, N/3, and N/5 using the prime factorization formula.

The total number of factors of an integer

2^x 3^y 5^z

is

(x+1)(y+1)(z+1)

. Thus:

a(b+1)(c+1) = 40

,

(a+1)b(c+1) = 36

, and

(a+1)(b+1)c = 24

.

Dividing

N

by a prime factor reduces that prime factor's exponent by 1.

2

Express each equation in terms of

T = (a+1)(b+1)(c+1)

, the total number of factors of

N

.

(b+1)(c+1) = T - 40

,

(a+1)(c+1) = T - 36

, and

(a+1)(b+1) = T - 24

.

Expanding

(x-1)yz = xyz - yz = T - yz

allows expressing pairwise products in terms of

T

.

3

Multiply the three pairwise product equations to solve for

T

.

[(a+1)(b+1)(c+1)]^2 = (T-40)(T-36)(T-24) \implies T^2 = (T-40)(T-36)(T-24)

. Testing

T = 48

:

48^2 = 2304

and

(8)(12)(24) = 2304

. Thus

T = 48

.

Multiplying

(b+1)(c+1) \times (a+1)(c+1) \times (a+1)(b+1)

yields

T^2

.

4

Determine the individual exponents

a

,

b

, and

c

.

a+1 = \sqrt{\frac{(T-36)(T-24)}{T-40}} = \sqrt{\frac{12 \times 24}{8}} = 6 \implies a = 5

. Similarly,

b+1 = 4 \implies b = 3

, and

c+1 = 2 \implies c = 1

.

Dividing the product of two pairwise terms by the third gives the square of a single term.

5

Calculate the total number of positive factors of

N^2

.

N^2 = 2^{2a} \times 3^{2b} \times 5^{2c} = 2^{10} \times 3^6 \times 5^2

. Number of factors

= (10+1)(6+1)(2+1) = 11 \times 7 \times 3 = 231

.

Squaring

N

doubles each prime factor's exponent.

Key Concept

Divisibility, Prime Factorization, and Total Positive Factor Counting Formula

Question 42Question →

If $x$ , $y$ , and $z$ are integers such that $x^2 + y^2 + z^2$ is an odd integer, then the sum $x + y + z$ must be an odd integer.

True

False

Show answer & explanation

Answer: True

Answer

The statement is True because the square of any integer preserves the parity of that integer, making the parity of

x^2 + y^2 + z^2

identical to the parity of

x + y + z

.

The statement is true because for all integers

k

, the parity of

k^2

is identical to the parity of

k

. Consequently, the parity of the sum of squares

x^2 + y^2 + z^2

is always identical to the parity of the sum

x + y + z

. If the sum of squares is odd, the sum of the variables must also be odd.

Step-by-Step Solution

1

Analyze the parity relationship between any integer

k

and its square

k^2

.

If

k

is even,

k^2

is even; if

k

is odd,

k^2

is odd. (Note that zero is an even integer, and

0^2 = 0

is even).

Multiplying an even integer by itself yields an even number, and multiplying an odd integer by itself yields an odd number.

2

Relate the parity of

x^2 + y^2 + z^2

to

x + y + z

.

The expression

x^2 + y^2 + z^2

has the exact same parity as

x + y + z

.

Replacing each squared term with its base term does not change whether the sum is even or odd.

3

Apply the given condition to deduce the final parity.

Since

x^2 + y^2 + z^2

is odd,

x + y + z

must be odd.

Two expressions with identical parity must both be odd if one is given as odd.

Key Concept

Parity Invariance of Integer Powers

Estimated Time:1m 0s

Question 43Question →

What is the sum of all the distinct prime factors of $30$ ?

10

11

8

15

72

Show answer & explanation

Answer: 10

Answer

10

The prime factorization of 30 is 2 × 3 × 5. The distinct prime factors are 2, 3, and 5, and their sum is 2 + 3 + 5 = 10.

Step-by-Step Solution

1

Find the prime factorization of 30

30 = 2 \times 3 \times 5

Decomposing 30 into prime factors identifies all prime numbers that divide 30.

2

Identify the distinct prime factors

The distinct prime factors are 2, 3, and 5.

Prime factors are the prime numbers present in the prime factorization.

3

Calculate the sum of these distinct prime factors

2 + 3 + 5 = 10

The question asks for the sum of all distinct prime factors.

Key Concept

Prime Factorization and Prime Factors

Estimated Time:45s

Question 44Question →

For how many integers $x$ in the range $-50 \le x \le 50$ is the value of the expression $x^5 - 5x^3 + 4x + 3$ an even integer?

Show answer & explanation

Answer: 0

Answer

There are 0 integers in the specified range for which the expression evaluates to an even integer.

Factoring

x^5 - 5x^3 + 4x

yields

(x - 2)(x - 1)x(x + 1)(x + 2)

, which is the product of 5 consecutive integers. The product of consecutive integers is always even for any integer

x

. Adding 3 (an odd integer) to an even integer results in an odd integer for all values of

x

. Consequently, zero integers in the given range result in an even value.

Step-by-Step Solution

1

Factor the variable portion of the polynomial

x^5 - 5x^3 + 4x + 3

.

The expression rewrites as

(x - 2)(x - 1)x(x + 1)(x + 2) + 3

.

Factoring helps identify structural properties such as consecutive terms.

2

Analyze the parity of the product of 5 consecutive integers

(x - 2)(x - 1)x(x + 1)(x + 2)

.

The product is always an even integer for all integer values of

x

.

Any sequence of 5 consecutive integers includes multiple even numbers. Even when

x = 0

, the product equals 0, which is an even integer.

3

Determine the parity of the full expression by adding the constant term 3.

Even integer + 3 (odd integer) = odd integer.

The sum of an even integer and an odd integer is always an odd integer.

4

Count the number of integer values of

x

in

-50 \le x \le 50

that yield an even integer.

0 integers.

Since the expression evaluates to an odd integer for every integer

x

, no integer value can produce an even integer.

Key Concept

Parity of consecutive integer products and addition rules for even and odd integers.

Estimated Time:2m 0s

Question 45Question →

What is the greatest common divisor (GCD) of $2^3 \times 3^2 \times 5$ and $2^2 \times 3^3$ ?

36

72

180

1080

18

Show answer & explanation

Answer: $36$

Answer

The greatest common divisor (GCD) of

2^3 \times 3^2 \times 5

and

2^2 \times 3^3

is

36

.

The greatest common divisor (GCD) is calculated by taking the lowest power of each prime factor common to both expressions. For

2^3 \times 3^2 \times 5

and

2^2 \times 3^3

, the common prime factors are

2

and

3

. Taking the smallest exponents gives

2^2 \times 3^2 = 4 \times 9 = 36

.

Step-by-Step Solution

1

Identify the common prime factors in both numbers.

The prime factors present in both numbers are

2

and

3

. The factor

5

is only present in the first number.

GCD requires prime factors that are shared by all target numbers.

2

Select the minimum exponent for each common prime factor.

For

2

:

\min(3, 2) = 2

. For

3

:

\min(2, 3) = 2

. For

5

:

\min(1, 0) = 0

.

The GCD contains only the prime powers that divide both numbers completely.

3

Multiply the resulting prime power factors to evaluate the GCD.

\text{GCD} = 2^2 \times 3^2 = 4 \times 9 = 36

.

Evaluating the prime factor powers gives the final integer value.

Key Concept

To find the Greatest Common Divisor (GCD) of numbers written in prime factorized form, take the product of each common prime factor raised to its smallest exponent across all the factorizations.

Estimated Time:1m 0s

Question 46Question →

What is the least common multiple (LCM) of $12$ and $18$ ?

Show answer & explanation

Answer: 36

Answer

The least common multiple of

12

and

18

is

36

.

To find the least common multiple of

12

and

18

, determine the prime factorization of each number (

12 = 2^2 \times 3^1

and

18 = 2^1 \times 3^2

). The LCM is calculated by taking the maximum power of each prime factor present:

2^2 \times 3^2 = 4 \times 9 = 36

.

Step-by-Step Solution

1

Express both numbers in terms of their prime factorizations.

12 = 2^2 \times 3^1

and

18 = 2^1 \times 3^2

Prime factorization separates each number into basic prime components.

2

Select the highest power of each prime factor that appears in either factorization.

The highest power of

2

is

2^2

, and the highest power of

3

is

3^2

.

The least common multiple must contain enough factors to be divisible by both original numbers.

3

Calculate the product of these highest prime powers.

\text{LCM}(12, 18) = 2^2 \times 3^2 = 4 \times 9 = 36

Multiplying the chosen powers yields the minimum integer divisible by both

12

and

18

.

Key Concept

Finding the Least Common Multiple (LCM) via Prime Factorization

Estimated Time:45s

Question 47Question →

For how many ordered pairs of positive integers $(a, b)$ , where $1 \le a \le 15$ and $1 \le b \le 15$ , is the value of the expression $(a^2 + a + 1)(b^3 + b + 7)$ an even integer?

Show answer & explanation

Answer: 0

Answer

The expression evaluates to an odd integer for all positive integer pairs

(a, b)

, so there are 0 ordered pairs for which the value is an even integer.

The factor

(a^2 + a + 1)

simplifies to

a(a + 1) + 1

. Because

a(a + 1)

is the product of two consecutive integers, it is always even, making

a(a + 1) + 1

odd for every integer

a

. The factor

(b^3 + b + 7)

is always odd because

b^3

and

b

have matching parities (their sum is always even), so adding 7 yields an odd number. Since the product of two odd integers is always odd, the expression is never even, yielding exactly 0 ordered pairs.

Step-by-Step Solution

1

Examine the parity of the factor

a^2 + a + 1

a^2 + a + 1

is odd for all integer values of

a

The expression

a^2 + a = a(a + 1)

represents the product of two consecutive integers, which is always even. Adding 1 to an even integer results in an odd integer.

2

Examine the parity of the factor

b^3 + b + 7

b^3 + b + 7

is odd for all integer values of

b

Since

b^3

and

b

always share the same parity, their sum

b^3 + b

is always even. Adding 7 to an even integer results in an odd integer.

3

Determine the overall parity of the product

The product

(a^2 + a + 1)(b^3 + b + 7)

is odd for all inputs

The product of two odd integers is strictly an odd integer.

4

Count the number of pairs satisfying the even condition

0 pairs

Because the product is never even, zero pairs satisfy the requirement.

Key Concept

Parity rules of consecutive integer products and polynomial expressions

Estimated Time:1m 30s

Question 48Question →

If $x$ , $y$ , and $z$ are integers such that $x + y + z = 0$ and $x^3 y - z$ is an odd integer, which of the following expressions MUST be an even integer?

x y z

x + y

y + z

x - y

x + z

Show answer & explanation

Answer: $x y z$

Answer

The expression representing the product of the three integers,

x y z

, must always be an even integer.

The correct answer is the product of the three variables because logical parity analysis reveals that it is impossible for all three integers to be even, but in all valid cases at least one of the three variables must be an even integer (or zero). A product containing at least one even factor is always even.

Step-by-Step Solution

1

Express

z

in terms of

x

and

y

using the given sum equality.

z = -(x + y)

.

Since

x + y + z = 0

, substituting

z = -(x + y)

allows evaluation of the given parity condition in terms of

x

and

y

only.

2

Substitute

z = -(x + y)

into the given expression

x^3 y - z

and analyze its parity.

x^3 y - z = x^3 y + x + y

. Since

x^3

and

x

have the same parity for any integer

x

,

x^3 y + x + y

has the same parity as

x y + x + y

.

The parity of an integer raised to a positive integer power is identical to the parity of the base integer.

3

Evaluate the four possible parity combinations for

(x, y)

.

If both

x

and

y

are even, then

x y + x + y = \text{even} + \text{even} + \text{even} = \text{even}

, which contradicts the condition that

x^3 y - z

is odd. Thus,

x

and

y

cannot both be even.

Eliminating the case where both

x

and

y

are even implies that at least one of

x

or

y

must be odd.

4

Determine the parity of

x y z

in all remaining valid cases.

In Case 1 (

x

odd,

y

odd),

z = -(x + y) = -(\text{odd} + \text{odd}) = \text{even}

, so

z

is even and

x y z

is even. In Case 2 (

x

even,

y

odd),

x

is even so

x y z

is even. In Case 3 (

x

odd,

y

even),

y

is even so

x y z

is even. Therefore,

x y z

is even in every valid case.

The product of integers is even whenever at least one factor in the product is an even integer (including zero).

Key Concept

Parity rules of addition, multiplication, exponentiation, and the property that zero is an even integer.

Estimated Time:2m 0s

Question 49Question →

For two positive integers $a$ and $b$ , the greatest common divisor is $15$ and the least common multiple is $180$ . If $a = 45$ , what is the value of $b$ ?

12

15

60

135

180

Show answer & explanation

Answer: 60

Answer

60

For any two positive integers

a

and

b

, the product of their greatest common divisor and their least common multiple equals the product of the two numbers, expressed as

\text{GCD}(a, b) \times \text{LCM}(a, b) = a \times b

. Plugging in the given values yields

15 \times 180 = 45 \times b

. Dividing

2700

by

45

results in

60

.

Step-by-Step Solution

1

Recall the fundamental relation between GCD and LCM for two positive integers.

\text{GCD}(a, b) \times \text{LCM}(a, b) = a \times b

The product of the greatest common divisor and the least common multiple of two positive integers is equal to the product of the integers themselves.

2

Substitute the given values into the formula.

15 \times 180 = 45 \times b

We are given

\text{GCD}(a,b) = 15

,

\text{LCM}(a,b) = 180

, and

a = 45

.

3

Solve for

b

.

b = \frac{15 \times 180}{45} = \frac{180}{3} = 60

Dividing both sides by

45

simplifies to

180 \div 3 = 60

.

Key Concept

Relationship between GCD, LCM, and the product of two positive integers.

Estimated Time:1m 30s

Question 50Question →

If $m$ is a positive integer such that $m!$ is divisible by $3^{10}$ but not by $3^{11}$ , and $(m+5)!$ is divisible by $3^{13}$ but not by $3^{14}$ , what is the total number of distinct positive factors of $m$ ?

6

8

10

12

14

Show answer & explanation

Answer: 8

Answer

The total number of distinct positive factors of

m

is 8.

Using Legendre's formula, the highest power of 3 dividing

m!

is 10 when

m

is 24, 25, or 26. Evaluating

(m+5)!

,

29!

(from

m=24

) has

E_3(29!) = 9 + 3 + 1 = 13

, whereas

30!

(from

m=25

) has

E_3(30!) = 10 + 3 + 1 = 14

. Therefore,

m

must equal 24. Since

24 = 2^3 \times 3^1

, its number of distinct positive factors is

(3+1)(1+1) = 8

.

Step-by-Step Solution

1

Apply Legendre's formula to find the highest power of 3 dividing

m!

.

The exponent of 3 in

m!

is given by

E_3(m!) = \lfloor \frac{m}{3} \rfloor + \lfloor \frac{m}{9} \rfloor + \lfloor \frac{m}{27} \rfloor + \dots = 10

.

Legendre's formula determines the exact power of a prime

p

in

n!

.

2

Test integer values for

m

to satisfy

E_3(m!) = 10

.

For

m=24

:

E_3(24!) = \lfloor \frac{24}{3} \rfloor + \lfloor \frac{24}{9} \rfloor = 8 + 2 = 10

. Thus,

m \in \{24, 25, 26\}

.

Integers 24, 25, and 26 each contain 10 factors of 3 in their factorial products.

3

Apply the second condition

E_3((m+5)!) = 13

to identify the unique value of

m

.

If

m=24

,

m+5=29 \implies E_3(29!) = \lfloor \frac{29}{3} \rfloor + \lfloor \frac{29}{9} \rfloor + \lfloor \frac{29}{27} \rfloor = 9 + 3 + 1 = 13

. For

m=25

or

m=26

,

m+5 \ge 30

, giving

E_3(30!) = 10+3+1 = 14

. Hence,

m = 24

.

Only

m=24

satisfies both power constraints simultaneously.

4

Calculate the number of positive factors of

m = 24

.

24 = 2^3 \times 3^1

. Total positive factors

= (3+1)(1+1) = 4 \times 2 = 8

.

The number of factors is found by adding 1 to each prime exponent and multiplying.

Key Concept

Legendre's Formula and Prime Factorization Divisor Counting

Estimated Time:2m 0s

Question 51Question →

For two positive integers $m$ and $n$ , their prime factorizations are given by $m = 2^3 \times 3^a \times 5^b$ and $n = 2^c \times 3^3 \times 5^1$ , where $a$ , $b$ , and $c$ are positive integer exponents. If the greatest common divisor of $m$ and $n$ is $\text{GCD}(m, n) = 360$ and their least common multiple is $\text{LCM}(m, n) = 108,000$ , what is the value of $a + b + c$ ?

7

8

9

10

11

Show answer & explanation

Answer: $10$

Answer

The correct value of

a + b + c

is

10

.

First, find the prime factorizations of

360

and

108,000

:
-

360 = 2^3 \times 3^2 \times 5^1

-

108,000 = 2^5 \times 3^3 \times 5^3

Using the properties of GCD and LCM:
- For base

2

:

\text{GCD}

power is

3

and

\text{LCM}

power is

5

. Since

m

has

2^3

,

n

must have

2^c

where

c = 5

.
- For base

3

:

\text{GCD}

power is

2

and

\text{LCM}

power is

3

. Since

n

has

3^3

,

m

must have

3^a

where

a = 2

.
- For base

5

:

\text{GCD}

power is

1

and

\text{LCM}

power is

3

. Since

n

has

5^1

,

m

must have

5^b

where

b = 3

.

Summing these values gives

a + b + c = 2 + 3 + 5 = 10

.

Step-by-Step Solution

1

Express GCD and LCM in prime factorized form.

\text{GCD}(m, n) = 360 = 2^3 \times 3^2 \times 5^1

and

\text{LCM}(m, n) = 108,000 = 2^5 \times 3^3 \times 5^3

.

Converting given numbers into prime powers allows direct comparison with the exponents of

m

and

n

.

2

Apply prime exponent min/max rules to determine

a

,

b

, and

c

.

For prime

2

:

\max(3, c) = 5 \implies c = 5

. For prime

3

:

\min(a, 3) = 2 \implies a = 2

. For prime

5

:

\max(b, 1) = 3 \implies b = 3

.

\text{GCD}

uses the minimum exponent for each prime factor, while

\text{LCM}

uses the maximum exponent.

3

Sum the derived exponents

a

,

b

, and

c

.

a + b + c = 2 + 3 + 5 = 10

.

The question asks for the sum

a + b + c

.

Key Concept

Prime Factor Exponent Rule for GCD and LCM

Alternative Method

Use the product formula

\text{GCD}(m, n) \times \text{LCM}(m, n) = m \times n

. Multiplying gives

360 \times 108,000 = 38,880,000 = 2^8 \times 3^5 \times 5^4

. Multiplying

m \times n = (2^3 \times 3^a \times 5^b) \times (2^c \times 3^3 \times 5^1) = 2^{3+c} \times 3^{a+3} \times 5^{b+1}

. Equating powers:

3+c=8 \implies c=5

,

a+3=5 \implies a=2

,

b+1=4 \implies b=3

. Thus

a+b+c = 2+3+5 = 10

.

Estimated Time:2m 0s

Question 52Question →

If $k$ is a positive integer that is divisible by both $6$ and $10$ , which of the following expressions MUST yield an integer?

\dfrac{k}{12}

\dfrac{k}{20}

\dfrac{k}{15}

\dfrac{k}{45}

\dfrac{k}{60}

Show answer & explanation

Answer: $\dfrac{k}{15}$

Answer

The expression

\dfrac{k}{15}

MUST yield an integer.

Since

k

is divisible by both

6

and

10

,

k

must be a multiple of

\text{LCM}(6, 10) = 30

. Therefore,

k = 30m

for some positive integer

m

. Dividing

k

by

15

gives

\dfrac{30m}{15} = 2m

, which is guaranteed to be an integer for any positive integer

m

.

Step-by-Step Solution

1

Determine the least common multiple (LCM) of

6

and

10

.

\text{LCM}(6, 10) = 30

.

Since

k

is divisible by both

6

and

10

,

k

must be a multiple of their LCM.

2

Express

k

in terms of its smallest possible base multiple.

k = 30m

for some positive integer

m

.

This represents all possible integer values for

k

.

3

Determine which choice has a denominator that divides

30

.

Since

15

divides

30

,

\dfrac{k}{15} = \dfrac{30m}{15} = 2m

, which is always an integer.

Any divisor of

30

will divide

k

for all valid values of

k

.

Key Concept

Least Common Multiple (LCM) and Divisibility Properties

Estimated Time:1m 0s

Question 53Question →

What is the number of distinct prime factors of the greatest common divisor (GCD) of $60$ and $90$ ?

2

3

4

5

30

Show answer & explanation

Answer: 3

Answer

3

The prime factorization of 60 is

2^2 \times 3 \times 5

and the prime factorization of 90 is

2 \times 3^2 \times 5

. The GCD is obtained by taking the lowest exponent for each common prime base:

\text{GCD}(60, 90) = 2^1 \times 3^1 \times 5^1 = 30

. The distinct prime factors of 30 are 2, 3, and 5, yielding a count of 3.

Step-by-Step Solution

1

Find the prime factorizations of 60 and 90.

60 = 2^2 \times 3^1 \times 5^1

and

90 = 2^1 \times 3^2 \times 5^1

Expressing numbers as products of prime factors is the standard method for finding their GCD.

2

Determine the GCD by taking the lowest power of each common prime factor.

\text{GCD}(60, 90) = 2^{\min(2,1)} \times 3^{\min(1,2)} \times 5^{\min(1,1)} = 2^1 \times 3^1 \times 5^1 = 30

The GCD takes the common prime bases raised to their minimum respective exponents.

3

Identify and count the distinct prime factors of 30.

The distinct prime factors of 30 are 2, 3, and 5, giving a total of 3 prime factors.

By prime definition, 1 is excluded from the list of prime factors.

Key Concept

Greatest Common Divisor (GCD) and Prime Factorization

Estimated Time:1m 0s

Question 54Question →

For two positive integers $x$ and $y$ , their greatest common divisor is $\gcd(x, y) = 12$ and their least common multiple is $\text{lcm}(x, y) = 10,800$ . If $x > y$ , $x$ is not divisible by $9$ , and $y$ is not divisible by $25$ , what is the value of $x + y$ ?

732

972

1,308

1,356

1,500

Show answer & explanation

Answer: 1,308

Answer

The sum of the two integers

x + y

is

1,308

.

By prime factorizing the given GCD (

2^2 \cdot 3^1

) and LCM (

2^4 \cdot 3^3 \cdot 5^2

), the minimum and maximum exponents for each prime factor are determined. The constraint that

x

is not divisible by

9

forces the exponent of

3

in

x

to be

1

, so the exponent of

3

in

y

must be

3

. The constraint that

y

is not divisible by

25

forces the exponent of

5

in

y

to be

0

, so the exponent of

5

in

x

must be

2

. Finally, the condition

x > y

requires the exponent of

2

in

x

to be

4

and in

y

to be

2

. Thus,

x = 1,200

and

y = 108

, giving

x + y = 1,308

.

Step-by-Step Solution

1

Express the GCD and LCM in their prime factorizations.

\gcd(x, y) = 12 = 2^2 \cdot 3^1 \cdot 5^0

and

\text{lcm}(x, y) = 10,800 = 2^4 \cdot 3^3 \cdot 5^2

.

Decomposing into prime factors allows direct determination of the minimum and maximum powers of each prime factor present in

x

and

y

.

2

Determine the prime exponents for

x

and

y

using the given divisibility constraints.

For prime factor

3

:

\min(b_1, b_2) = 1

and

\max(b_1, b_2) = 3

. Since

x

is not divisible by

9 = 3^2

,

b_1 = 1

, which forces

b_2 = 3

. For prime factor

5

:

\min(c_1, c_2) = 0

and

\max(c_1, c_2) = 2

. Since

y

is not divisible by

25 = 5^2

,

c_2 < 2

, which forces

c_1 = 2

and

c_2 = 0

.

The GCD gives the minimum exponent of each prime factor across both numbers, while the LCM gives the maximum exponent.

3

Apply the condition

x > y

to assign the powers of

2

.

The exponents for

2

must be

\{2, 4\}

. If

x

takes exponent

4

and

y

takes exponent

2

,

x = 2^4 \cdot 3^1 \cdot 5^2 = 1,200

and

y = 2^2 \cdot 3^3 \cdot 5^0 = 108

. Since

1,200 > 108

, this satisfies

x > y

.

If

x

took exponent

2

and

y

took exponent

4

, then

x = 300

and

y = 432

, violating

x > y

.

4

Calculate

x + y

.

x + y = 1,200 + 108 = 1,308

.

Adding the uniquely determined values of

x

and

y

gives the final requested sum.

Key Concept

Prime factor exponent min/max rules for GCD and LCM:

\gcd(x,y)

takes the minimum exponent of each prime factor, while

\text{lcm}(x,y)

takes the maximum exponent.

Estimated Time:2m 30s

Question 55Question →

What is the units digit of $7^{43}$ ?

Show answer & explanation

Answer: 3

Answer

The units digit of

7^{43}

is 3.

The units digits of powers of 7 repeat in a pattern of four terms: 7, 9, 3, 1. Dividing the exponent 43 by 4 yields a remainder of 3. The 3rd term in the repeating pattern is 3, so the units digit of

7^{43}

is 3.

Step-by-Step Solution

1

Determine the cyclicity pattern of the units digit of powers of 7.

The units digits for

7^1, 7^2, 7^3, 7^4, \dots

follow the repeating sequence 7, 9, 3, 1 with a cycle length of 4.

Units digits of positive integer powers follow a periodic pattern.

2

Divide the exponent 43 by the pattern cycle length of 4.

43 \div 4 = 10

remainder 3.

The remainder determines which term in the repeating sequence gives the units digit.

3

Find the units digit corresponding to the 3rd term in the cyclicity sequence.

The 3rd digit in the sequence (7, 9, 3, 1) is 3.

A remainder of 3 corresponds to the 3rd power in the cycle,

7^3

.

Key Concept

Units Digit Cyclicity

Question 56Question →

For all integers $k$ and $m$ , if $k^2 + 3km + 2m^2$ is an odd integer, then $k + m$ must be an odd integer.

True

False

Show answer & explanation

Answer: True

Answer

The statement is True.

The statement is true because factoring

k^2 + 3km + 2m^2

yields

(k + m)(k + 2m)

. By the fundamental properties of parity, a product of two integers is odd if and only if both factors are odd. Consequently,

k + m

must be odd.

Step-by-Step Solution

1

Factor the algebraic expression

k^2 + 3km + 2m^2

.

k^2 + 3km + 2m^2 = (k + m)(k + 2m)

Factoring into a product of linear terms allows us to apply parity rules for multiplication.

2

Apply parity rules of multiplication to the product

(k + m)(k + 2m)

.

Since

(k + m)(k + 2m)

is odd, both

(k + m)

and

(k + 2m)

must be odd integers.

The product of two integers is odd if and only if both factors are odd integers.

3

Conclude the parity of

k + m

.

k + m

is guaranteed to be an odd integer.

It is one of the two factors required to be odd for the product to be odd.

Key Concept

Parity Rules for Integer Products and Factoring

Question 57Question →

If an integer $n$ is expressed in its prime factorization as $n = 2^3 \times 5^2 \times 11$ , how many distinct prime factors does $n$ have?

2

3

4

6

30

Show answer & explanation

Answer: 3

Answer

The integer has 3 distinct prime factors.

The expression

n = 2^3 \times 5^2 \times 11

shows

n

written as a product of prime powers. The distinct prime factors are the unique prime numbers serving as bases in this expansion: 2, 5, and 11. Therefore, there are exactly 3 distinct prime factors.

Step-by-Step Solution

1

Identify the prime bases in the prime factorization of

n

.

The prime factorization is given as

n = 2^3 \times 5^2 \times 11^1

. The prime bases are

2

,

5

, and

11

.

By definition, the prime factorization expresses a number as a product of prime numbers raised to exponents.

2

Count the number of unique prime bases.

There are 3 unique prime numbers (

2

,

5

, and

11

).

Exponents indicate how many times a prime factor is multiplied, but they do not add new distinct prime factors.

Key Concept

Distinct Prime Factors

Estimated Time:45s

Question 58Question →

Let $N = 2^a \cdot 3^b \cdot 5^c$ , where $a$ , $b$ , and $c$ are positive integers. If $N^2$ has $105$ positive divisors and $\dfrac{N}{2}$ has $16$ positive divisors, what is the number of positive divisors of $\dfrac{N}{15}$ ?

8

9

12

16

18

Show answer & explanation

Answer: $9$

Answer

The number of positive divisors of

\dfrac{N}{15}

is

9

.

The prime factorization of

N^2

is

2^{2a} \cdot 3^{2b} \cdot 5^{2c}

, giving

(2a+1)(2b+1)(2c+1) = 105 = 3 \times 5 \times 7

. This implies that the exponents

a, b, c

are a permutation of

1, 2, 3

. The number of positive divisors of

\dfrac{N}{2} = 2^{a-1} \cdot 3^b \cdot 5^c

is

a(b+1)(c+1) = 16

. Testing

a \in \{1, 2, 3\}

shows that only

a = 2

satisfies

2(b+1)(c+1) = 16

with

\{b, c\} = \{1, 3\}

. Finally,

\dfrac{N}{15} = 2^a \cdot 3^{b-1} \cdot 5^{c-1}

has

(a+1)bc

positive divisors. Substituting

a=2

and

bc = 3

gives

(2+1) \times 3 = 9

, making

9

the correct choice.

Step-by-Step Solution

1

Express the number of positive divisors of

N^2

in terms of

a

,

b

, and

c

.

(2a+1)(2b+1)(2c+1) = 105

For a prime factorization

p_1^{e_1} p_2^{e_2} \dots

, the total number of positive divisors is

(e_1+1)(e_2+1)\dots

. Here

N^2 = 2^{2a} \cdot 3^{2b} \cdot 5^{2c}

.

2

Determine the set of values for the exponents

\{a, b, c\}

.

\{a, b, c\} = \{1, 2, 3\}

The prime factorization of

105

into three factors greater than

1

is uniquely

3 \times 5 \times 7

. Thus, the set of values for

\{2a+1, 2b+1, 2c+1\}

is

\{3, 5, 7\}

, which gives

\{2a, 2b, 2c\} = \{2, 4, 6\}

, so

\{a, b, c\} = \{1, 2, 3\}

.

3

Use the divisor count of

\dfrac{N}{2}

to identify the specific value of

a

.

a = 2

and

\{b, c\} = \{1, 3\}

Since

\dfrac{N}{2} = 2^{a-1} \cdot 3^b \cdot 5^c

, its divisor count is

a(b+1)(c+1) = 16

. Testing values from

\{1, 2, 3\}

for

a

: if

a=2

, then

2(b+1)(c+1) = 16 \implies (b+1)(c+1) = 8

. Since

\{b, c\} = \{1, 3\}

,

(1+1)(3+1) = 8

, which confirms

a = 2

and

\{b, c\} = \{1, 3\}

.

4

Calculate the number of positive divisors of

\dfrac{N}{15}

.

(2+1)(1)(3) = 9

\dfrac{N}{15} = \dfrac{N}{3 \cdot 5} = 2^a \cdot 3^{b-1} \cdot 5^{c-1}

. The number of positive divisors is

(a+1)(b-1+1)(c-1+1) = (a+1)bc

. Substituting

a=2

and

bc = 1 \times 3 = 3

yields

(2+1) \times 3 = 9

.

Key Concept

Divisor Count Formula for Prime Factorized Integers

Estimated Time:2m 0s

Question 59Question →

What is the smallest prime factor of $143$ ?

Show answer & explanation

Answer: 11

Answer

The smallest prime factor of 143 is 11.

To find the smallest prime factor of 143, test prime numbers in increasing order starting from 2. Testing 2, 3, 5, and 7 shows none are factors of 143. Testing 11 yields

143 \div 11 = 13

, which is an integer. Thus,

143 = 11 \times 13

. Since 11 and 13 are both prime, 11 is the smallest prime factor of 143.

Step-by-Step Solution

1

Test divisibility of 143 by small prime numbers in ascending order

143 is not divisible by 2, 3, 5, or 7.

Basic divisibility rules eliminate 2 (odd), 3 (digit sum 8), and 5 (ends in 3). Direct division shows 143 = 7 × 20 + 3.

2

Test divisibility by the next prime number, 11

143 divided by 11 equals 13 exactly.

Since 143 = 11 × 13 and 11 is prime, 11 is a prime factor.

3

Identify the smallest prime factor

The prime factors of 143 are 11 and 13, making 11 the smallest.

No prime number smaller than 11 divides 143.

Key Concept

Prime Factorization

Question 60Question →

A consultancy allocated a total budget for a digital transformation project. In the first phase, $\frac{3}{8}$ of the initial budget was spent. In the second phase, $40\%$ of the remaining budget was spent. If the unspent amount after both phases is $\$27,000$ , what was the initial budget of the project, in dollars?

Show answer & explanation

Answer: 72000

Answer

72,000

To determine the initial budget, track the unspent fraction step by step. After the first phase,

\frac{5}{8}

of the budget remains. In the second phase,

40\%

(or

\frac{2}{5}

) of that remaining fraction is spent, which leaves

60\%

(or

\frac{3}{5}

) of the

\frac{5}{8}

unspent. Multiplying

\frac{3}{5} \times \frac{5}{8} = \frac{3}{8}

. Because

\frac{3}{8}

of the initial budget equals

\$27,000

, the full initial budget is

27,000 \times \frac{8}{3} = 72,000

.

Step-by-Step Solution

1

Find the fraction of the budget remaining after the first phase.

The fraction remaining after Phase 1 is

1 - \frac{3}{8} = \frac{5}{8}

.

The first phase spends

\frac{3}{8}

of the initial total budget.

2

Find the fraction of the total initial budget spent in the second phase.

Phase 2 expenditure =

40\% \times \frac{5}{8} = \frac{2}{5} \times \frac{5}{8} = \frac{2}{8}

.

40\%

is equivalent to

\frac{2}{5}

, which applies to the remaining

\frac{5}{8}

of the budget.

3

Determine the remaining fraction of the total budget after both phases.

Remaining fraction =

\frac{5}{8} - \frac{2}{8} = \frac{3}{8}

.

Subtracting the fraction spent in Phase 2 from the fraction left after Phase 1 yields the unspent portion.

4

Calculate the initial total budget in dollars.

Initial Budget =

\$27,000 \times \frac{8}{3} = \$72,000

.

Setting

\frac{3}{8}

of the total budget equal to the unspent amount of

\$27,000

determines the total.

Key Concept

Sequential fractional and percentage reductions from a base quantity

Number Properties and Arithmetic

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Alternative Method

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution

Key Concept

Common Mistakes

Answer

Step-by-Step Solution