Author
Message
limac
Riemann Hypothesis
Offline Joined: 17 Feb 2009 Posts: 356 Location: NJ
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
AwesomeToad wrote:
How do you figure that?
I think AIME15 did it using the Shoelace Theorem, which can be found here http://www.artofproblemsolving.com/Wiki/index.php/Shoelace_Theorem
_________________
li nux +
mac intosh
li + mac = limac.
Q.E.D.
Posted: Thu Oct 15, 2009 12:54 pm
the cliu
Poincare Conjecture
Online Joined: 11 Jun 2009 Posts: 223 Location: The lower part of the MITTEN
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
random NP
An ancient philosopher was pondering one day what to call his newly discovered subject. He then realized that he wanted all of the letters of this new concept to be different, and four letters long. There just happened to be 26 letters in his alphabet at the time. What is the probability that he called his newly discovered subject "math"?
Posted: Sun Oct 18, 2009 7:17 pm
vliu
P versus NP
Offline Joined: 16 Jan 2008 Posts: 25 Location: hmm SOMEWHERE OVER THE RAINBOW
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
well since there are 26 letters in an alphabet you can get a total of 26*25*24*23 4 letter words. next since you can only spell math 1 way the answer in 1/(26*25*24*23) which is 1/ 358800
Posted: Sun Oct 18, 2009 7:23 pm
Thunder365
Yang-Mills Theory
Offline Joined: 27 Feb 2009 Posts: 507 Location: Michigan
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
NP:
(my old one)
Six students are going to sit in a row for Countdown Round in Mathcounts. Thunder wants to sit next to cliu. Athunder does not want to sit next to Alex. The other two people can sit anywhere. How many ways can these six students be seated?
_________________
I'm not dumb. I just have a command of thoroughly useless information.
Goals: AMC8:25| AMC10:138+|AIME:5+| Mandelbrot:Leaderboard| Mathcounts:Make Nats| MMPC part 1:28+, MMPC part 2:16+, top 100=>Michigan ARML B team| USAMTS:Bronze| Make CMO
Posted: Mon Oct 19, 2009 1:14 pm
the cliu
Poincare Conjecture
Online Joined: 11 Jun 2009 Posts: 223 Location: The lower part of the MITTEN
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
blah
gahhh thunder why is ur problem so difficult?
New problem: sry thunder, ur problem was too hard
There are 2 students left in the Countdown Round. The first person to get to 3 points wins (lol ik this is wrong but didn't wanna make it too hard). cliu has a probability of to get a point against thunder, who has a probability of getting a point against cliu. Currently the score is tied 1-1. What is the probability that cliu wins?
_________________ GOALS: MathCounts --> |Make States| AMC's --> AMC 8: 20+ | AMC 10: idrc just make AIME| ACHIEVED:| ASMA R1: 3/7, ASMA R2: 4/7 | MOEMS R1: 4/5| MMPC-1: 15 |
Posted: Wed Oct 21, 2009 6:36 pm
Thunder365
Yang-Mills Theory
Offline Joined: 27 Feb 2009 Posts: 507 Location: Michigan
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
The probability is 1...
jk, but in reality it would be 1.
So the outcome either goes CTC,CC,TCC.
1st-3/64
2nd-4/64
3rd-3/54
total 10/64=5/32
NP:
How many ways are there to roll 5 dice to get a sum of 10?
_________________
I'm not dumb. I just have a command of thoroughly useless information.
Goals: AMC8:25| AMC10:138+|AIME:5+| Mandelbrot:Leaderboard| Mathcounts:Make Nats| MMPC part 1:28+, MMPC part 2:16+, top 100=>Michigan ARML B team| USAMTS:Bronze| Make CMO
Posted: Thu Oct 22, 2009 3:21 am
the cliu
Poincare Conjecture
Online Joined: 11 Jun 2009 Posts: 223 Location: The lower part of the MITTEN
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
blah
solution Thunder's Problem: How many ways are there to roll 5 dice to get a sum of 10?
If the first roll gives us a
, then we can have
which yields 5 ways.
If the first roll gives us a
, then we can have
which yields 10 ways.
If the first roll gives us a
, then we can have
for a total of 10 ways.
We can also have
which gives us 30 ways.
If the first roll gives us a
, then we can have
for a total of 30 ways.
We can also have
for a total of 10 ways.
If the first roll gives us a
, then we can have
for a total of 1 way.
We have already counted the rest of the ways for 2, and the entire number of ways for 1, so our answer is
which gives us
total ways to get a sum of 10 using 5 dice.
I do not think that my solution is correct. Please identify any errors and correct them for me, thanks
New problem What is the smallest solution to the equation
?
Last edited by the cliu on Sat Oct 24, 2009 2:33 pm; edited 1 time in total
Posted: Sat Oct 24, 2009 9:11 am
AndrewTom
Navier-Stokes Equations
Offline Joined: 13 Dec 2006 Posts: 1635
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Solution
New problem
Find the smallest solution of the equation
.
Posted: Sat Oct 24, 2009 9:49 am
Thunder365
Yang-Mills Theory
Offline Joined: 27 Feb 2009 Posts: 507 Location: Michigan
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Solution:
We have:
so one solution is x=-2. We can also have:
Seeing that one solution is x=1, we can synthetic divide by 1 to get the following:
Which has solutions and , both of which are greater than -2, so our solution is
NP:
Let be a linear function for which . What is ?
@ cliu: The answer you gave is slightly off. You can set up an equation: (we have the sum as 5 not 10 because each dice MUST be at minimum a 1, so we get 10-5=5)
Now how many non-negative solutions does that equation have by balls and urns? And how did this not overcount the total solutions?
_________________
I'm not dumb. I just have a command of thoroughly useless information.
Goals: AMC8:25| AMC10:138+|AIME:5+| Mandelbrot:Leaderboard| Mathcounts:Make Nats| MMPC part 1:28+, MMPC part 2:16+, top 100=>Michigan ARML B team| USAMTS:Bronze| Make CMO
Posted: Sat Oct 24, 2009 10:17 am
AndrewTom
Navier-Stokes Equations
Offline Joined: 13 Dec 2006 Posts: 1635
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Solution
Across
, up
; across
, up
.
Therefore
.
New problem
Find the smallest root of
.
Posted: Sat Oct 24, 2009 10:59 am
Humbleman
New Member
Offline Joined: 06 Jan 2008 Posts: 9
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
goldenboy1.618 wrote:
If Kelly is 36 years old, then Mark is 29 years old. If Kelly is not 36, then Andrea is not 14. Andrea is indeed 14. Mark is either 29 or 45. How old is Mark? (From a school entrance exam)
Maybach wrote:
Um.....REALLY EASY
This means Kelly is 36 and Mark is 25. (Wow, some school entrance exam )
How can u answer like that? I stucked when I solve this problem with Ponens, Tollens, and Syllogistic....
Posted: Mon Oct 26, 2009 7:58 pm
fishythefish
Yang-Mills Theory
Offline Joined: 03 Mar 2008 Posts: 822 Location: Unknown, with known velocity
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Andrea is 14, so Kelly is 36, because if Kelly were anything else, Andrea would not be 14.
Because Kelly is 36, Mark is 29.
So I don't know where that 25 came from, but Kelly is 36 and Mark is 29.
_________________
I am NOBODY. NOBODY is PERFECT. Therefore, I am PERFECT.
There are 3 types of people in the world. Those who can count and those who can't.
ATTENTION ALL CALCOHOLICS!!! Know your limits. Don't drink and derive.
Posted: Tue Oct 27, 2009 12:42 pm
AwesomeToad
Yang-Mills Theory
Offline Joined: 25 Apr 2009 Posts: 790 Location: West Lafayette, IN (Rating: 1337)
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Post a new problem.
NP If
find
Posted: Wed Oct 28, 2009 8:18 am
gauss1181
Birch & Swinnerton Dyer
Offline Joined: 08 Sep 2007 Posts: 2596 Location: IMSA
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Squaring that:
Now to find :
_________________
My Olympiad Compilation! (plus some bits of randomness too)
Latest Problems Typed: 1979 ISL number theory problem
Posted: Wed Oct 28, 2009 10:40 am
$LaTeX$
Riemann Hypothesis
Offline Joined: 11 Jul 2009 Posts: 471 Location: Why Are You Looking At This STALKER??? Say NO to Stalkers!
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Post a new problem.
New Problem
Bobby stands 10 feet from Sam, and Eric stands 8 feet from Bobby. What is the least number of feet that Eric could be from Sam?
_________________
DOPE!!! I FAIL AT EVERYTHING!!!
I hope this isn't
!!!!! Please rate this post at least a
. If not, please pm me and tell me why.
Posted: Wed Oct 28, 2009 1:43 pm
Thunder365
Yang-Mills Theory
Offline Joined: 27 Feb 2009 Posts: 507 Location: Michigan
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Solution:
If we have:
B_________E___S where bs=10 and eb=8, then es=2
NP:
7 red pegs, 6 blue pegs, 5 white pegs, 4 orange pegs, 3 yellow pegs, 2 black pegs, and 1 brown peg are place in the following spaces such that no two pegs of the same color are in the same row or column. How many ways are there to arrange the pegs?
DIAGRAM:
_
_ _
_ _ _
_ _ _ _
_ _ _ _ _
_ _ _ _ _ _
_ _ _ _ _ _ _
_________________
I'm not dumb. I just have a command of thoroughly useless information.
Goals: AMC8:25| AMC10:138+|AIME:5+| Mandelbrot:Leaderboard| Mathcounts:Make Nats| MMPC part 1:28+, MMPC part 2:16+, top 100=>Michigan ARML B team| USAMTS:Bronze| Make CMO
Posted: Wed Oct 28, 2009 2:39 pm
Scamper
Navier-Stokes Equations
Offline Joined: 31 May 2009 Posts: 1109 Location: California
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Solution
Well only a red peg can go in the top row.
Then only a red peg, and a blue peg can go into the second row with 2 ways to arrange them.
Then we have a red peg, blue peg, and a white peg which go in the third with 6 ways to arrange them.
Continue to get...
Which is in other words...
Anyways, that equals...
Hope I was right.
NP
There are 65 people who have a candy.
There are 29 people who have cotton candy.
There are 71 people who have chocolate.
There are 15 people who have candy and chocolate.
There are 12 people who have candy and cotton candy.
There are 7 people who have chocolate and cotton candy.
There are 7 people who have no chocolate, cotton candy, or candy.
How many people have chocolate, candy, and cotton candy?
_________________
Rate this post 6 star if it's good!
If it's unsatisfactory, PM me on how to improve my posts!
Posted: Wed Oct 28, 2009 3:43 pm
$LaTeX$
Riemann Hypothesis
Offline Joined: 11 Jul 2009 Posts: 471 Location: Why Are You Looking At This STALKER??? Say NO to Stalkers!
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
How is this possible?
There are 65 people who have a candy.
There are 71 people who have chocolate.
Isn't chocolate a candy?
New Problem
A reference book lists a set of annual calendars. For any given year, there is a
calendar in the set that corresponds to it. How many annual calendars must be
included in the set in order to have a corresponding calendar for every possible year?
_________________
DOPE!!! I FAIL AT EVERYTHING!!!
I hope this isn't
!!!!! Please rate this post at least a
. If not, please pm me and tell me why.
Posted: Wed Oct 28, 2009 3:46 pm
fishythefish
Yang-Mills Theory
Offline Joined: 03 Mar 2008 Posts: 822 Location: Unknown, with known velocity
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Assume that chocolate is not a candy.
Would it be 14? 7 for all common years (1 per day that Jan. 1st can fall on) and 7 more for the same thing with leap years?
Unless there is a day that cannot begin a year...
_________________
I am NOBODY. NOBODY is PERFECT. Therefore, I am PERFECT.
There are 3 types of people in the world. Those who can count and those who can't.
ATTENTION ALL CALCOHOLICS!!! Know your limits. Don't drink and derive.
Posted: Thu Oct 29, 2009 12:39 pm
Thunder365
Yang-Mills Theory
Offline Joined: 27 Feb 2009 Posts: 507 Location: Michigan
Not_yet_rated
Poor (Spam)
Poor (Spam)
Below average
Below average
Average
Average
Good
Good
Very good
Very good
Excellent
To rate posts you must be logged in
Scamper wrote:
Solution
Well only a red peg can go in the top row.
Then only a red peg, and a blue peg can go into the second row with 2 ways to arrange them.
Then we have a red peg, blue peg, and a white peg which go in the third with 6 ways to arrange them.
Continue to get...
Which is in other words...
Anyways, that equals...
Hope I was right.
Well, you were on the right track. You noticed that only a red peg can go in the top row. So then in the row with 2 spaces, a red peg cannot be directly underneath the top slot, since no row or column has a peg of the same color. Therefore, there is only one place the red peg can go in both the top row and the second row. Continuing that, you see that there is only 1 arrangement for the red pegs- when they are all on the diagonal of the triangle. You can do the same with the other pegs, too, and find that there is only 1 way to arrange them.
_________________
I'm not dumb. I just have a command of thoroughly useless information.
Goals: AMC8:25| AMC10:138+|AIME:5+| Mandelbrot:Leaderboard| Mathcounts:Make Nats| MMPC part 1:28+, MMPC part 2:16+, top 100=>Michigan ARML B team| USAMTS:Bronze| Make CMO
Posted: Thu Oct 29, 2009 1:42 pm
Display posts from previous: All Posts 1 Day 7 Days 2 Weeks 1 Month 3 Months 6 Months 1 Year Sort by: Post Time Post Subject Author Ascending Descending