Is (n^5/5)+(n^3/3)+(7n/15) an integer? 1. n is odd 2. n is : DS Archive
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 18 Jan 2017, 15:39

GMAT Club Daily Prep

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

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Is (n^5/5)+(n^3/3)+(7n/15) an integer? 1. n is odd 2. n is

Author Message
Senior Manager
Joined: 02 Mar 2004
Posts: 327
Location: There
Followers: 1

Kudos [?]: 0 [0], given: 0

Is (n^5/5)+(n^3/3)+(7n/15) an integer? 1. n is odd 2. n is [#permalink]

Show Tags

12 Apr 2004, 11:47
00:00

Difficulty:

(N/A)

Question Stats:

100% (00:00) correct 0% (00:00) wrong based on 0 sessions

HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Is (n^5/5)+(n^3/3)+(7n/15) an integer?

1. n is odd
2. n is even
Senior Manager
Joined: 02 Mar 2004
Posts: 327
Location: There
Followers: 1

Kudos [?]: 0 [0], given: 0

Show Tags

13 Apr 2004, 17:46
SVP
Joined: 03 Feb 2003
Posts: 1603
Followers: 8

Kudos [?]: 245 [0], given: 0

Show Tags

15 Apr 2004, 00:31
agree with D
the initial thing can be transformed into:

X=[(3n^5)+(5n^3)+7n]/15

For X to be an integer, its numerator has to be divisible by 15.
consider (3n^5)+(5n^3)+7n closely; it is always divisible by 15 if n is an integer

my way to prove it is too long and not elegant...
another way is to take some numbers 0, 1, -1, 2, -2,....
Senior Manager
Joined: 07 Oct 2003
Posts: 353
Location: Manhattan
Followers: 2

Kudos [?]: 20 [0], given: 0

Show Tags

19 Apr 2004, 12:01
stolyar wrote:
agree with D
the initial thing can be transformed into:

X=[(3n^5)+(5n^3)+7n]/15

For X to be an integer, its numerator has to be divisible by 15.
consider (3n^5)+(5n^3)+7n closely; it is always divisible by 15 if n is an integer

my way to prove it is too long and not elegant...
another way is to take some numbers 0, 1, -1, 2, -2,....

How do you know that n is always devided by 15 if n is an integer?
Manager
Joined: 07 May 2004
Posts: 183
Location: Ukraine, Russia(part-time)
Followers: 2

Kudos [?]: 15 [0], given: 0

Show Tags

14 May 2004, 04:14
hallelujah1234 wrote:
Is (n^5/5)+(n^3/3)+(7n/15) an integer?

1. n is odd
2. n is even

(3*n^5 + 5*n^3 + 7*n)/15 = n(3n^4+5*n^2 + 7)/15.

3n^4+5n^2+7 = (-2n^4+2)+5(n^4+n^2+1).

by the theorem of Ferma: n(n^4-1) :: 5, and by the theorem of Ferma n(n^2-1) :: 3. => first part is interger anyway.

Second part: n(n^4+n^2+1)=n([n^4-n^2]+[2n^2+1]). Again, by the theorem of Ferma, n(n^4-n^2)=n(n^2-1)*(n^2) :: 3. n(2n^2+1) = n(2n^2-2+3) :: 3 again be the theorem of Ferma!

Regardless of 1 or 2 the stem is true!

P.S. theorem of Ferma: n^p-n always :: p, where p is prime, n - integer.
Re: DS-43   [#permalink] 14 May 2004, 04:14
Display posts from previous: Sort by