#competition-math
1 messages · Page 29 of 1
Oh, I'm doing it for year 10
Hello
nope
im in year 7 so im just starting junior
oh wow
are you living in the US @deep field
In year 7, I found it quite easy. Many questions are in multi choice, and the test progressively gets more challenging.
nope
im talking about australian math competition
same acronym thouygh
i see
i struggled a bit with the practice questions tho lol
so youre australian?
considering it was 2014 i can only assume it'll be harder this year
yeah ig
Would you like me to send you more recent tests?
yes pls
so wait, im having some problems in the competition now
that would be super duper kind
i need some helps
nope
im trying tranlaste the ques into eng now
is it 7th grade math?
This is a past test for juniours (so year 7 and 8)
oh thanks u, its easier than my country math^
oops sr, i mean its a reply for RRemember..
not salami
i think im going to show some exercises in my country, is it annoying?
Have you done this?
It's okki
... i wanna know how old are u @deep field
are these actually the questions
wow they're kind of easy
i assume they get harder later on though
ummm why though😔😔
i'll tell u i js wanna know why
omg thank you so much actually ur so nice like i was stressing because i didnt know how to prepare😭😭😭
because i see these excersies in amc is quite as same as our 3rd-4th grade math .
ooh im 13 though lol
australia is pretty behind curriculum wise i guess
im aslo 13=)))
but ourr math test..
the tests here are fairly easy
school is super laidback so not a lot of high achievers
nothing compared to school in asia for example
our math test=)))
It's ok, the AMC is still quite a while away : ), make sure to relax whilst you study hard
thanak you!!
i wish you the best of luck on it
is it at a venue or do we do them at school?
i think it would be fun to go to a place to do it
I did mine at school because I'm at a private institution, however some schools do it at a specific place
ah i see i see
ooo yeah i think its held at school
i hope i can at least get credit
high distinction is obviously just a pipe dream but it's worth a shot !
I'm sure you'll do fine, most of the multi choice can be found within the year 7 curriculum!!
Do you particularly enjoy mathematics?
Yep, since 2022. This year is my last
I'm happy : ), I love mathematics too
I always got distinction, but not high distinction: ((, but I wanna aim for it this year
wow!!!!!!
i really hope i can get an awward
anything is possible i believe you could definitely do it
Here is the scoring system
Thank youu : ), you will absolutely obliterate the AMC with your capabilities
All students receive an award according to the criteria below.
Participation
Awarded to a student who has participated in the competition and received no higher award.
Proficiency
Awarded to a student who has received a pre-set score and received no higher award.
Students who achieve proficiency have demonstrated competency at mathematical problem solving to Australian standards.
Credit
Awarded to a student who is in the top 55% of their year and region (60% for Senior division) and has received no higher award.
Distinction
Awarded to a student who is in the top 20% of their year and region (25% for Senior division) and has received no higher award.
High Distinction
Awarded to a student who is in the top 3% of their year and region (top 5% for Senior division) and has received no higher award.
Prize
Generally awarded to no more than 1 student for every 300 students within a region and year group. Prize winners are given a lapel pin and a voucher for our online shop. The value of the voucher may vary year by year.
Best in School
Awarded to the student with the best overall result in a school, after adjustment for year level. It is only awarded if the achievement is at least a Distinction, and there are at least 50 entries (secondary divisions) or 30 entries (primary divisions) in the school. There may be more than one winner if adjusted scores are equal.
Cheryl Praeger Medal (Secondary divisions only)
Awarded to the female student with the highest score in Australia, in each year level, where preset criteria are met.
AMC Medals (Secondary divisions only)
Awarded to a student with outstanding results within their year group for their state, territory or country. Generally, no more 1 in 5000 students receive a medal.. Medals are awarded at the discretion of the Australian Maths Trust.
I copied this info from the official website, but the award system is here if you're interested
thank you!
I’m pretty sure what your circle is wrong (the bottom line of what you circled)
this is correct
Oh okay, in that sense they should done S+2 in the solution because the solution stated is incorrect at the bottom stage. Still arrives at the same answer for accounting the -2
thank you
np
hello
I have trouble with Trigonometry
Nice
Geometry as well.
Can't waste any more time.
Then I will finish the calc book
first volume
I'm not trying to know the solution, but how would you guys solve this equation? (x is a real number)
Hint: ||note that sums of those expressions under roots on both sides are equal.||
Solution: ||#1382370897511448716 message||
Oh, I guess someone else took that test too
I managed to solve it during the test but thanks anyways
This one is easier and I already know the solution, but I'll still send it for some people to try
-# someone might have sent it before like the other equation but I'm not sure
Replace 3-xy in the second equation with x+y and extract the full cube on the right hand side.
Then you get (2y+x)^3=(x+y+1)^3
So, y=1, x=1.
Thanks, well I guess that's the best way to do this anyways :D
HI ALL, how to get into AIME and jmo?? 2 yrs ago i got a 48.5 on the AMC10 (its very bad ik). But I wanna qualify this year. im pretty sure test is in November, so I'm a bit cooked for timing idk u tell me, but yeah, what did u use, (if ur comfortable, u don't have to tell, but your score) and yeah ig that's it. and study tips thanks!! sorry for bad grammar and punctuation.
I'm not really sure, but last year I just prepared for AMC10 by going over a bunch of AMC10 questions (sometimes AMC12) and ended up with 117 (could've been better oof)
May I know what grade you're in? That would make it a bit easier for me :D
There are no positive integers satisfying the second condition
whats this three lines???
n three lins 5 mod 7 whats the meaning of this
how do you get it to write like this
$n \equiv 5 \pmod 7$
Rando.
plug it into wolframalpha

,help
A brief description and guide on how to use me was sent to your DMs!
Please use ,list to see a list of all my commands, and ,help cmd to get detailed help on a command!
,list
I'm sending a proof related problem next time :3
Also this was given to 9th grade students in a test, so things were kinda limited
i cant solve it
oof.
helpp
you can refer to this hint, the solution isn't that friendly for grade 9 tho
i refered to the hint and still i cant i refered to sol. and i got scareed
Try replace the roots with variables a,b,c,d, you'll have:
a+b=c+d
a⁴+b⁴=c⁴+d⁴
ohh
how did you getthe second expression
i get it
It's just true, look at the stuff in the roots
i solving
yess
i cant
i have reACHED THIS EXPRESION
ab + cd = 2(c+d)^2
🥲
Split the 2(c+d)² into (a+b)²+(c+d)²
After all you can kinda tell that it can't happen
what cant happen??
That equation
how
First of all, a,b,c,d>=0
yea
So this only happens when a=b=c=d=0 which can't happen
what to do then
what was your sol.??
I did some stuff and get 2 cases: either ab=cd or your equation is true
the eqn is tru only if a,b,c,d=0
since on solving like you said i got a3+b3+c3+d3 =0
all of them can't be 0 because then x would be -1... but then the other ones wouldn't be all 0
btw how did you get that equation
yes
i took a+b=c+d to the fourth power
and then a4+b4 canceled out with c4+d4
then i took ab and cd common
both sided
and then ab/cd = a term which i cant type out
After this and simplifying I got
2ab(a+b)²-a²b²=2cd(c+d)²-c²d²
yes and since a+b = c+d therefore (a+b)^2 = (c+d)^2
yeah
substitute a+b for c+d
take ab and cd on one side in a fraction and apply componendo dividendo
huh
I'm pretty sure you can factor out (ab-cd) and some other stuff that can't be 0
meanwhile if you do ext 2 or the equivalent you've got to be gunning
of course there are still some people who will find ext 2 straightforward
Australia's system isn't that bad
a lot of Asian countries have a memorisation-based curriculum for humanities and it absolutely sucks
remember that the Australian Curriculum has eight equally important curriculum areas after all
@crystal rock
yea they do
but yes Australia traditionally values sports (the footy) much more than academics
it definitely does
so it's become much more normalised to not try at school
people genuinely just dont care
kids in my class are proud of getting ungraded which is basically a fail
its below 40%
it's honestly harder to get a ug than an A
and an A+ is 90% and above so it's not difficult
oh no...
huh, sure
Although I don't like it when the denominator can be 0
can it be in this case??
I think so, but we can just check before doing it
cd=0 means c=0 or d=0, but c and d are positive
We only need to check ab=cd then
If that's the case then:
(a-c)(a-d)=a²-a(c+d)+cd
=a²-a(a+b)+ab=0
So a=c or a=d, this is easy
Overall we can easily solve each case to get x=0 or x=1.
On this
You are on the money with that
So I take O level geography
And its very simple, they in fact give you the answer key(the textbook), its just you have to memorise it
yeah and Cambridge is supposed to be the more open and less traditional board...
really my experience growing up in HK, and my friends' experiences in Singapore: those are more of the exception
Japan and Taiwan are also trying out curriculum reforms
they've been trying for the last 30 years in fact
Singapore’s curriculum as of current is terrible
I asked one of my classmates have you started calculus yet (We take Additional Mathematics), bro said he started differentiation but not calculus
I mean if the government rots from the top like a fish from the head up, whatever they teach for the humanities will be terrible
Fax
there have been a million papers about teaching English to Japanese students, but Japanese students' conversational abilities remain as bad as ever
You should see a Singaporean candidate take an oral exam
You an Aussie?
well, failing at oral exams is a universal thing
yeah
Brisbane is a W
I mean he probably meant he didn't start A level calculus
but if you look at the actual Cambridge A level syllabus, it's a joke: Add Maths students are learning some pure 3 content already
cause it's been pushed back so late to pure 3
like logs and exponentials
Dude, they just add maclaurin and integration techs
Ok fine volumes of revolution
But that’s it
how so? I'm curious
Well over here in Singapore, basically how an A level student answers a question to find an inverse function is just switch x with y, write $x\in \mathbb{R}$ and hope for the best!
fair
Lost fruit
well I mean high school students have so many demands on their time
That’s true
if they don't enjoy maths already they're going to take the easiest shortcut
Yeah
that's just the nature of our education system
Sadly
write down a bunch of shit for induction they don't understand themselves
A-level maths here doesn’t even cover proving
Unless you take H3 maths
But barely anyone does it (because they all take H1 and H2)
The culture arises from how they teach at O’s
In an O level math exam I find myself typing shit on the calculator more than I derive stuff during the exam
Like most kids here memorise the formula for the angle in the law of cosines, and have no clue how to get it from the actual law
no one here chooses stem-related classes because stem jobs in general be underpaid asf
that is interesting as fuck
how it be feeling being paid less than global minimum wage for engineering job
oh true
immaculate
engineering has a huge oversupply in the subcontinent
according to basic laws of economics, there's no way each engineer can be paid much
is it similar where you're from?
i chose to because i liked it and now i'm locked in a vicious cycle of having to study calculus, la, ra, ca, etc, etc, etc over holidays and vacation
otherwise i will end up dead broke on the streets
kind of
engineers are purposely underpaid here
- the fact there aren't that many universities that connect it to technical, hands-on activity
the curriculum is disjoint
i just want to be 13 again man
ts shit is going to drive me insane
I swear the shit I went through in grade 9 is crazy, like wdym I have to be able to solve stuff like this 😭
,w x = \sqrt{(3 - x)(4 - x)} + \sqrt{(4 - x)(5 - x)} + \sqrt{(5 - x)(3 - x)}
What is that x≈6.1828 doing lmao 😭
Well it's valid :(
Nevermind I have to split the square roots, or else that 6.1828 will be a solution and I don't think I can solve for it
So it should be sqrt(3-x)sqrt(4-x)
not sqrt((3-x)(4-x))
$x = \sqrt{3 - x} \sqrt{4 - x} + \sqrt{4 - x} \sqrt{5 - x} +\sqrt{5 - x} \sqrt{3 - x}$
Rando.
Now this works better.
it's not hard just by moving 3,5 term to the left and squaring. x=671/240
I want to get better at math oly but I have no resources 😭 anyone mind giving a few playlists or book recommendations (that include solutions) for geom?
which country are you in??
vietnam :3
ohk
scary 😭
what grade are u in rn??
I just finished grade 9
-# help
wow
somehow that works, thanks for the easy solution
Why do you have the undergraduate role in grade 9 lmao
:) I'm kinda stupid
-# sorry for trying to learn more than I should ig 😔
Oof, then I guess I'm stupid.
I just don't understand what stuff means, that's all lol
Yeah the undergraduate role is for when you enter college, until then people usually have the pre-high school role, and having the undergraduate role is fine and all, but it won't really help you learn any more than what you are right now, it'll just expose you to math that you might not understand in places like the undergraduate channel, which might lead you to feel demotivated(or motivated, depending on you)- but keeping it is your choice i was just asking lol
Hmm, I see.
I'll still keep the role since I've been learning things about that level for 2-3 years, but thanks for the suggestion :)
You are lucky bro I am 17 and I started in competition maths just two months ago, I somehow feel it's late and I should go into something else but I still have two years in high school so I think It's worth a try
Anyways I have this problem does any one know how to solve it
Consider a square with a side length of 2. Prove that, for any choice of 5 points within this square, there are at least two points whose distance from each other is less than or equal to .
hm
Well if you divide it into 4 squares of side length 1, there will always be 2 points in the same square, which have a maximum distance of sqrt2.
This. In German we call it the "Schubfachprinzip", not sure whether in English you actually call it "drawer principle" or something... However, it describes that if you distribute these 5 objects (your points) among the 4 "drawers" (the subsquares of side length 1), there will always be a "drawer" containing at least two objects. The rest is the argument you brought up
Yeah, I think it's called the "pigeonhole principle" in English
Right, I remember that name 👍
Hey everyone!
Wanted to ask if you all have heard of something called 'MathDash' and have any raw thoughts about it 🙂
isnt MathDash your website 💀
that;s cool
THis bad bad boy was on hmmt 2024 november team round
god I always forget this (a+b)(a+c) grouping trick in these problems
Yeah I thought of something like this too, although I didn't expect the "squaring both sides" thing the other guy mentioned to also work lmao
euclidian geometry in math olympiads, its the otis excerpts of geometry (hell im p sure its mentioned there?)
wait although it doesent have complete solutions, only some problems jave sokhtuons
I kinda had a stroke reading that
Nah there isn't geom in Otis excerpts
? what does that have to do with what i said
Misunderstanding sorry
wanna start comp math, heard aops is a good place to start, but what aops book should I start ith
i loive gd cologne+
im not sure where you got it from, but aops could also refer to the aops site, where it has aton of past olympiad papers and alcumus which basically gives you questions and answers
imagine playing gd
is po shen loh's compilation of solving quadratic equation worth it?
i feel like brahmaguptas way is more practical
If A and B are positive integers, and when divided by 5 they leave remainders 2 and 3 respectively, what is the remainder when A(A+1)+5B is divided by 25?
my answer is 21 but idk if it's correct or nah
Metagaming it a bit: if there's any single answer it must be what you get when A and B are 2 and 3 themselves.
okay"
so just substitute 2 and 3 to A(A+1)+5B?
yep
Yeah.
fakesolve trick used in comp math lol
yup
It's not obvious that there's only one answer, though.
you have to write in terms of 5m+2 and 5n+3 and expand that
Yeah, it's not as simple as saying "we know the factors modulo 5, so therefore we know the product modulo 25" -- which isn't true in general.
mod rules can't apply here ye
only the prodigies remember me
it’s just the quadratic formula window dressed slightly differently
I don’t see any meaningful distinction between that and the standard quadratic formula
it’s right and I think you can just fake solve this and it will be quite easy
Yeah I solved it using this principle
Alcumus on AoPS
If you're going to use AoPS start with the books because it's not the best idea to just use alcumus
The books are under bookstore and alcumus is under reasources on the home page.
What topics are consistently tested on amc 10?
All of the common topics that are tested on the amc 10
you'll know if you practice
Uh yes but I'm going to sleep
hello im sbhs student
i need help with yr 12 mathematics
cuz we're doing yr 12 maths in yr 7
some calculua
How old are you?
hey
anyone who can help me out with some questions?
related to IMO you can say
yeah, IMO.
Join the mathematical Olympiads discord server
Hey everyone who is the youngest in this chat?
Random
can u pls dm me the server link
thet probably wont reveal that
And shouldn't
tru
I am 16
Unless you are under 13, in which case you should
lol
What about you guys
it is in the description
same
thnx
of this channel
Which grade?
have you qualified for imo ???
11
nop
u think if someone has qualified for it, will seek help instead of doing what they have done over the time?
I think I am the dumbest here 
nahh, talking 'bout me, i dont judge no one
ur pretty fresh and alive
lol
I am all fresh
that’s a very interesting question to ask
Then answer it buddy 
Hello
you called?
my 2 year old cousin who has scored a 15 on the aime first try while he was sleeping
anyways I derived triple cos angle identity on the fly during a mock yesterday I feel like a god
hello yall
do uk some free competitions i can participate in
i am a year 10 in india and ik most competition math
Free ???
free tibet
easy
13
Im 16
And I have started to think that I have the lowest level of mathematics here.
combined operations?
my brother is watching that in 9th grade
well he watched
anyone wants to enter a stem online olympiad?
aint it just compound angle
tes
Find the least n such that gcd of (n^3, n!) ≥ 100.
this is just bashing after ruling out n>4 and n can't be a prime, yeah?
i mean i got the answer as 8 but i wanted to know the most optimal solution
n can be prime, e.g. n=101 works :-)
I don't understand what does the "," mean
Would it be clearer for you to say "the gcd of n³ and n! is at least 100"?
Yeah sorry, I'm not a native so it's often a bit confusing 😭
How can you have clue with this one?
15
I am also with you!
maybe this?
if n≥100 ,this always work
now consider n<100
note that if n is prime
this lead to failed
consider composite number n
4,6,8,9,10,...99 ?
don't have a full sol yet,I'm bashing too bruh
maybe try case $$ n=\prod_{i=1}^{m} p_i^{k_i} $$ where pi prime, ki non-negative and $$ n=p^k $$ where $3 \leq k \leq 6$
S
I think I just done full sol(?)
if p is odd (case n = p^k), the only
solution for gcd(n³,n!) = n gcd(n²,(n-1)!) = n which fail
and what about p=2 k=3,4,5,6...
and for case 1
4,6 lead to fail so 8 is the least number n
does anyone have guides on how to improve combinatorics
(combi is my weakest topic)
so for example im taking about imo shortlist C1-2 difficulty
ty ig
my strongest is geom
solved some years g6
tbf i got lucky and saw the shit
My strongest is N but the best I can do is N3-4...
das good
i cant go g2-3 consistently
only if its easier
have u ever read Evan chen syllabus for olympiad?
no
dont think will help me
i got other material

i learnt about hensel lemma in NT and my brain died
btw i heard some IMO year has a N10
so i will try my very best to do it and then i can say my highest solve is a 10 💀
theres 0.01% chance i do it tho
i like algebra but can't do shit about sequences
only thing i can do is muirhead 
try C10..
jk I don't have one
okay
yup but we need to find the least n ! so i thought it would be pretty good to rule that out first because all primes > 100 like 101,103 etc satisfy the condition but they're not the least
i see, a pretty good intuition which i thought of would be to choose a composite number with the greatest number of prime factors (preferably not distinct).
it's just bashing and smart guessing i think
i can explain the conditions tho if you want
n>4 because 4^3 = 64 which can't have a gcd exceeding 64 but we want gcd greater than 100 so that's ruled out
the least number's cube greater than 100 is 5 so we start from that
Also, since 8 obviously works, all that remains is to show that 5, 6, 7 don't. There’s no requirement of being all smart and generic here, when a more general method wpuld almost certainly be more complicated than just checking those three cases already. If the problem setter wanted that, they'd have chosen a higher threshold than 100.
agreed was just curious for more approaches, it was a very easy problem after all
For larger thresholds, I think the best way is still trial-and-error starting from the cube root of the treshold. Primes near the cube root cannot work; nor can two times a prime (there wouldn’t be enough copies of the prime in the factorial), but the first number not of that form I'd expect to work in the sense that the gcd is the cube.
Any number with at least 6 divisors clearly satisfies gcd(n³,n!)=n³, so the exceptions can only have the form pq or p^k with k<5.
n! requires n to be an integer and you’re looking for the least n, so you can just count up from 0 until you find a number that works and that’s your answer
For pq, unless p or q is 2, the factorial contains p, 2p, q, 2q, pq, so there gcd(n³,n!)=n³ too.
I don’t really get the appeal of this question
it’s obviously 8
I'm just considering whether it would be more interesting if it had said eg gcd(n³,n!)>1234567890 instead.
For anyone who solves this combinatorics question is a genius: How many 7 digit integers can be formed using exactly 3 distinct digits?
hint: Zero cant be first digit
Sounds doable
that sounds very doable lol
Just work out 2 cases ig
no need to
Yeah ok I was probably stupid
nvm when you consider the first digit as 0 you need 2 cases
I worked it out but it doesn't feel right lmao
has anyone here done the IOQM maths olympiad, my school is proviing free tutoring this year for this exam and i enrolled myself not expecting much
is anyone here familiar with the contest collection of Art of Problem Solving website? i was wondering what contest to study if i'm an amateur proofwriter
same...
it's impossible to say what would be nice to start for you with so little information, so the only way you can discover it is by doing problems. Start with the easy ones, if it is too easy, try to solve harder problems, if it is hard, keep with it, if it is tooo hard, try something easier...
Focus on doing hard problems, always problems that you have a certain difficulty to do, but never something easy, or too hard to be done by you.
Oh, younger than me
I don't even know if I'm allowed to send it
And I'm 16 me too so we have a lot in common😔
If you only want the final answer then maybe just write a code to count it.
Its cause we are in differents countries
oh hi
-# 🧿
Just count solutions without the no-leading-zeros condition at first. By symmetry, 1/10 of them will start with a 0, so you can subtract those afterwards.
where are u from @simple gulch ?
Somone knows "El traductor de ingenería"?
[X] Doubt
Wait can you explain the symmetry thing wha
... oh nevermind
That's a bit quicker thanks
I'm from France, croissant cochon baguette béret
💥💥
REALLY?
oh yeah
I think I should utilize it more in combinatorics
I've never used that before
"engineering translator"...?
YES
Its a Channel in youtube
some videos are translated to english
but the native idiom of Damian is in spanish
https://programs.mcs.cmu.edu/arml/wp-content/uploads/sites/3/2023/09/algebra-jv-10-06-19.pdf
anyone know where to find the answers to these
pls ping
AMCs and AIMEs can be found on the aops pages for the respective past contests
Here’s NYCIML: https://www.nyciml.org/free-past-contests
This is the same as 3.10 with different numbers, or just use wolfram: https://artofproblemsolving.com/community/c4h565120p3305179
4.1 is 2014 AMC 12A p18
4.3 is 2008 amc 12b p23
4.4 is 2013 amc 12b p22
4.5 is p2 here: [https://www.dropbox.com/scl/fi/4t45xopz5eganlxo4f5wr/MockAIMEI2015Solutions.pdf?rlkey=6o58y4epm641oxhwr4atfjokn&e=1&dl=0]
thank you 👍
have u seen evan chen's OTIS excerpts?
i think that can be a useful starting point for improving
idk what country ur trying to represent but start off with like the hardest level of C u can do and just attempt problems slightly above that
tbh i was discussing with some of the ppl who run the UK olympiad training program and like we think combi is just the one area of maths u just get better at over time
exposure to more maths etc. helps a surprising amount
anyway otherwise just grind the C shortlist ig
can't go geo to save my life
(don't have to do it now though!)
like the only IMO geo i did by myself was IMO 2006 P1 or P4 (can't remember which)
this lack of geo skill is a bit of an issue if i am trying to cook up olympiad problems involving L and Y
yoo what is that name 😂
yes i have
fair yes
am from singapore btw, so i will do smo open round 2 combi questions ty
but the thing is that i cant do 90% of combi in smo open round 2 but i can do 90% of geom there 😭
btw smo open r2 is essentially singapore TSTST its not the prestigious because singapore is smol nation (less people)
got quite long time ahead of me so can grind
$(\cos^2\theta-\sin^2\theta)\sqrt{\sin^2\theta+\frac{2gh}{v^2}}=\sin\theta[\frac{2gh}{v^2}-(\cos^2\theta-\sin^2\theta)]$
Lost fruit
How does one get $\sin \theta =\frac{1}{\sqrt{2+\frac{2gh}{v^2}}$ from that
Lost fruit
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
you expand everything out and solve for sin(theta) lol
all the terms cancel out
I hate physics
Wait did you actually work through it 😭
yes
Hey!!
Anyone from India here? Targetting ISI?
I like N in SMO, like 2023 senior p2 p4 is really fun
really
lemme see
Which country are you from (if you dont mind)
hi recently joined the server here for a competetive exam n yaa i am new to discord so sry if i make a mistake
all good, you're in the exact right place
but to let you know, we also have #prealg-and-algebra , #geometry-and-trigonometry , #precalculus for regular school maths
hahah glad i found the right place
depends how much like competition maths your exam is
some of those can be quite like olympiads, and others not so much
I just had a feeling that you'd be okay here
ohh okok actually i am preparing for jee 2026
ok coolll
Make a sub t=e^x, then it becomes 2arcsinh(t)/(t+1)^2, then do it by parts. You get the integral of 1/((t+1)sqrt(t^2+1)). The rest is a standard exercise from textbooks with sub z=1/(t+1)
hey guys im tryna study for a competition for year 13 how can i be fully prepared?
4th question is really nice
For the second question:
||If 3 doesn’t divide k, RHS is divisible by k therefore LHS is divisible by k therefore a^2=2(mod 3) contradiction
So 3|k. Will continue in a bit||
<@&268886789983436800>
Thanks
Man, if I want to continue being a mod here I gotta work on my APM
guys how and why cosnπ = +-1
I have an olympiad tomorrow and my combi sucks do yall have any advice (olympiad is 3 hour 5 question, i can complete 3.5/5 usually but to get a good placing i need better marks)
where are u from
why do you ask
Arent you from singapore or smth
mhm
thanks
What oart of combo sucks
Just make sire to like
everything
Remember php and invariant
except graph theory
this is easy af
but couldnt find the solution after a while
ended up using Mantel's theorem on graphs
@soft vigil
like what are common things to consider
Yes
maybe try a pair of small numbers explicitly to see if a pattern becomes obvious?
like perhaps 11 and 7?
I don't know where to put this so it might as well go here.
I guess there should be countably infinite x>0 and y>0 rational solutions to x^3+y^3=9, by drawing a line or a tangent line that intersects the curve at a rational solution.
How can I somehow "minimize" the numerator and denominator? Is there some constraint that bounds the numerator(denominator) that is easy to work with in Q?
https://math.stackexchange.com/questions/2473850/prove-that-x3-y3-9-has-infinitely-many-rational-solutions
https://math.stackexchange.com/questions/1794726/rational-solutions-of-x3y3-9
The first sum is just a number of integer points inside a triangle under the line y=ax/b on [0,b-1] (including the line itself) and the second sum is the same thing for the line y=bx/a on [0,a-1]. Since these two triangles are equal (one is a rotated by 90 degrees copy of another) so the number of points with integer coordinates in them are equal.
You can even count the value for each one in terms of a and b as these two triangles make together a rectangle of integer points. Each sum equals (ab-a-b+gcd(a, b))/2.
I never dream bout this sol even once ,thanks
is there any good resource like video or text/book on Chinese remainder theorem? I understand mod and stuff perfectly but for some reason i'm not able to make much sense of CRT especially when the mod equations are 2>
right, i’ve had this problem where if the variables arent in the order x_3>x_2>x_1 the variable values end up in the negatives or in fractions. Prime Newtons has a beautiful solution though which for me has worked 100% of the time.
i’d also search up Errichto Algorithms explanation on the crt. since his method also works on non-coprime modulos albeit more tedious.
Thanks, i'll check it out!
Solve question number 12
no
This question contains multiple correct .One or more than one are correct
try drawing a rough graph of it
both f(x) and y=x are odd functions
I solved
I just find inverse of the given curve
Then find out derivative and it’s always positive . So no maxima or minima
Thanks for the help
I am going on by your method
that's a nice method as well tho for some reason we are never taught about inverse functions here
after 12 years
Got this
so my immediate thought is just to draw a graph
Yeah
I love catss
I wanna do amc 10
Im struggling bro😭
Someone told me to study hard and try to do the olympiad but i cant even do amc 10's first problems
do u got a problem ur struggling on?
Eh idek
Just overall
Maybe its number theory
Ive never learnwd number theory ive just covered the 4 core hs classes
yea that’s the same problem i ran into
Oh you took the amc 10
yea
Wooo
did bad last year, my school for some reason put a mandatory 1 hour assembly right before
Was it that bad in actuality
and i was exhausted starting the test
i didn’t think it was horrible
did some dumb things cause was tired
Not being like rude but are your smart and i dont mean like wtv i mean like are you an avg guy or someone who like has credit if you get what i mean
Like id like someone to talk to a little deeper
nah i get what u mean
Not smart just know how to get further than the amc 10 and the amc
Did you stop at the amc
Some hs senior apperwntly got qualified for the usamo at my hs so yep
Self taught multi var calc year 12😭
I was gonna do multi var calc like in 2 or so months but ive been moping
You there
Mate come back
sorry eating lunch
Oh sorry
My wifi is atrocios
0.52 mbps a second upload😭
Did you get past the amc 10 btw. The aime i mean
i did not last year
i honestly learned about all this super late
and played catch up for like 3 years
if i took it now i could probably make aime
Dawg my internet crashed fkr 26 mins after this
Did you graduate
Also whats thw diff between amc and aime
Com3 back
tougher problems, not multiple choice
Yes, my name is indeed from, wbu?
My name is from my perpetual tree cutting habits
And my continent is atlantis
are there any good remote online math competitions with certificates/awards that I can join for free? or almost free?
International math bowl
Is free
whoa :o what's it like down there?
Cold.
Bro
How much tougher btw i hearf like thw hardest amc problems are the first aime problems
Also fo you have to get elected into aime like usamo or is it only usamo
And to get into usamo do they only check your score or your score and time on amc and aime too
time?
what does time have to do with any of this?
where did you get this info???
late (final 5) AMC problems are roughly comparable to mid AIME
for AIME qualification your AMC score is what they use to determine cutoffs
then for USAMO they use both your AMC and AIME scores to calculate an "index" which is your AMC score plus 10x your AIME score (max 300)
and use that to determine qualification
∆CFE is right isoceles so CE=CF=√2 CX
You can rearrange the two smaller isosceles triangles into a square
So the cutoff is only score
im too old for competitions now rip
Im too stupid for ts compition bro🤞 😭
"ts competition" 🥀
🥀
I heard aops book, volume I is good for amc 10 and aops volum 2 is good for aime but gow much would it help
Also whats covered in volume I besides from standard us ciriculum
Number theory?
Wait question
If i buy volume I of aops and just go through that and then do problems on alcumus am i good enough for amc10
Also what does volume I vover and samr for Volume II and how far would both grt me (compitition wise)
What does volume I cover btw and what foes volume II vover also is II good enough for aime too
look up its table of contents
the problems are approaching too easy even for AMC 8
Does anyone know where I can find solution manual for everaise math II
$Let a,b,c,x,y,z$ be real numbers such that $$\frac{x}{a} + \frac{y}{b} + \frac{z}{c} = 52$$ $$\frac{a}{x} + \frac{b}{y} + \frac{c}{z} = 147$$ $$\frac{xyz}{abc} = 9$$ Find $\frac{x^2}{a^2} +\frac{y^2}{b^2} + \frac{z^2}{c^2}$
donut123
I found it, it's right there
,w 52^2-21479
I’m getting this if you want to cross check
alr well for some reason im getting divided by 9 instead of multiplied
but i think i had the right ideas
prob some calculation mistake
wdym

Probably trolling (similar logic to the meme where it says “find x” and the kid literally circled the x)
if u let a = b = c = 1, it shouldn’t be too bad. I don’t know if the algebra as is, is better though
I mean it’s basically a system in x/a, y/b, z/c so whatevs
Can anyone help me with this question?
Let A be a real root of x³=x+1:
1 - Prove that there exists an integer M such that |M-A⁹⁰⁰|<4⁻¹⁰⁰
2 - Find a pair of integers p and q such that |A- p/q|<1/100
3 - Find the unity digit of ⌊A²⁰²⁵ + A⌋
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
I don't know where to begin
do u have a source for this question?
I see
Uh
Should i just get a number theory book as ive never covered it
Or volume 2
Nah
ok I don’t love the vol 1 vol 2 books but content from the rest of the books is enough to get 25/25 on this https://artofproblemsolving.com/wiki/index.php/2024_AMC_12A_Problems for instance
weird question
this is A^900
idk
So then
Like
Could i get Volume I to cover amc 10 and amc 12,m
Bro this is horrible
Consider the sequence defined by a_(n+3) = a_(n+1) + a_n for appropriate integer values of a_0, a_1, a_2.
you should know that if B,C are the complex roots of x³-x-1 then you have the closed formula
a_n = xAⁿ+yBⁿ+zCⁿ
for some reals x,y,z
If you never did problems like this one maybe it can feel a bit weird, but the power of this approach is that if a_n=xAⁿ+yBⁿ+zCⁿ and all the roots r except one have |r|<1 then a_n for n big is very very close to kRⁿ where R is the only root with |R|>1, and in particular a_n is an integer (because the sequence is an integer sequence), so you get kR^n is super close to an integer and this allows you to solve this problem
then I think it's useful to
||notice that here |A|>1>|B|=|C| ||
||choose appropriate values of a_0, a_1, a_2 so that x=y=z=1 so a_n ≈ Aⁿ|| (you can do this with ||vieta's formulae||)
Then the skull part in the part 1 of your problem is to prove that |B⁹⁰⁰+C⁹⁰⁰|<(1/4)¹⁰⁰ 💀
so I'm a bit sussed, I'm not sure if this is the best way to do it
But then parts 2 and 3 are much easier. For part 2 just do approximations and for part 3 use what I was telling you about earlier: ||A²⁰²⁵≈a_2025 and you can just look at the sequence mod 10. Then the +A will just add 1 because A≈1.3||
Bro this approximation is so fucking sharp
Fuck
Ok I'm missing something, you can probably do something very similar to what I said
how is the first part so much harder than the second and third bruh
Probably just a skill issue
I think I got it
nvm probably not
This may be easier said than done -- the sequence mod 10 seems to be quite long too.
Well you do mod 2 and mod 5 separately and surely mod 5 is not too long
Ah!
Anyway mod 5 it's quite fast to do so even if it's a bit long it's not too bad
Okay, mod 5 gives length 24.
Unless I did Viète wrong and used an incorrect starting state ...
Ah, no, the single shorter cycle mod 5 is 1, 2, 4, 3, 1, 2, 4, 3, ....
and a1 definitely is 0.
The cycle should be at most 5³ which is very small :)
Yeah, I computed the 24-cycle starting from 1,0,0 and it doesn't have n,0,0 for any other n, so there are 4 different cycles that are multiples of that, totaling 120 triples. Then there is the trivial 0,0,0-cycle, and 1-2-4-3, with length 4, and then all 125 triples are accounted for.
Edit: Whoops, I cannot arithmetic -- there was a 4×24 is only 96, not 120. I had missed a final 24-cycle starting with 1,1,0,...
3,0,2: we have A²+B²+C² = (A+B+C)² - 2(AB+BC+AC) = 0² - 2×(-1) = 2.
Oh yeah i accidentally multiplied by 3 again
Hmm, the magnitude of each of B and C is sqrt(1/A), so |B^900| = |C^900| = A^-450.
So we want to prove that 2 A^-450 < 4^-100, or A^450 > 2^201.
Wolfram plus my calculator says that A < 4/3 < 2^(201/450), but establishing the second inequality with pencil and paper still looks a bit forbidding.
But wait! that's an inequality in the wrong direction. 💀
yeah it looks like you can't just use 2|B⁹⁰⁰| instead of |B⁹⁰⁰+C⁹⁰⁰|
Maybe you can do something with induction
But idk and I don't have time now
Wolfram also gives the argument of B (or C) with many digits, and 900 times that is about 65° (mod 360°) . So |B^900+C^900| is close to |B^900|, but the last factor of 2 won't make a large enough difference.
But the difference between A^900 and the nearest integer is definitely exactly B^900+C^900, so I think part 1 of @amber nexus's problem is simply wrong.
Thx for the help guys
A friend sent me this problem, he said the problem is from a class given by an IMO medalist
But he doesn't have the solution
Hi, I was wondering if anyone have some interesting math problem that they can share , thank you!
for me, not atm, however you can look at help channels; you don't need to reply to them, but you can try out the problems :>
welcome to the mathcord btw 
Alright, tysm
Let $F_i$ be the $i$th term of the Fibonacci sequence, defined by $F_0 = 1$, $F_1= 1$, and $F_n = F_{n-1} + F_{n-2}$ for $n > 1$. Show that the sum $$\frac{1}{F_0F_2} + \frac{1}{F_1F_3} + \cdots $$ never exceeds 1
donut123
Experimenting with a calculator, it gets pretty close, so there's probably not any room for approximation.
This smells of telescoping, somehow.
it's exactly 1, just use partial fractions and telescope
Did anyone here to to mao nats
how do u partial fractions it?
The question was how do you pick numerators such that the difference works out to exactly 1/F(i)F(i+2).
Ohhh okay. I’m sorry, I misinterpreted the question
Presumably we'll need to find A and B such that AF(n+2) - BF(n) = 1.
It's true that F(n) and F(n+2) must be coprime, so we can Bezout them somehow, but the precise form of the coefficients is not ready knowledge for me.
Ah, googling for "fibonacci" "bezout" led to http://www.ryanhmckenna.com/2015/03/investigating-bezouts-identity-for.html which derives some coefficients.
However, it won't be a simple telescope with those coefficients; the tail terms don't go to 0. But it looks like one can it such that the tails for odd and even n go towards phi and -phi, such that they cancel out in the limit.
The Fibonacci numbers: ( 1,1,2,3,5,8,13,21,... ) have a number of interesting properties. A few days ago, I discovered and proved one su...
Yeah I doubt that is the intended solution
It’s cool
But given the context from where I got the problem lkkelh not
I don't see a lot of difficulties. Just write 1/(F(n)F(n+2))=1/(F(n)F(n+1))-1/(F(n+1)F(n+2)) and it telescopes nicely. According to Fibonacci's definition F(n+2)-F(n)=F(n+1).
Oh, clever. But I'd dispute the "just" -- you need to pull 1/(F(n)F(n+1)) out of thin air to get that argument going.
no, it is quite natural. You have 1/F(n)F(n+2) and you definitely want 1/F(n)-1/F(n+2) which equals (F(n+2)-F(n))/(F(n)F(n+2))=F(n+1)/(F(n)F(n+2)). So, the obvious thing is to divide 1/F(n)-1/F(n+2) by F(n+1) to get our n-th term. And that's it
you definitely want 1/F(n)-1/F(n+2)
But at the end of the day that's not what you're getting.
sure. But that's a standard thing to start with when you want to sum something like 1/n(n+1) or 1/n(n+2) aiming at some later telescoping. As someone mentioned above just do partial fractions. And that's usual I think, when you have something like 1/(AB) to try to represent it as 1/A-1/B.
Yes, trying to represent it as 1/A - 1/B is natural, but when that doesn't get the right numerator after you multiply out, I definitely think it's stretching it to describe the inspired save here as a "just" thing.
In most cases yes, you have to divde by B-A. Which may be constant or just suitable for your purpose of telescoping. Just like with these Fibonacci. Anyway it is a popular trick. So, for me it falls into a category of 'just' 🙂
Generally if B-A is not constant, dividing each of 1/A and 1/B by it would destroy the telescoping property. It seems extremely specific to this problem that it just happens to work out such that a different telescoping becomes possible. Dismissing that as "just partial fractions" still sounds arrogant to me.
idk, it is the first thing that came to me, and it worked
I'll retract my "out of thin air" comment, though.
who want to play roblox with me @everyone
Wtf
game rách dell ai hỏi
Me, send me friend request: imdefinitelynottrollingyou@123
given acute triangle ABC (AB<AC) inscribed in (O), altitude AD, H is the orthocenter. BD = DE. EH intersects AC at F. Prove ODF = 90°
nice diag
lemme try
(it's very difficult)
we'll see about that
(or very easy if you remember a particular theorem)

||ok so first i reflected H and BHEH' is a rhombus and ABH'C concyclic||
dont tell me if im right
dont give me a hint pls
is this complex bashable 
where are similar triangle
gonna eat
How can i apply mn cot theorem that is (m+n)cotx = ncotB - mcotC in this trianlge along the lenght AD. I am not able to identify which one is m and which is n
I don't know what the original problem was (I hope BAC=90), but if you are given only these angles, then you can denote EC=t, then using the low of sines you find AE in terms of t, then similarly find DE, and finally BE from the triangle ABE. So you will find BD:DE:EC is (supposedly) 1:2:sqrt(3).
blyat
@sweet pewter can i have a hint
cant find any similarity
NO
I FOUND IT
for one angle haiya
did you solve it?
not yet
if I do give a hint it'll prob spoil the whole problem
okay then i will wait
ty
is this imo p1/4 level
I've seen solutions involving Brokard's theorem

idk I found this on Facebook and solved it
okay
took me a long time to remember this theorem
you did it first try?
but you remembered it
pro
not Brokard
ah
this
I breifly remember having to prove this in one of the first lessons on cyclic quads
you first step is correct
yay
hint: use the inverse of the butterfly theorem
hmm.. that will definitely require something else on DF
yeah that works because of the rhombus lol
<@&268886789983436800>
bro the diagram is soo neat XD
I thought it was on notepad but it's hand drawn, damn
id say its a proof level version of an aime p7 so wayyy lower
Aime p7 💀
is this integration solvable??
Aime p7

yes, it equals ||arcosh²(a)/2||
which is ||ln²(a+√(a²-1))/2, if a>1, ||
||and -arccos²(a)/2, if -1≤a≤1.||
thx for help me solve it!!
This can be bashed with Ceva's (2 times) and some trigonometry
<@&268886789983436800>
yo so uh.........
what do yal do when u get stuck ona prpblem you dont know how to solve
lwk sunds dumb
BUT
sometimes i encounter probelms with skills i havent practiced in a while
even though theyre easy i cant figure it out sometimes
in general i get stuck on "easy" problems because i forgot something
does naybody know a remedy to this?
review textbooks & lecture notes / open help channel here
or just keep doing problems that way you'll never forget 
oh true
has anyone here done usamo?
if so, what'd you guys get in your HS years on the 3 MAA comps? rn I think I'd get ~120 AMC 10 and ~5 aime as an incoming sophomore and I'm curious how that compares to others
anyone know any good courses to get good at BMO
also i have made a sort of problem set with olympiad style questions if anyone wants to try them i rlly want someone to give it a go
if its basic math for 9th grade then give it to me
just making AIME already places you well above average
see here for past score summaries
it’s not that basic but i have one u can think about “ give me an interval of 999 consecutive integers where none of them are prime”
I'm sure, but my goal is USAMO and I'm more interested in how other usamo qualis improved over time
ty tho
||[lcm(2,3...1000)+2, lcm(2,3,...1000)+1000]|| right
i could probably optimize
a little bit
Ive done jmo once at got hm but thats it
Hmm
I know people who have done like
Sub 120 amc and made jmo through like 10+ aime
deadass?
that's insane to me wtf
bc I'm genuinely horrible at aime problems but 120 is light on amc
still impressive but I'm afraid it's probably too late for me in that regard
120 is way above the AIME cutoff though
it would only make sense to practice AIME difficulty questions after qualifying
AMC score is factored into USAMO qualification, too
I have done quite a significant amount of aime problems but I have not improved at them to the degree I did with AMC - I went from like 80 to 120 on the previous tests
oh I mean you guys are American/Canadian? ah
no it's just that you can't enter for USAMO otherwise
there's residency/citizenship requirements
there is another AMC though, the Australian one
it's pretty damn popular
ohhh ic
this is the one i thought of
but yes this suffices
When Houston university contest
<@&268886789983436800> sorry for ping but spammers above
500
can somebody that trains for a NMO tell me how how he learns to solve problems
1000! To + 1000
O edit it a bit but I doubt 1000!+1 is prime probabilistically speaking
But it could be
Factordb.com says 6563 divides it.
Aww…



