How many positive integer divisors of [unparseable or potentially dangerous latex formula] are divisible by exactly 2004 positive integers?
try owning this problem quell
forum.virtualchallengemeets.com
Your connection to the competitive math/science community. (Formerly texasmath.org)
AIME #8 2004
13 posts
• Page 1 of 1
AIME #8 2004
by stupidityismygam » Sun Apr 22, 2007 11:23 pm
-
stupidityismygam - Ubiquitous Spammer
- Posts: 1413
- Joined: Tue Nov 21, 2006 8:02 pm
- Quelloquialism
- Celebrated Spammer
- Posts: 534
- Joined: Tue Oct 24, 2006 8:02 pm
- Location: TopCoder Chat Room 1
by Englandude » Sun Apr 22, 2007 11:40 pm
Let me try and make an educated guess....how about 2004?? Am i rite? Am i rite?
I have no clue in other words. Hey, i put forth an "educated" effort.
I have no clue in other words. Hey, i put forth an "educated" effort.
- Englandude
- Incessant Spammer
- Posts: 349
- Joined: Sat Mar 24, 2007 9:20 pm
- Location: TX
- Quelloquialism
- Celebrated Spammer
- Posts: 534
- Joined: Tue Oct 24, 2006 8:02 pm
- Location: TopCoder Chat Room 1
by Quelloquialism » Mon Apr 23, 2007 12:31 am
Factor 2004.
You get [unparseable or potentially dangerous latex formula]. Distribute the exponent, and you have [unparseable or potentially dangerous latex formula].
The number of positive integral divisors of an integer is the product of all prime exponents increased by one.
So, we are looking for solutions to the equation [unparseable or potentially dangerous latex formula], where a, b, and c are all integers between 0 and 2003, inclusive (the 2003 limit is because, clearly, no solutions are possible if all terms are at least 1 and one term is at least 2003), representing the exponents of 167, 2, and 3, respectively.
As we already determined, 2004 = [unparseable or potentially dangerous latex formula].
Then my elegance engine crashed and I brute-forced the possible values of a, b, and c on paper, though I'm sure there's a better way. My brain doesn't work.
You get [unparseable or potentially dangerous latex formula]. Distribute the exponent, and you have [unparseable or potentially dangerous latex formula].
The number of positive integral divisors of an integer is the product of all prime exponents increased by one.
So, we are looking for solutions to the equation [unparseable or potentially dangerous latex formula], where a, b, and c are all integers between 0 and 2003, inclusive (the 2003 limit is because, clearly, no solutions are possible if all terms are at least 1 and one term is at least 2003), representing the exponents of 167, 2, and 3, respectively.
As we already determined, 2004 = [unparseable or potentially dangerous latex formula].
Then my elegance engine crashed and I brute-forced the possible values of a, b, and c on paper, though I'm sure there's a better way. My brain doesn't work.
- Quelloquialism
- Celebrated Spammer
- Posts: 534
- Joined: Tue Oct 24, 2006 8:02 pm
- Location: TopCoder Chat Room 1
by Michael T » Mon Apr 23, 2007 10:07 am
what's the point difference between bruteforcing and eleganc(ing?) Does it make a huge difference if you find a nice solution to a problem vs what quell usually does?
- Michael T
- Incessant Spammer
- Posts: 312
- Joined: Wed Feb 28, 2007 9:37 pm
- Location: Ay-tass-coh-cee-tah
by Michael T » Mon Apr 23, 2007 10:13 am
but that's not to be confused with saying AIME is easier than USAMO, right?
The reason I've started browsing this forum is because I'm thinking about participating next year.
The reason I've started browsing this forum is because I'm thinking about participating next year.
- Michael T
- Incessant Spammer
- Posts: 312
- Joined: Wed Feb 28, 2007 9:37 pm
- Location: Ay-tass-coh-cee-tah
13 posts
• Page 1 of 1
Who is online
Users browsing this forum: No registered users and 2 guests