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:

Re: For all integers n, the function f is defined by f (n) = [#permalink]

Show Tags

06 May 2013, 21:24

Can someone help me here, IF the question is a value question such as this one, statement one provides two values (+10) or (-10), I'm under the impression that the values are found, but the gmat wants one value, is this true for all DS questions, the value cannot have two or more possibilities, correct?

Re: For all integers n, the function f is defined by f (n) = [#permalink]

Show Tags

07 May 2013, 00:01

1

This post received KUDOS

Expert's post

laythesmack23 wrote:

Can someone help me here, IF the question is a value question such as this one, statement one provides two values (+10) or (-10), I'm under the impression that the values are found, but the gmat wants one value, is this true for all DS questions, the value cannot have two or more possibilities, correct?

Thanks,

There are two kinds of data sufficient questions: YES/NO DS questions and DS questions which ask to find a value.

In a Yes/No Data Sufficiency questions, statement is sufficient if the answer is “always yes” or “always no” while a statement is insufficient if the answer is "sometimes yes" and "sometimes no".

When a DS question asks about the value of some variable, then the statement is sufficient ONLY if you can get the single numerical value of this variable.

BACK TO THE QUESTION. For all integers n, the function f is defined by f (n) = a^n, where a is a constant. What is the value of f (1)?

\(f(1)=a^1=a\), so basically the question is: what is the value of \(a\)?

(1) f(2) = 100 --> \(f(2)=100=a^2\) --> \(a=10\) or \(a=-10\). Two answers, not sufficient.

(2) f(3) = -1,000 --> --> \(f(3)=-1,000=a^3\) --> only one solution: \(a=-10\). Sufficient.

Re: For all integers n, the function f is defined by f (n) = a^n [#permalink]

Show Tags

29 Jan 2016, 14:11

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________

Excellent posts dLo saw your blog too..!! Man .. you have got some writing skills. And Just to make an argument = You had such an amazing resume ; i am glad...

So Much $$$ Business school costs a lot. This is obvious, whether you are a full-ride scholarship student or are paying fully out-of-pocket. Aside from the (constantly rising)...

They say you get better at doing something by doing it. then doing it again ... and again ... and again, and you keep doing it until one day you look...