#competition-math
1 messages Ā· Page 35 of 1
What step are you on?
1. I don't know where to begin.
2. I have begun but got stuck midway.
3. I got an answer but I was told that it's wrong.
4. I got an answer and would like my work checked.
5. I have a question about someone else's work/solution.
6. I have completed the problem and don't need help anymore. Thank you.
7. None of the above
Use the discriminant to get a condition relating a and b. The rest is standard geometric probability.
just doing practice tests were in fact enough for me
special right triangles are the main one, geometry has a lot of steps so I find solving past problems particularly useful in this subject - you'll see a lot of the same steps (forming special right triangles, finding area of circles based on inscribed triangles)
the problems won't map 1 to 1 but often the individual steps will, just in a different order
here's a list of formulas I've learned that help on AIME if you feel like you want to learn them, but I think the shoelace theorem is the only one that could even possibly help here
some of these aren't formulas just things I'm not extremely familiar with
Whyyy
I never did math counts and I think I'm the only one active lol
never did mathcounts either
||no way i got gold prize (aimo)||
-# ||even with just maximum 71 marks||
-# ||out of 150||
||
||
i just finished amc and i did so badš¢
aimo aint really that bad
iirc
wait final?
yep
oh i have no say in that then
set the two equations equal to each other, get everything to one side, use the quadratic formula, and look at the discriminant
this ends up turning into a geometry problem
i mean 1) AOPS has such a large database of problems that there's bound to be enough AIME difficulty problems and
- if you need more, then ur probably revising wrong
ur probably spending too much time on problems which are too easy for you
when ur nearing the end of ur AIME problem bank, you should start moving to easy olympiads
What is the answer?
surely it wasnt that bad
itās more fun if you find it yourself
Like where is it from because I wanna check my answer that's why
the answer is ||E. 61||
did u do amc?
oh... lol damn
jnr
dont worry man
if its hard for you it should be just as difficult for the others
considering you put in the effort

I need some exercises of algebra or pdf for preparation olympiad maths
ty
anyone have the source of the problem?
my answer is (1,1) (1,5) (5,1) for all pair (m,n)
yeah i know bro
i mean i have found the answer + proof
i want to check my answer
i want to check from the bulgarian math olympiad
since mont doesnt give solution
the furthest progress I've made is finding that:
$$
If we assign f(x) = 2^{2^x} + 1, then:
f(x) = ((f(x - 2))^2 + 1)((f(x - 2) - 2)^2 + 1) - 3
$$
yeah i gotta learn NT more deeply to have a chance against these types of problems
this is pure algebra, the field im somewhat good in
im learning this kind of problem too
yeah you are right
azart
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
Totally useless info but this expression can be simplified to $f(x) = (f(x - 2) - 1)^4 + 1$
azart

angelkiller411 on wordpress has a pdf of most bulgarian olympiad problems - regional and national. However many from Titu Andreescuās NT book which are referenced donāt appear
what
that's actually all the answer exist
the source is || BMO 2016 P1 of 6 ||
If I remembered correctly
?
Iām doing the Australian Math competition tomorrow and the shit inside that is hard as hell. So yeah wish me good luck lol
good luck
good luck mate
Does anyone know how difficult the regional stage of the All-Russian Math Olympiad is? Like how does it compare with other contests like USAJMO or BMO2
good luck, I like the number theory thing on AMO
amc isn't till november
emmmmmmm maybe diophantine , sequence , construction (number only)
Itās AMO P5 of 8
I am trying this BMO problem but I'm stuck. I have tried breaking the numbers down into digits and see what combinations can be done but it looks like this way may end in me having the brute force each way which im almost certain is the most efficient way for this. I have attached some of what i have done so far(the rest is just me trying cases with different numbers). Could someone give me a hint or suggest an alternative way of approaching this? Thanks!(The handwriting is a bit messy so if you want clarification on what i have written pls ask). Edit: I have also figured out that the squares which give 4 digits are between 32 and 99 if that helps
iāve got a solution for a question very similar
basically, consider calling the digits abcd = N in decimal form, then u know the other integer M=. some permutation of M= ab(c-1)(d-1) moving the minus 1 digits around
and u know they are both squares so u could say for the case i showed N= M-11, therefore as N,M are squares. p^2=q^2 - 11 and this is just a basic diophantine Eq
this is for ur case
omg gorgeous handwriting
r u being sarcastic
coz idk ive always thought it was mid on the bad side
no not sarcastic at all, that is very pretty
well organized, clean, comfy to look at
somehow the letters can be absolutely tiny and yet i can tell exactly what the word is from just a quick eyeball
a tiny tiny tiny tiny gripe is i wish the a's were closed on the top, they look a bit like u's
but id kill for handwriting like this
oh yeh i always do that
but tysm thatās so nice
hii! i was wondering if any of you guys have any methods that have worked for you when studying for the AMC10? I'm currently trying to lock in and pass (for i am not incredibly smart or anything, but need a tried & tested method that I can stick to until competition day)
Lmao I know nothing about number theory
doing their past exam , gathering content focus on your subject which you good at it..(in another word just doing exam non stop) �
okok thank you!
oh yeah that is very similar
ah that makes sense thank you, so after this you just need to solve the 6 dipohatine eqs then?
yeah but some of them clearly canāt work so it reduces it
Stop procrastinating math or you will be unemployed
Welcome to Learn with Christian Ekpo, this channel is your go-to destination for mastering math concepts, solving challenging problems, and discovering clever tricks to tackle Olympiad-level questionsāall without relying on a calculator.
Whether you're a student preparing for competitions, a math enthusiast, or someone who loves logical prob...
Tf is wrong with this guy?
What is a 174M as the answer
This is why we don't use self imposed brackets
8āø . 8 - 1 cannot be 8āø. (8 - 1)
this is what passes as āolympiadā these days? š
How do you evaluate markov chains?
I suck at this already lol
they're saying this was the hidden question 7 on the imo
YouTube commenters are brilliant man
bro he just keeps playing with the exponents he's not actually simplifying any of the calculations lmfao
hi could anyone help me w this
what i tried:
since im only looking for the first non zero digit, i'm ignoring any 0s after the first non-zero digit and ignoring any digits before the first non-zero digit
then i got
= (2 x 3 x 4 x 5 x 6 x 7 x 8 x 9)^5 x 20 x 30 x 40 x 50
then i got rid of all the 10s
= (2 x 5)^5 x (3 x 4 x 6 x 7 x 8 x 9)^5 x 20 x 30 x 40 x 50
= (3 x 4 x 6 x 7 x 8 x 9)^5 x 2 x 3 x 4 x 5
= (3 x 4 x 6 x 7 x 8 x 9)^5 x 3 x 4
since x^5 has x as it's ones digit, i just got rid of the power since i only care about the ones digit
= 3 x 4 x 6 x 7 x 8 x 9 x 3 x 4
the last digit of the above number is 6 and that's what i got as my answer
but thats not the answer so ive been stuck
(11)(12)(13)(14)ā¦(19) doesnāt have the same last digit as (1)(2)(3)ā¦(9) (and etc) for one
,w 19!/10!
,w 9!
oh
oh i get it now
the multiples of 5 cause the change
5 15 25 35 45
Problem #2 (vertices)
this is what i have (updated):
Notice that all the points are part of one big web
There are three subsets of the vertices: The first one has vertice 1 (call this S1), the second has vertice 2 to 511 (call this S2), the third one has vertices 512 to 1023 (call this S3).
We can break up the second subset into more subsets: The first has vertices 2-3 (call this SS1), the second has vertices 4-255 (call this SS2), the third has vertices 256-511 (call this SS3).
In SS1, there is one endpoint in S1 and two in S2. In SS2, there are three endpoints in SS2. In SS3, there is one endpoint in S2 and two endpoints in S3.
There are six methods of deletion:
Delete 1 edge that is S1-SS1 and 1 that is SS1-SS2. (+1 of degree 1)
Delete 1 SS2-SS1 and 1 SS2-SS2 (+1 of degree 1)
Delete 2 SS2-SS2 (+1 of degree 1)
Delete 1 SS2-SS2 and 1 SS2-SS3 (+1 of degree 1)
Delete 1 SS2-SS3 and 1 SS3-S3 (+1 of degree 1)
Delete two SS3-S3 (-1 of degree 1)
The current place I am stuck on is calculating the probabilites of each amount of vertices of degree 1. Also, I think it would be helpful to establish an upper and lower bound, but I'm also not sure how to do that. All help is appreciated! Thank you
Iām so smart I can solve an olympiad problem in under a minute š
it seems to work on youtube
gets more views and stuff
i couldnt come up with a really "mathematical" way to solve it but, just in case, you're interested, here is a recursive programm solution:
def last_nonzero_digit(n):
if n <= 1: return 1
return 6 * [1, 1, 2, 6, 4, 4, 4, 8, 4, 6][n%10] * 3**(n//5%4) * last_nonzero_digit(n//5) % 10
with an input 50, it returns 2
thanks
You drop all 10s
And then find it module 10
Well, I just tried, and got 2, it didn't take me more than 5 mins
It simplifies fast
you can easily cross all but 1 6 immediately (as 6 x 6 = 6 mod 10) after removing 10s
all pairs of 2 and 3 too, if there's at least one 6 (as, well, 2 x 3 = 6, and we can drop it)
by the same logic all pairs of 4 and 9s
and speaking of 9s, all pairs of 9 can be dropped too, as 9 x 9 = 1 mod 10
and so on
is there really not a faster way to solve this lol
Fr just thinking the same thing š
Well
If you actually think about it a bit more
The product
x1 x2 x3 x4 x5 x6 x7 x8 x9 (x+1)0
Can be turned into:
1 2 3 4 5 6 7 8 9 x+1 for odd x and X=0
1 2 3 4 5 5 6 7 8 9 x+1 for even
And these are equivalent to 8 (x+1) and 4 (x+1) respectively
So
For 50!
Itās 8 1 8 2 4 3 8 4 6
Or
2
Yeah, you can add and subtract ln(3^(1/n) -1)/(2^(1/n) -1))
And (x-1)(x+1) = x^2 - 1
So, the infinite product collapses into 2
no, there is a mistake in the last limit
Where exactly?
it's not 0
Oh, i see
I cant find the answer to this question so was hoping if someone could see if they get the same answer as me. I got 1996/1997.
write the same thing for f(n-1) and subtract, to eliminate that sum f(1)+...+f(n-1). Then you get a very easy thing, which is ||f(n)=2f(1)/(n(n+1))||
does anyone know how to solve this problem using graph theory?
currently i have that we start with a complete graph from 5 vertices. an edge represents a friendship between two people and the absence of an edge means that two people are not freinds.
i've been told there are three "isomorphic states", but idk what to do with this information let alone find the number of vertices/edges in the "isomorphic state"
i got 2/1997?
i have working out
not sure if this is the quickest way to arrive at āthe answerā (probably wrong anyways) but the q looked too interesting, had to give it a go
could someone look over it please š„¹ š
What is the 4th root of -1?
the principal 4th root is probably just $e^{\pi i/4}?$
elrichardo1337
any AMC10 tips? also can someone explain mass points, I get the concept but I still need some further research
Let's try and solve this
First we rewrite 4thsqroot of -1 as (-1)^ 1/4
We know that i² = -1
So, (i²)^1/4
I.e. i^2 Ć 1/4 = i^2/4 = i^1/2
think seesaws
Rewrite i^1/2 as sqroot i
...
are you familiar with polar/exponential form for complex numbers
We know that sqroot i = a + bi
One of the many forms of sqroot i
Squaring both sides we get i = (a + bi)²
what if it were -i?
seesaws?
imagine you're on a playground with a weird seesaw whose fulcrum is not right at the center
guys predict of amc10a or amc10b will be harder this year -
let's say it's like uh 2/3 of the way from one end to the other
you sit on the end farther away from the fulcrum
what weight do you have to put on the other end to balance it?
twice your own weight
ok but how do you use it in problems š
That's something like what we are solving here right now
and how do you assign lengths weights? is it corresponding to adjacent points??
ratios of lengths when you otherwise can't apply the other stuff like similarity/etc easily
Now expand the bracket (a + bi)²
oh
We get: a² + (bi)² + 2abi
So, a² + b²i² + 2abi = i
here's a handout MATHCOUNTS put out a couple years ago
these are the kinds of problems (among others) that you can solve with mass points that would otherwise be pretty gnarly to solve
We know that i² = -1
thanks
So a² - b² + 2abi = i
Can we write this as
a² - b² + 2abi = 0 + i?
This doesn't change the equation
Now we can solve by parts
a² - b² = 0, 2abi = i
Solving for 2abi = i, we get 2ab = 1
To find b, we get b = 1/(2a)
Substituting 1/(2a) into equation a² - b² = 0,
a² - {1/(2a)}² = 0
We get that, a² - 1/ (4a²) = 0
a² = 1/(4a²)
Therefore, 4aā“ = 1 => aā“ = 1/4
Taking square root of both sides
a² = 1/2
Again, a = 1/ sqroot 2
Rationalizing the denominator, we get sqroot 2/ 2
Or better still let's leave it at 1/ sqroot 2
So b = 1 Ć· 2a right?
Substituting the value of a we have , b = 1 Ć· 2 (1 / sqroot 2)
Can we write 2 as the product of sqroot 2 and sqroot 2?
A sqroot 2 cancels out the sqroot 2 in the denominator. We get that b = 1 Ć· sqroot 2 Ć 1/1
This means that b = 1/ (sqroot 2)
Now we know that both a and b is 1/(sqroot 2)
Substituting these values into the equation a + bi = i, we have
1/ (sqroot 2) + 1/(sqroot 2) Ć i = i
This means
1/ (sqroot 2) + i/ (sqroot 2) = i
Not equals to i sorry, equals to the fourth power of -i
And we are done! Simplify it further if you want
We can say that sqroot 2 + i sqroot 2 = sqroot -i
,rotate
@pallid tundra so this is the answer to your question
magnitudes dont match up
Oh I see
It's because we used 2 real numbers that weren't part of the question
And multiplying a negative number 4 times will never result in a negative number
So technically, the fourth root of -i does not exist!
I did more research and found that we can actually find the fourth root of -I using Polar forms
there are 4 fourth roots but yes thatās the method
A complex number z = a + bi can be written in polar form as z = r(cos(theta) + i sin (theta)) where r = sqrt{a²+ b²} is the magnitude and theta is the angle.
For z = -i, we have a=0 and b=-1.
The magnitude is r = sqrt{0² + (-1)²} = sqrt{1} = 1.
The angle is theta = arctan (-1 /0), which lies on the negative imaginary axis, so theta = - pi/ 2 radians or 270°
Therefore, -i = 1 (cos (- pi/2) + i sin (- pi/2 ) ).
bruh are you using AI
For research purposes so yes
quicker imo to write as -i = e^(-iĻ/2 + i2Ļn), n ā {0, 1, 2, 3} then find the 4th root that way
and wtf are you talking about...
Hey AI, wtf are you talking about?
??
Competition math is scary fiys
guys
@half mulch, are you in competition math?
I want to get a sense of what to learn for this
like tricks and all that
Thatās not what it is
!nogpt
Please do not trust ChatGPT or similar AI tools for mathematical tasks, as they often generate output which "sounds correct" but has numerous factual or logical errors. Use of these AI tools to answer other people's help questions is strictly against server rules (see #rules).
Can you explain to me what they are?
low level problems might seem like theyāre all gimmicks
but theyāre really not for the most part once youāve really solidly learned your basics
I think the same could be true for all levels but there are good problems in any case
no.
basically all high school contests are no calculus for example
but that doesnāt mean you canāt still write some really crazy problems
the point is the problems are actually nontrivial unlike what youd see in a typical math class
u can also learn similar types of math without as much of the competition aspect
Or in something like USAMTS
while it is kinda true that the low level contests (in the US, this includes MATHCOUNTS, AMCs, etc) are more focused on computational speed
that becomes less true the higher you go
all Olympiads at the national level are proof based
heh, imagine the folks that already know how to write somewhat decent proofs
also, what's the age limit to enter a national math olympiad?
Is it actually worth it?
all the major Olympiads are for high schoolers
to actually qualify for one is usually pretty hard tho
What if I dropped out of high school
youād have to go look at each individual contestās eligibility rules
well, I guess I'll be preparing till then
idk
my fav one does calc!
I do one called mu alpha theta
but the common route you'll see
is amc, aime, usamo, imo
u should defo take the amc
^in the US
this one has crazy calculus and analysis
and it's for highschoolers
MA\theta has analysis??
oh huh
well kinda
this question is from this year
I'll be learning and learning and learning and learning and learning...
but I've seen questions using stolz cesaro, Abels theorem
even residue theorem
those are crazy
Any graduate level math?
they try to teach it to you before the question
nah not really
Well, it's still a challenge fs
here's a crazy looking one
I'm also studying this year to make usamo
lowkey gonna be a stretch tho
I am not sure if I want to enter those
does ur school have a mu alpha theta team
no, I don't go to school
I dropped out of hs
not in the way you might be thinking...
I'm curious
damn. I dont start see integrals, i“m in derivates
I can send you an invite
am I a young mathemmatician
yes
there aren't many people in there, but there are 11- 15-year-olds with upper undergraduate to graduate level math
11 year olds
and olympiad medalists
yes
yes
uh excuse my language
they just started young
like
there are only two of those
yeah
br
a 12-year-old learning arithmetic geometry lol
I'm 17 and I'm still at mid undergraduate
That's really nice
u mean algebraic?
nope
what is arithmetic geometry
uhh
oh gosh
wait like
u learn all ts stuff
but can u solve problems with them?
or they I guess
Yeah, sure
like are they actually good at arithmetic geometry
we are still organizing the group
no, only one of them just got started on it
okay that makes me feel a bit better about myself
are any of them good at integration bee
yeah
yeah fs
I can teach them a thing or 2
I sent u a friend req
I gotta sleep now
night night
That looks correct i think, I got the same function f(n)/f(n-1)=n-1/n+1 but i didnt do the cancelling out which you did after, idk why i just thought that it would boil down to just f(1)/n+1 cause i kept subbing in f(n-1) over and over like a recurrence equation and it seemed it would all just cancel out to f(1) but yh your method seems better and easier to understant asw
Can anyone help me study for a trig test dm me I need help lol
Oh I see
How difficult would you say that question is as a competition problem?
If you know
Apparently you can just solve it by listing a few terms..
Hi
ur 17 in undergrad?
when did u start lol
Hi
try considering the harmonic sum
I'm tempted to say just approximate it as 1-ln(2)
but I don't think that's rigorous
and that's probably outside the scope of the solution
hi
did you really have to use 1-ln(x) then x=2?
yes. yes i did
also guess what?
its less than 2/5
lmfao
can u actually use stuff like that in proof based math like usamo
I assume this is like a usamo question
No
just brains š¼
That's for usamo
I'm tempted to say u can integrate this
and then prove that the integral is greater than the sum
but there would be a problem if the integral is >2/5
nvm idk what to do with the neg terms
you can write it as
1/(2 * 3)+1/(4 * 5)+1/(6 * 7)+... which is less than
1/6+[1/(3 * 5)+1/(5 * 7) +...]
The sum in brackets telescopes, and you get
1/6+ 1/2 * [1/3-1/5+1/5-1/7+...]<1/6+1/6=1/3<2/5
This definitely isnt a usamo problem
too easy to be a USAMO question lmao
yeah
I need to master algebra, number theory, combinatorics, geometry and trigonometry.
I will study and do MO problems
I need to do well on AMC10. does anyone have tips
Well, I would suggest doing more Mock Tests (in the given time), Practice Exams..... Also, mastering with the AoPS Volume 1 and Intro Books (Alg, Combo, NT, Geo), and maybe doing some Alcumus Problems?
Guys does anyone know a good resource and yt channel for Number theory for IOQM
I would be really grateful for any help
is this time of year when i should start getting ready for mathcounts/amc8 or can i wait a few weeks until the club starts
Never hurts to start early
Especially because stronger competitors with a deeper math background who are experienced with these kind of contests still practice a lot despite already being "good"
But don't practice for the sake of competing. You should do it mainly because you just genuinely enjoy doing math in your free time š
Ok so I have done all the mock tests up to 2014 and I am planning to do all of them before november. I have done the AoPS volume 1 and all intro books plus inter. algebra and inter. count/prob. (I am working on precalc now) However, I still have a lil trouble doing some of the solid geometry problems, and some combo problems.
also I am going into 7th grade is that late, or... ?
honestly mathcounts is not too bad if your goal is states and beyond. I'd just say do a lot of practice tests, to get into states you maybe have to score 40+, so a split of 27-28 on sprint and 12+ on target should be fine š
got it
I think we have a future Mathcounts finalist on our hands /jk
I need to make AIME this year š
u got it
Oh wow, you must be prepared then! I guess maybe recap the important concepts?
Same!
No, I won't do annoying high school problems just to prove that I like math
not doing them in your free time has nothing to do with not liking math.
it was a british math olympiad round 1 problem so it is difficult but it seems much on the easier side, Im actually quite new to math olympiads and so far this is the one i have actually been able to make progress relatively quickly, most times i spend an hour just stuck on 1 part so yh
Oh I mean yeah, you don't have to do anything to "prove" you like math.
Yeah, I agree with you.
If you don't like competition math, no need to do it. However, the question was asking about specifically preparing for a math contest to begin with... So the assumption is that they are interested in doing math contests in conjunction with liking math. I just was stating that you should of course be doing these contests/training for them because you simply love doing the math (i.e. this kind of math puzzling/flavor of math contests) over the glamour of "winning."
Ah, I see. I donāt really do Olympiad problems either, I just watch them get solved, but this one actually looked doable. Are you from the UK too?
yh same, thought I would start to get into them tho so i could see if i can qualify for BMO1 this year
got a bronze in the senior maths challenge last year so it is gonna be quite a turn aroundš
Same š
It was at the start of the year tho, I was much much slower than I am now
Iām sure if I retook it I would do a lot better
I am still at my humble beginnings
Canāt you take BMO1 even if you didnāt qualify? I heard you just have to pay an extra fee or something
yh you can but it would probs look much better to universities if you got a certificate of qualification for BMO instead of participation
Ye true
you in year 13?
you're too nice
š„¹
Ye same
Mathcounts is goated
Not for the competition but for the experience
If you put in the work and make it to nationals
Its very great experience
missed nats by a single point on my last chance bc I sillied literally the first question on state sprint š
fun times
is it still being worked on? i did well on a mock test and it lowered my rating š
I've been working on a problem where I was supposed to find the exact value of this sum when x = 6 without a calculator, and I found that it was equal to 221/8. After I was able to find solutions for x = 2 and x = 4, being 89/2 and 133/4 respectively. Are all solutions of this sum when x is even rational? After plugging x = 8 through 20, I found that it seems to be the case, but does it generalize to all even natural numbers?
Yes, sure. sin^2(t)=(1-cos(2t))/2. So raising this to x/2 power and using binomial we get sums over k=1..89 of the type cos(pi * x * k/90), where x is an integer. There is a well known formula for this
(x is not a multiple of 180). By putting N=89 we see that the thing is always rational.
Definition: Īn = 1 + 2 + 3 + ... + n (n ā ā). Ī0 = 0.
Question: Prove that, āN ā ā, there exists a way to represent N as, N = Īi + Īj + Īk. (i, j, k are all non-negative integers)
This is a well known result https://math.stackexchange.com/questions/1028404/why-is-every-positive-integer-the-sum-of-3-triangular-numbers
It is reduced to Legendre's three square theorem https://en.wikipedia.org/wiki/Legendre's_three-square_theorem
im NOT making a 240 cutoff jmo š
this uni olympiads?
idk
240 is insane lmfao
what are you in at the moment?
I've graduated from all I could š
wow good for you bro š
does anyone have advice for USAMO? I average 130s for the AMC 12 and a 11-12 for the AIME, but I get 0s on the USAMO bc i cant do proofs
like cant do proofs for the life of me
and my parents keep telling me its sus i cant do usamo proofs š
I need to make
or else what
then he doesn't make jmo š
I cry
Thanks!
It's a high school level bonus problem.
orz orz orz
130 on AMC 12 and 11-12 on AIME is really good, in fact if u have $900 to spare try AOPS WOOT program.
youāll learn proofs from there
you can probably sign up for level 2
i dont have the money to spare sadly
a lot of IMO medalist and USA(J)MO perfect scorers used WOOT
aww š
š
well rip
i rlly dont think i can even partial score
and the average score is like 1 and 1/2 score
bruh
you could probably try to do a very old USAMO test and like try 3 problems at a time for 3 hours. then if you give up, read the solution
Ahh alright
thanks for the advice
Hopefully it works if u still have a month till school u should probably make a schedule
Yeah, I started studying for like 3 hours everyday since june
š
u got this!!
well im done for then xDD
hwy guys what are the best mathematics competetions that are currently opened for high schoolers
Hi, I think you can check out these websites from AoPS for more information about open contests: https://artofproblemsolving.com/wiki/index.php/List_of_United_States_high_school_mathematics_competitions https://artofproblemsolving.com/wiki/index.php/List_of_Canada_mathematics_competitions
ty man i wish i can improve my cv with those
yes ofc
what are some maths competitions i can join (i live in scotland, am 15) & how best can i study for them
already do the SMC & UKMT
You can probably see if there's enough interest to make a team for the Senior Team Maths Challenge
I'm a year too young for that (S4), but thanks
ah shet you right
Wait, to clarify, you've started (or about to start) S4, right?
(also technically, the SMC is the UKMT)
about to start (in two days help)
ohh sorry
i mean the scottish mathematical challenge
didnt realize it has the same initials as senior mathematical challenge
ohhhh
you mean this? https://www.wpr3.co.uk/MC/
(whose webpage looks like it hasn't changed in 20 years wtf)
well top 6 out of 60 people i think
i know someone who made mop in both freshman and junior year (gonna be a senior now) but no imo
i think its a very big jump
as are all stages of the amc route
I think the gap between MOP and IMO is going from scoring around 15ā25 on the USAMO to scoring 35ā42, plus ranking in the top 6 after mastering the TSTST and TSTs. Itās still a big gap in between in think. However in general the jump from MOP to IMO is generally bigger than from USAMO to MOP, as it shifts from national to world-class competition
yea lol
Now what's this
wtf is that in your pronouns?
i don't think that's allowed?
<@&268886789983436800>
moderators???
supermute lmao
bro got banned ā ļø
How do you do this Q?I got tan36 but the answer was || tan54||. I tried using the fact you can make an isosceles triangle with sides length 2 and r but that got me a sin value of r instead of tan. I have tried using basic sohcahtoa but that didn't work
I tried using the fact you can make an isosceles triangle with sides length 2 and r
That would be true if the cords RS, ST, etc. had length 2, but they don't -- they're not diameters in the circles. Instead I would consider this triangle:
Did anyone here had the chance to compete in the IMC
International math competition
the imc is different
The one for undergrads?
im sure some uni students here have competed in the imc before
yep
I see
really? I find a week to be plenty of time to learn limits at a beginner level
theyāre pretty intuitive
its because its ap calc BC 2 semestars of college calculus and we are supposed to move hella fast
i am just struggling with like finding the limit using graphs
its throwing me off a lil
but like algebrically i can
Nah not the imo
thanks, i just found out i misread the question, looks a lot easier now
Is my solution along the lines of what the question is asking? I cant find any published solutions so not really sure if this is correct or where i went wrong
I cannot follow everything you're doing, but it definitely looks wrong that you're suddenly assuming n²(n²+16) = 720I out of the blue (which was what you were supposed to prove) and deriving consequences from that. Doing that can be a useful way of exploring the question for yourself, but it doesn't belong in a written-down proof.
cool, could you give me a hint on what to do instead?
only thing i am sure of is that n must be a multiple of 6 right?
I would structure it something like:
Suppose n-1 and n+1 are both prime.
Then n must be divisible by 6 because (bla bla bla). So n² is a multiple of 36, and n²+16 is a multiple of 4. These two facts make n²(n²+16) a multiple of 36·4 = 144 = 720/5. In order for it to be a multiple of 720, either n² or (n²+16) needs to be a multiple of 5 too.
Now split into cases according to the remainder of n modulo 5:
n == 1 (mod 5) or n == 4 (mod 5) are impossible (bla bla bla).
If n == 0 (mod 5) then (bla bla bla)
If n == 2 (mod 5) or n == 3 (mod 5), then (bla bla bla)
Your answer to "is the converse true?" seems sound.
(The math-hipster approach here would be: Because of Dirichlet's theorem on primes in arithmetical progressions, there is a prime of the form 720k+1. But of course n=720k satisfies 720 | n²(n²+16).)
i understand up to the modulo part. why is it n instead of n^2 for modulo 5?
interesting!
You need to be looking at n itself in order to use the assumption "n-1 and n+1 are prime" to exclude the cases n == 1 and n == 4.
(Each case for n mod 5 lets you compute n² mod 5 next, of course).
so after finding the cases of n mod 5 which are valid would you try to find what multiples n must be to give those remainders from modulo 5?
then would that give you a formula for all n terms with n-1 and n+1 being prime?
No, in each case I would simply look for proof it n is such-and-such modulo 5, then 5 | n²(n²+16).
You don't need to find n. Just to prove that whatever n is, then as long as the other assumptions hold, 720 | n²(n²+16) will be true.
Whoops my hipster solution was horribly backwards and doesn't actually work.
Better hipster solution: Because of the Chinese Remainder Theorem there exists an n such that n == 0 (mod 720) and n == 1 (mod 7). Then n-1 is divisible by 7 and so cannot be prime, but n²(...) is still divisible by 720.
ok, why can we not just find what multiples of n allow you to factorise 720 out of the equation such that whatever integer n is, n-1 and n+1 being prime along with 720 | n^2(n^2+16) are satisfied. Though, i feel like this sounds a little similar to what you said about just prove whatever n is it is divisible.
Because you do not know when you start the proof that 720 divides n²(n²+16).
That is the thing you need to prove.
so how would you prove 720| n^2(n^2+16) for each of the valid cases of n modulo 5 whatever n is, I see how it works with n modulo 5 being 0 cause then you have (56n)^2((56n)^2 + 16) then you can factor out the prime factorisation of 720 but correct me if i am wrong, i dont think you can do that with the cases of n modulo 5 being 2 and 3
Hint: In those two cases, compute n²+16 modulo 5.
Yes.
ok that makes sense, then you can just show that it is a multiple of 720, thanks!
Yeah but still
Ok sure. If for example you take continuity for granted a lot of the time
just write p1 = 6k + 1 and p2 = 6k - 1
solution is then straightforward.
ok I see you have used 6k, you can prove 9k² + 4 is always divisible by 5
let k be 5s + 1, but it back into the p1 and p2, you will see one of them is divisble by 5, making k = 5s + 1 invalid, same for 5s + 4.
the other three are perfectly valid, i.e k = 5s, 5s + 2, 5s + 3
so any prime will be of form of k = 5s, 5s + 2, 5s + 3
which makes 9k² + 4 divisble by 5, or k² divisble by 5
yo anyone got any good lectures for number theory? need it, preparing for olympiad
thank you!
i tried recalling what we discussed, i am trying to learn the chinese remainder theorem but i havent added it here for the converse but i think my contradiction by using 48 was good. Does this look along the lines of what the solution should be?
In case 2 and 3, it looks you're substituting 2 or 3 mod 5 into 3²·2^4·R²·(9R²+4) -- but they should just be the n in n²(n²+16).
E.g. for case 2, even if you want to be very specific, you can just say
If n = 5p+2, then n² = 25p² + 20p + 4, and then n² + 16 = 25p² + 20p + 20, which is clearly divisible by 5. So n²(n²+16) will be divisible by 5 too.
looks okay but your write up could be better
also as tropo points out here, you actually only need to analyse n^2+16 for the other cases
i'd phrase it like this: "to prove n^2(n^2+16) is a multiple of 720, it suffices to prove it is divisible by 2^4, 3^2 and 5"
(do your stuff with n must be a multiple of 6), so n^2(n^2+16) is always divisible by 2^4 and 3^2
now we show it is always divisible by 5
if n is divisible by 5 then we are done, otherwise (do your stuff with n is 2 more/less than a multiple of 5)
(btw you can often combine cases like these together by doing like 5k+-2)
"Is the converse true" is actually a wild question to even be asking
Like you must have learned about primes yesterday if that's a question you can even imagine to ask expect to not have a negative answer
In particular, it means that every number of the form 60m±1 is prime, which means pi(n) = O(n), which contadicts the prime number theorem Q.E.D.
what should i do to prepare for amc 10 (i dont know much number theory and im not the best at combinatorics, but i think i should be fine on most of the alg and geom in it)
True, but this is the BMO - at this point, answering "no" is insufficient; you have to prove this, either by how you've done it or by CE (as hawklo did)
amc 10 is kinda ez, you must study nt and combi ig
a little gisp
js use aops for problems
hey anyone giving IOQM
Yes, probably
Iām trying to self learn AOPS but I find it kind of hard to understand some of their solutions or strategies
I have volume 1
Any tips to help, I am also studying for AMC 10
volume 1 is sort of like a quick summary
its not as deep as if you grabbed like intro to algebra, intro to geometry, etc
its for sure not enough practice problems if youre not already super comfortable
i definitely recommend grabbing the entire introduction set of books if that is an option
if not, youll have to find other sources, perhaps their website, and work your way through a checklist of things
in the meantime, if there is anything in particular you are stuck on, you can use help like this discord and ask in the proper channels, free and limitless
true
me
do take help from chatgpt too but chatgpt is unreliable and is not a math tool, and will frequently give you results that look right but are not
if you dont understand once counter ask them at least 3-4 times , if you still dont understand you need a pro teacher
might take help from your maths teacher in school
sometimes guys on yt have posted solutions , you can check them out (that's all I can tell you from my side as I use these techniques )
or people are here too
do NOT take math help from chatgpt
I do confirm the answers
chatgpt is unreliable and is not a math tool, and will frequently give you results that look right but are not
I know, I match them with solutions
was this from a spammer or from this conversation
spammer
oh ok
[ping dealt with] <@&268886789983436800>
you don't have to delete the ping
we will just give it a thumbsup
yeah you check your answers, but then 1. why aren't you just using a math engine in the first place and 2. that doesn't mean you should recommend it to someone who may not have literacy in either AI usage or math
if someone is struggling with concepts pre-AMC 10 then they are likely not mathematically mature enough to verify solutions on their own
you dont need it, dont touch chatgpt
š
huh
loll
?
XD
?
but the problem is i dont rly know number theory, where can i learn it, also its been so long since i did combinatorics so i dont remember much and my teacher had a thick russian accent
youtube has alot of basic number theory principles
prime newtons, michael penn dive in depth into it
ok ty
Hey tommorow , i asked for IOQM , guy replied , is he here ?
sowy
hey @remote light
yo
ah hi
Hey when you started your Ioqm prep
1 month ago (the real one) before that I was just focusing on the basics
to be exact 29 days ago
Yo i started on june š
but i am more focused on other things
Coding
python , basic js
ohk
Bro which class
10
Same here
if ur learning js then u must have learnt html and css
oh gr8
Yes , basic stuff of html and css
ok
Bro IOQM topic , is more pain in the neck ( but i enjoy everything)
hmm
have you completed your syllabus?
I guess, I have but need to work upon problem solving
IOQM don't have a syllabus , logic is everything
it definitely has and logic is an integral part of it
except calculus everything is there of high school maths
but yes , you should now the basic stuff
Algebra, combi.nt and geometry
bro you studies calculas ?
nope
it aint a part
ill do it in the next grade
obv I have done basics for 11th physics
ok great , it's great , its your choice
have u done?
Yes š
DAMN
Bro it's actually very easy
hmm
More than Geometry ā ļø
Yes\
Ioqm doesn't even has calculus tho
Jee , no
it doesn't have synthetic geometry
ye
good luck
i am addicted to geo but i am degenerating
into a degenerate triangle
thank you
i cant even see some trivial G2 shit
lol
But yeah , i tell's about different ideas
which olympiad will you give this year?
give?
the name
the major one finished and i kinda died
smo
oh
singapore math oly
sasmo
senior ?
no
is lower
thats small olympiad
ye
smo is the main
coaching ?
anyway gtg go geom bye
It exists in India only
coz the schools dont care about olympiads
I am asking to youš
oh , I am self study guy
you flex in front of someone ?
like they cant even complete the syllabus
in what terms?
ā ļø
No , about being different
Actions speak louder than words
I also don't , but sometimes , when i diidn't complete my school notes school teacher , and she ask's about " what you were doing ?"
i don't even flex but still ā ļø
I ignore them, they just keep following us like simps
but they also want the development of us
in academics
I gotta handle that calmly
yeah you are right
i regret a lot for my words š
oh yeah always on fire š„
come on dm, Ill send
That is possible, but Iām studying for AMC 10, so how could I study all 4 intro books before the competition on November 12th??
I guess maybe review the most important concepts from each book (you don't have to do all of the problems, just the ones you think that are important/could appear on AMC 10).
oh i didnt have this context
you dont, you just grind and do your best
its not realistic to learn all of that by the time the test rolls around
just do what you can
how much was aime qual for amc 10 last year
The AIME floor cutoffs for AMC10 were 94.5 for AMC10a and 105 for AMC10b
Any predictions about amc 10? I feel like thereās gonna be more geometry
There were very few geometry problems last year
fr
there might be a tonna aritmetic
Could someone explain permutations and combinations for me and give me some problems?
do you know stars and bars
its pretty intuitive
No
want an explanation?
Ye
okay
so
the original question
is how many distinct ways we can put 8 balls into 4 baskets
I'll just start there
so we can draw this out
we're gonna use lines to divide the balls and represent the baskets
so one such case would be
oo |oo |oo | oo
this would be like 2 balls in every basket
another could be
Ik
oo |ooo |ooo|
which leaves one basket empty
but anyay
anyway
the trick comes in
when u realize
you always have the same number of o's and |'s
you're just rearranging them
so in total
there are 8 balls and 3 lines
so 11 total spaces
and we pick 3 of them to be lines
the ways to do this
is 11 choose 3
which is like
165 I think?
idk
wait preface
you know how to use the choose function and what it represents right?
No
Are you sure this is combination and permutations?
ya
Isnāt it like factorials?
factorials are a super important part to combinations and permutations
n! represents the number of ways u can arrange n distinct objects
okay okay
back to the choose function
let's say we had
uhh
7 distinct rocks
and we wanted to know how many ways we can pick 3 of them
7 options for the first rock
then we pick that up
then 6 options for the second rock
then 5 options for the last rock
but right
the order we pick them up doesn't matter
so we gotta account for thag
so we have to divide off what fraction of the ways would be over counting
because when we pick up those 3
no matter what order we picked them up in
we still got the same 3 rocks
so essentially
we wanna know how many ways we could order 3 rocks
which is 3!
cuz 3 options for the first rock
2 options for the 2nd
and one for the last
combining this all
the ways to pick up 3 rocks from 7
is 7(6)(5)/3(2)(1)
notation wise
usually you see the choose function in a different form
this can be found by multiplying the top and bottom by 4! (in general its (n-k)!)
which gets you n! / k!(n-k!)
i know
but i had a question
its on mhy aops homework
u see, i took an aops mathcounts/amc 8 basics
do u understand that
and it was going fine until we hit permutations/combinations
š
I'm a bad teacher mb
here is a problem
u already knew the intuition for choose function
How many equilateral triangles in the plane have two vertices in the set ${(0, 0), (0, 1), (1, 0), (1, 1)}$
Critical Peak
Ohhh thatās a really smart idea, thanks a lot š
lol ok
but is that necessary
drawing it is a good first step for combinatorics
i think we can just use cases
I mean yeah
what
is the answer 12?
preciselhy
do u want an explanation
but this is off topic
For each choice of two points in the set, there's exacly two places we can put a third point to make an equilateral triangle.
yaa
whenever i type "y" it makes it"hy" on my keyboard
true
lmao what
hm
but i need help so bad
Is it a laptop with integrated keyboard?
idk
are u on a laptop
correct
what is that
like the program that let's ur keyboard work
where is it
I'm not sure abt mac
whhy is trophospher tyhping forever
My guess would be there's an electrical problem in the keyboard itself (such as corroded or shorted traces). I've had several (external) keyboards fail on me with similar symptoms over the years. It's not really feasible to repair other than replacing the keyboard. Some laptop designs are modular enough to swap out the keyboard with a spare part (if you can get one or it's under warranty) -- in other cases it's the end-of-life for the entire laptop unless you take to always using it with an external keyboard.
Sorry.
Mac probably cant
Examples?
idk
I think he meant algebra
What are prerequisites to START this type of stuff?
I do this math competition every year, do pretty well without studying. I was thinking of actually trying to study so I can steal first place. This competition seemed to have advanced high school math like proofs, trig, probability, statistics, geometry, and algebra. But it doesnāt have calculus from my research.
Are there any resources to practice and better myself in these math areas? Any tips and tricks?
If you for some reason want to research this competition its the SCSU Math Contest and i will competing against 11th graders. They have previous years tests on their website which I will be using as a resource but would appreciate better resources.
Thank you.
Thereās no better prep than doing every old test you come across. Additionally, set a timer, if applicable. Get as close as you can to simulating testing environment
Load past exams into an AI and have it generate more.
As you do them, youāll know which areas you need help in. Then Iād double back and ask for resources on those subjects.
Also this is a wonderful resource for general formulas that you should have memorized.
https://cdn.artofproblemsolving.com/attachments/9/0/0e7904bb539cd6056457058f60d7a1c7864bb8.pdf
probably going to find limited use throwing problems at an AI, because the AI solutions might not be correct and you might not know
i wouldnt waste time here getting stuck into dead ends, there are enough human-curated problems on the internet
LLMs are really bad at math, dont bother
I asked ChatGPT for a list of the most important things to study in all four AOPS intro books, is it a reliable source?
I donāt have enough time since studying for AMC 10 in November
what did it tell you
3 months is plenty imo
if u work consistently and learn everyday
how do I get good at geometry
do egmo
done most of that
do plenty of problems
thats good do more
I can never remember Miquel point stuff
Iām not doing the bash chapters
i think if you do a good number of problems using miquel properties then it will become more ingrained in your brain
the bash chapters are sometimes pretty useful
good tool to have in your pocket
in case you cant think of a synth solution
