Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

By fermat's little theorem, for any constant integer a, a^(p-1) = 1 (mod p)

(1) 24 < y < 32 Implies that x=1 and y= p with p>2 (clearly p is either 29 or 31, but it only matters that p is odd).

Thus 7^x + 9^y = 7 + 9^y

But by Fermat's little theorem, 9^(y-1) = 1 (mod y). Thus 9^y = 9 (mod y). And 7 + 9^y = 7 + 9 = 16 (mod y) So we have that the units digit of 7^x + 9^y is 6.

First, you certainly do not need Fermat's Little Theorem on the GMAT. Second, it's being misapplied here. Yes, it is true that 9^(y-1) = 1 mod y, if y is prime, but let, for example, y be 29. If you apply Fermat's Little Theorem, you can be certain that 9^28 = 1 mod 29, but that tells you nothing about the units digit of 9^28; we want to know what 9^28 is equal to mod 10, not mod 29. It is pure coincidence that Fermat's Little Theorem appears to give the correct answer here, as you will find if you try to apply the same reasoning with a different base. Try 3^y instead with y=31, for example, to see why FLT does not tell you about units digits: the units digit of 3^31 is 7, not 3.

We do not need any special theorems to answer the question.

shuj00 wrote:

If x and y are positive integers such that the product of x and y is prime, what is the units’ digit of 7^x + 9^y? (1) 24 < y < 32 (2) x = 1

We can be certain that one of x or y is prime, and the other is 1. From Statement 1, y is prime and x is 1. Since y is a prime greater than 2, y is odd, and for any positive odd integer y, 9^y will end in 9 (since if y is odd, y = 2k+1 for some integer k, and thus 9^y = 9^(2k + 1) = (9^2k)(9^1) = (81^k)(9), and the units digit of 81^k is 1). So 7^x + 9^y = 7 + 9^y, which will end in 6.

Statement 2 is almost sufficient. We know that x=1 and y is prime. If y is an odd prime, then 7^1 + 9^y will end in 6. However, y might be equal to 2, in which case 9^y= 9^2 will end in 1, not 9, and 7^x + 9^y will end in 8.
_________________

GMAT Tutor in Toronto

If you are looking for online GMAT math tutoring, or if you are interested in buying my advanced Quant books and problem sets, please contact me at ianstewartgmat at gmail.com

If the product of two integers x,y is a prime number p, then one of the integers is p and the other is 1, clearly.

Thus either x=1 and y=p or x=p and y=1.

By fermat's little theorem, for any constant integer a, a^(p-1) = 1 (mod p)

(1) 24 < y < 32 Implies that x=1 and y= p with p>2 (clearly p is either 29 or 31, but it only matters that p is odd).

Thus 7^x + 9^y = 7 + 9^y

But by Fermat's little theorem, 9^(y-1) = 1 (mod y). Thus 9^y = 9 (mod y). And 7 + 9^y = 7 + 9 = 16 (mod y) So we have that the units digit of 7^x + 9^y is 6.

SUFFICIENT

(2) x=1 Implies that y=p. Take y=2, then 7^x + 9^y = 7+81 = 88 Now, take y=3, then 7^x + 9^y = 736

Thus the units digit is either 8 if y=2 or 6 if y>2.

I got it so far that y would be either 29 or 31 and x would be 1. However is there a way to know without calculation that any integer to power of 29 and 31 (for example) would result in the same units digit.

If x and y are positive integers such that the product of x and y is prime, what is the units’ digit of 7^x + 9^y?

(1) 24 < y < 32 (2) x = 1

(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not. (B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not. (C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient. (D) EACH statement ALONE is sufficient to answer the question. (E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.

I will wait for the few replies before posting the OA

IMO A..

Given x*y is prime.. means either x = 1 or y = 1 S1: 24<y<32... this gives x = 1... and y = 29 or 31 (2 primes in the range)

Unit digit of \(7^x + 9^y = 7^1 + 9^{29}\) or \(7^1 + 9^{31}\)

Cyclicity of 9 is 2.... therefore unit digit for 9^29 = 9^1 = 9 and 9^31 = 9^1 = 9

and unit digit for 7^1 = 7...

Therefore unit digit of Unit digit of \(7^x + 9^y\) = 6 SUFF

S2: x = 1.... gives y is the prime number.... but this is INSUFF.....
_________________

Cheers! JT........... If u like my post..... payback in Kudos!!

|Do not post questions with OA|Please underline your SC questions while posting|Try posting the explanation along with your answer choice| |For CR refer Powerscore CR Bible|For SC refer Manhattan SC Guide|

If x and y are positive integers such that the product of x and y is prime, what is the units’ digit of 7^x + 9^y?

(1) 24 < y < 32 (2) x = 1

(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not. (B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not. (C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient. (D) EACH statement ALONE is sufficient to answer the question. (E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.

I will wait for the few replies before posting the OA

IMO A..

Given x*y is prime.. means either x = 1 or y = 1 S1: 24<y<32... this gives x = 1... and y = 29 or 31 (2 primes in the range)

Unit digit of \(7^x + 9^y = 7^1 + 9^{29}\) or \(7^1 + 9^{31}\)

Cyclicity of 9 is 2.... therefore unit digit for 9^29 = 9^1 = 9 and 9^31 = 9^1 = 9

and unit digit for 7^1 = 7...

Therefore unit digit of Unit digit of \(7^x + 9^y\) = 6 SUFF

S2: x = 1.... gives y is the prime number.... but this is INSUFF.....

Could you please explain what you mean by cyclicity of 9 being 2? I dont understand your logic leap here in part B, if you could maybe write it out a little bit more I would be interested to see the solution construction.

If x and y are positive integers such that the product of x and y is prime, what is the units’ digit of 7^x + 9^y?

(1) 24 < y < 32 (2) x = 1

(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not. (B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not. (C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient. (D) EACH statement ALONE is sufficient to answer the question. (E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.

I will wait for the few replies before posting the OA

IMO A..

Given x*y is prime.. means either x = 1 or y = 1 S1: 24<y<32... this gives x = 1... and y = 29 or 31 (2 primes in the range)

Unit digit of \(7^x + 9^y = 7^1 + 9^{29}\) or \(7^1 + 9^{31}\)

Cyclicity of 9 is 2.... therefore unit digit for 9^29 = 9^1 = 9 and 9^31 = 9^1 = 9

and unit digit for 7^1 = 7...

Therefore unit digit of Unit digit of \(7^x + 9^y\) = 6 SUFF

S2: x = 1.... gives y is the prime number.... but this is INSUFF.....

Could you please explain what you mean by cyclicity of 9 being 2? I dont understand your logic leap here in part B, if you could maybe write it out a little bit more I would be interested to see the solution construction.

Cyclicity of a number is - basically the power of a number when the last digit starts to repeat itself...

For e.g.... what is the cyclicity of 2....

2^1 = 2... 2^2 = 4... 2^3 = 8 2^4 = 16... 2^5= 32... (last digit is 2... which is same as last digit of 2^1) Therefore cyclicity of 2 is 4 since... on 2^5... the last digit begins to repeat. More reference: math-number-theory-88376.html?view-post=666609#p666609 Section "Last digit of a power"

Now if u consider 9.... 9^1 = 9 9^2 = 81 9^3 = 729... last digit same as 9^1... therefore cyclicity of 9 is 2....

If u know the cyclicity of a number... you can find the last digit of that number raise to power any figure.

For e.g: \(9^{3457}\) last digit would be calculated as follows: 1. Get the cyclicity of 9 i.e. 2 2. Get the remainder by dividing 3457 by the cyclicity number i.e 2. The remainder would be 1. 3. Therefore last digit would be 9^remainder = 9^1 = 9

In case the remainder comes 0.. then last digit = 9^cyclicity number itself.

Now in the given problem we have 7^1 + 9^29 or 7^1 + 9^31. In both the cases we would get the last digit as 7 + 9 (31 or 29 would give 1 as remainder when divided by cyclicity of 9) = 16.. i.e. 6 as the last digit.

Hope it's clear now.
_________________

Cheers! JT........... If u like my post..... payback in Kudos!!

|Do not post questions with OA|Please underline your SC questions while posting|Try posting the explanation along with your answer choice| |For CR refer Powerscore CR Bible|For SC refer Manhattan SC Guide|

From the given part of the problem we can derive that one of the integers should be 1 and the other prime in order the product of these two positive integers to be prime. We don't wich one is one and which one is prime.

From the first statement we can derive that x is 1, and y is prime number. Y is not 2, so it is certainly odd. All odd powers of 9 have the units digit of 9. 7^1 ends with 7. SUFFICIENT

From the second statment we can derive that 7 is 1, and that y may be any prime number including 2, and all the other odd primes. Here we have two possible results so it is INSUFFICIENT

This problem is a little bit tricky. First I thought the answer was D becuase I solved the problem in my head rather than on the scrap. But when I began to analyze it before posting I realized that I overlooked the possibility of 2 as a value of y in the second statement. Hope will be more careful on the actual test.

After days of waiting, sharing the tension with other applicants in forums, coming up with different theories about invites patterns, and, overall, refreshing my inbox every five minutes to...

I was totally freaking out. Apparently, most of the HBS invites were already sent and I didn’t get one. However, there are still some to come out on...

In early 2012, when I was working as a biomedical researcher at the National Institutes of Health , I decided that I wanted to get an MBA and make the...