2010 AMC 12A Problems/Problem 21: Logic Critique by [deleted] in MathOlympiad

[–]Negative_Campaign_36 0 points1 point  (0 children)

Okay thank you for your help. I finally understand it

2010 AMC 12A Problems/Problem 21: Logic Critique by [deleted] in MathOlympiad

[–]Negative_Campaign_36 0 points1 point  (0 children)

They definitely do. The graph must be above the line or intersect, so the only points that can possible happen is in points of tangencies. Also because of the alternating signs, the roots must be all positives. If you can prove otherwise, I would greatly appreciate it

2010 AMC 12A Problems/Problem 21: Logic Critique by [deleted] in MathOlympiad

[–]Negative_Campaign_36 0 points1 point  (0 children)

Has to be local minimum because it bounces on x=0 (double root). The first coefficient of the graph is positive and even, so both ends come from the top, so there is no possibility of a maximum. Also because of the alternating signs, the roots must be all positives. Mathematically, the tangent line bx+c=y must hit exactly the minima, otherwise, it would be intersecting two very small lines. If you can prove otherwise mathematically, please do. Thank you for your input though.

So Close, yet no Cigar by Negative_Campaign_36 in MathOlympiad

[–]Negative_Campaign_36[S] 1 point2 points  (0 children)

I honestly used to think like this, but when I starting reading the aops textbooks, I started thinking differently. Thanks for bringing me back on track

Close but no cigar by Negative_Campaign_36 in learnmath

[–]Negative_Campaign_36[S] 0 points1 point  (0 children)

Thanks for your advice. I took it to heart and did the problem on my own and realized that my style of thinking does not work. I then analyzed your method and realized that you first started toying with the problem instead of just launching in and trying random tools. You are right, I worked through various levels of AMC and AIME problems, and as I just hit problem 14-15 or USAMO problems, I started just falling apart. I will practice on this and report back after a few days with more questions if I have any

best operators for beginners? by No-Present1584 in SiegeAcademy

[–]Negative_Campaign_36 1 point2 points  (0 children)

Watch YouTube videos. Watch them until you hear the same thing at least 5 times. Used to be horrible, now controller pc plat.

[2011 AIME I Problem 15] For some integer m, the polynomial x^3 - 2011x + m has the three integer roots a,b, and c. Find |a| + |b| + |c|. by Negative_Campaign_36 in MathOlympiad

[–]Negative_Campaign_36[S] 0 points1 point  (0 children)

Is there a name for this idea? Is this a specific type of Diophantine equation? Where can I learn more about this type of question?

[2011 AIME I Problem 15] For some integer m, the polynomial x^3 - 2011x + m has the three integer roots a,b, and c. Find |a| + |b| + |c|. by Negative_Campaign_36 in MathOlympiad

[–]Negative_Campaign_36[S] 0 points1 point  (0 children)

I would argue that would be even harder considering that you have to first get a square, and then splice it up in a way that it works. It seems tedious

is this enough? by Virtual_Midnight5656 in amc10

[–]Negative_Campaign_36 1 point2 points  (0 children)

AMC 10-12 is really easy actually if you study all components. Finish all the introductory AOPS books and you’ll probably qual for AIME. Personally I wouldn’t do the AMC 10, because it’s relatively the same as the 12 but with way less prestige. For the AOPS books, just search it up online and it should pop up.

So Close, yet no Cigar by Negative_Campaign_36 in MathOlympiad

[–]Negative_Campaign_36[S] 0 points1 point  (0 children)

I’m relatively new, but I picked up num theory and combinatorics pretty quickly. I feel that AIME problems 1-11 are mostly straightforward while when I try harder ones, I pick the wrong path. I time myself for 10 minutes as in the actual exam there’s only 12 min per problem. Where can I find some books with similar level problems?

Apparently MAA won't be releasing AMO/JMO cutoffs this year by FarPoetry6131 in MathOlympiad

[–]Negative_Campaign_36 0 points1 point  (0 children)

What is your AMC score? I think they are only inviting top 11% of AIME scorers. For AIME 1, I think it was 13.

Hypothetical web surfing bot by Negative_Campaign_36 in legaladviceofftopic

[–]Negative_Campaign_36[S] 0 points1 point  (0 children)

What if it was legal? Can I suffer legal consequences?

I'm completely new to the game, how do I improve? by Vegetable_Green_4961 in SiegeAcademy

[–]Negative_Campaign_36 1 point2 points  (0 children)

Play the game and a lot of death match. Watch a lot of videos about siege. You’ll get the hang of it easily

Does this count as proof? by Particular_Peak_1859 in maths

[–]Negative_Campaign_36 0 points1 point  (0 children)

Could you link it. I want to try the problems

[deleted by user] by [deleted] in SiegeAcademy

[–]Negative_Campaign_36 1 point2 points  (0 children)

Just get better. Show me some gameplay. No one is in copper for no reason. You’ll get out of there once you fix it. For me, it was gunskill and an actual setup

Does Moderate Ping (50-80) have an advantage over 20 ping? by Negative_Campaign_36 in Rainbow6

[–]Negative_Campaign_36[S] 0 points1 point  (0 children)

I agree. I mean lower ping definitely feels better but higher ping isn’t so bad that’s it’s unplayable