Last visit was: 19 Nov 2025, 06:16 It is currently 19 Nov 2025, 06:16
Close
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
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.
Close
Request Expert Reply
Confirm Cancel
User avatar
hallelujah1234
Joined: 02 Mar 2004
Last visit: 29 Jan 2023
Posts: 191
Own Kudos:
Location: There
Posts: 191
Kudos: 14
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
hallelujah1234
Joined: 02 Mar 2004
Last visit: 29 Jan 2023
Posts: 191
Own Kudos:
Location: There
Posts: 191
Kudos: 14
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
stolyar
Joined: 03 Feb 2003
Last visit: 06 May 2014
Posts: 1,012
Own Kudos:
Posts: 1,012
Kudos: 1,850
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
lastochka
Joined: 07 Oct 2003
Last visit: 15 Aug 2006
Posts: 193
Own Kudos:
Location: Manhattan
Posts: 193
Kudos: 68
Kudos
Add Kudos
Bookmarks
Bookmark this Post
stolyar
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?
User avatar
Emmanuel
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
Kudos
Add Kudos
Bookmarks
Bookmark this Post
hallelujah1234
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.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderators:
Math Expert
105388 posts
GMAT Tutor
1924 posts