#competition-math
1 messages · Page 20 of 1
Yeah
i think you need to be a sophmore or below for that
If youre in singapore i recommend coco education
oh
im not in singapore
you can still try for USAMO though
Yh ik
im in the US
Someone help me with this
The national jmo?
Why is one of the first problems in Marions classical mechanics so fucking difficult istg
Spherical coordinates make my brain deteriorate
i do better on AMC A tests than B tests; are A tests easier or is it just a coincidence
idk you tell me
They are built to be the same level but maa keeps messing it up but generally they are the same
where is the problem from?
i'll have a look at your problem soon
Greek junior math olympiad 2024
I sokved it with pells equation but i think u can do it with vieta jumping too
But idrk how to hse bieta jumping
are you aware of AOPS?
if u just want solns you can see solns on AOPS, but i can have a look at ur problem soon if u want me to
There is a solution posted but j dont rlly understad it
From the greek mo site
also i think that aops doesnt have the solutions for jmo
for greece atleast
it would be great if u could solve it
and helpful
lmao for this q doesn't analysing the case x=1 just work
anyway i haven't spotted the pell's eqn soln but the vieta jumping soln i found was
Ifu want ill tell u the pell equation solution
set x=1, then we want to show y^2 + z^2 + 1 + y + z - 5yz = 0 has infinitely many solns
sure
are you familiar with vieta jumping?
Not rlly
ah k
well the idea is that we can spot that y=1, z=1 is a soln
then you think of z as a constant
for z=1, there should be 2 values of y which solve this equation
let's call them y_0 and y_1
(say y_0 = 1)
let's also assume y_0 <= z
then by vieta's formula, y_0 + y_1 = 5z - 1, which tells us that y_1 > z is an integer
so (y_1, z) is another pair which works
then repeat this process
oh thanks
u can also let x=1, y=a-b ,z = a+b a>b so after some calculations u get the equation $$7b^2 = 3a^2 - 2a - 1$$. multiply by 3 and after some more calculations u get $$(3a-1)^2 - 21b^2 = 4$$ so let a = 2A+1 , b= B so u get the equation $$(2A+1)^2 - 21B^2=1$$ so u get the pell equation m^2 - 21n^2 = 1
saintyzy
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
21 is not a perfect square so the equation has infinite amount of solutions (Mk,Nk) with the smallest one being (M1,N1)=(55,12)
so M_k+1 = 55M_k + 21 (12 N_k)
b= 2B
mb
hey, has anyone here ever done the International Maths Challenge? this one https://international-maths-challenge.com/
I think that’s like a scam thing I’ve heard <@&268886789983436800> ?
thats what im actually curious about
ive found both stuff that makes me think its a scam and stuff that doesnt make sense to me if its a scam
but i havent been able to find many (or, any, really) first-hand accounts of actually taking the challenge, so id like to know if anyone here had
same bruh
Find the sum of all positive integers such that their expression in base $7$ digits is the reverse of their expression in base $16$ digits. Express your answer in base $10$.
938c2cc0dcc05f2b68c4287040cfcf71
hints
play around with the numbers
narrow it down to the max number of digits in the base10
form
both the base 7 and base 16 representation should have the same length
i have never heard of it
but its problems seem too easy to have so many people participate
yeah im fairly sure it lies about the numbers on its front page
especially because if you check the wayback machine they were listed as higher in the past
what
there's no way that many people do this
the sample questions are way too easy
yeah
honestly part of my interest in looking into it is just, making a fraudulent maths competition is so niche it feels almost silly. though a scam's a scam
though part of what confuses me about it is the stuff that seems like it isnt a scam, like all the video testimonials from kids and their parents
how would you solve this (from the 2017 australian maths comp)
number of digits of n ~ log(n)
find how mnay base 7 numbers even havw the same number of digits as base 16 numbers
tkae diffent cases for number length in these bases
and solve
how
I mean
At some point the number of digits in a base 7 number will have way more digits in that of a base 16 number
I think I saw a problem something like this at an ARML practice
Most it will ikely go. up to is 2 or 3 digits
Prove that given any set of six point in the plane in general position has a subset of three point that form the vertices of a triangle with its smallest angle not exceeding 30°
just looks like a money grab
not a scam
isn’t this related
why is he saying it's bad
Hi what do y’all recommend to learn for kangaroo math competition ? And is there a book that will help
the amt one?
so basically you want to prove you can find an angle less than 30*
let us first make a polygon
that will have angle sum
um
6*180-360
=4*180
=720
and the number of angles is
6 * (6-2)
=
24
720/24
=30
so by PHP
atleast one of the angles is <= 30
so we are done
@digital hedge
DOE = DOB - EOB = DAB/2 - EAB/2 = A/4 - (90-A)/2 = 3A/4 - 45
AOD = 180-A
CA = AO/(cos(A)) (sorry for the bash)
AD = 2AOcos(A/2)
=>
cos(A/2)cos(A) = 1/4
i dont think thats correct
why?
nvm
i have a solution after this
but it is a trig bash
(as in i have to do trig)
are you dine with that?
im okay
but this came in a exam without calculator
so im trying to find geometric solutions
no
calculatorr required
let y = a/2
cos(y)cos(2y)-1/4=0
cos(y)(2cos^2(y)-1)-1/4=0
2cos^3(y)-cos(y)-1/4=0
notice if cos(y) = -1/2 this would be true
factorising out 2cos(y)+1
(2cos(y)+1)(cos^2(y)-cos(y)/2-1/4)=0
since 0<=y<=45, cos(y)=-1/2 is not a soln
solving the quadratic eqn
we get
sry for the bashiness
But how if the convex hull is not a hexagon, for example like a Pentagon or 4-gon etc?
I've found the solution which is different with this one
But I'm interested to find other solution aswell
i dont need a convex polygon, i only need a non self intersecting one
Oh so what you're doing is constructing a polygon that contains all those 6 points?
what is yours?
Let the point with highest y coordinate be v1 and consider the line l through v1 which parallel to x-axis. Let P be a point in l and P≠v1. We labelled the other points v2, v3, v4, v5, v6 such that <Pv1vi is increasing as i increases. Then dividing the cases when <v2v1v6 ≤120 or ≥120.
• if it's ≥120, then at least one of <v1v2v6 or <v1v6v2 is not exceeding 30
• if it's < 120, then
<v2v1v3 + <v3v1v4 + v4v1v5 + v5v1v6 < 120 which means at least one of them must not exceed 30.
yes
https://math.stackexchange.com/questions/1011305/proof-of-eulers-totient-theorem
for completeness can someone explain the proof for when n is a power of a prime?
ϕ(p^k) = p^k - p^(k-1)
a^ϕ(p^k) = a^(p^k - p^(k-1))
=(a^(p-1))^(p^(k-1))
And a^(p-1) ≡ 1 mod p
but that’s mod p not mod p^k right?
Oh, right. Sorry about that
do u see how to do it otherwise?
Oh someone showed it to me so I got it
find all pairs of positive integers x,y,z with z odd such that $$2018^x = 100^y + 1018^z$$
saintyzy
i need a bit help
just started looking but a constraint I see is the power of 2 dividing 100^y + 1018^z must be min(2y,z) since 2y is even and z is odd. To make the power on 2018 match, it forces x=min(2y,z).
in fancier language, this is an example of the 2-adic absolute value's ultrametric inequality's strong property.
of course there's more to do, but nice to be able to kick out a constraint like this without too much effort to get started
christmasisoversus
^ this question was very fun to solve and very gratifying once i got it; i daresay this is the nicest looking question to involve a fractional power
i guess i'll try the problem :D
Boils down to a single factorisation over the integers
cute
i think i'll try smth else...
we know x-16 and x+43 are square numbers with a difference of 59
so we can say that there will be a maximum case for which there may be x, because the difference between consecutive squares always increases with the value of the squared number. and that minimum case will be 2 consecutive squares.
(n+1) ²- n ²=59
2n + 1 = 59
n=29
so we have 29^2 and 30^2 as the two numbers under the radical.
so x = 900-43=857
is this correct?
it is!
im trying to understand a solution to an easy problem but i cant
the problem is :
if $x,y,z$ are positive real numbers prove that $(3x+y)(3y+z)(3z+x)\ge64xyz$
saintyzy
nvm im dumb
Can someone help me with the following problem
14 - Reaching 2025 (Coefficient 14)
We can construct a sequence of integers by adding, at each step, twice the sum of the digits of the number. For example, starting with 1000, we get:
1st step: 1000
2nd step: 1000 + 2 × (1 + 0 + 0 + 0) = 1002
3rd step: 1002 + 2 × (1 + 0 + 0 + 2) = 1008
4th step: 1008 + 2 × (1 + 0 + 0 + 8) = 1026, and so on.
How many numbers can we generate, starting from an initial number strictly less than 2025, that allow us to reach the number 2025?
Thanks for your help
diabolical question
You don’t have any idea to solve this problem ?
If someone has an idea, it will really really helps me
not a fan of these typa comp qns
Not a big help 😭
Thanks.
I noticed some things like that before but I can’t find the final solution
Vanellope von Schmugz
wsg guys
Thank you !!!!
I’m French so I didn’t understand everything at the end. So how many numbers are working ?
Little warm up for middle schooler
what is the question with this function ?
Mod 9 digit strats can lower the possibilities significantly
Small warm up. This is good for 6th or 7th graders so that they loose any faith in humanity
Yea but what do we have to do ? Derivate it ?
It doesn’t specify what to do with the function…
Find f(x)
By simplyfing the expression at the right
We already have f(x)
I mean simplify the expression at the right of the "="
Ahh ok
I found this on tiktok and there´s an more fast answer
What is it ?
It is 0
Why ?
That’s the derivative
(It´s in french so idk the english of it) I think that´s because at the bottom there´s an constant i didn´t watch all video
Stop you're giving me nightmares
this is just a random splurge of symbols
there is no answer because you've written nonsense
it's like "solve $\sin(magic(x)) = \exp(\ln(-\pi)) + \sum_{x=\pi}^{lmao} gigafactorial(x)$
LY
like...no there is no answer because you've not written an actual problem
This is not me but an populat french math tiktoker who resolves problems and he said it was 0
زَكَـرِيَّـا | ⵣⴰⴽⴰⵔⵉⵢⴰ
129
Yeah i knew i shouldve used am gm
But got confused cause o thought 3x+y>= 2√3xy
😭
But its four terms
Why?
Well like say they were asking for the max but didint have gamma or delta in absolute values
What would your answer be?
A
Why?
I doubt if |f(x)|<=1 h then how did max|f(x)|=9 come
2=1+i2
lol whos that realy stupid guy
Is f(x)<=|f(x)|?
<=1
Yeah both are less than or equal to 1
Now what if I ask about the max
If |f(x)|<=1 for all x in -1 to 1 then what do we know about the maximum value of f?
It must less than or equal to 1
Yeah not sure
My default is to say none of these because there doesnt seem to be enough information to get bounds for finding a maximum
Means it's correct?,
Well no you have enough information to say it cant be the other answers right
Break it up into three cases,
gamma,delta >0
gamma,delta<0
gamma > 0 delta <0
If you have case 1 then with the assumptions of the problem you automatically have its less than 1
Yeah did it once bro
Case 2 I think you can use reverse triangle inequality on f(-1)
Same with case 3 too
So like
Mah
I dont see it
Wait nvm
1/delta is less than 1 since |f(0)|<1
I think gamma/delta might also be less than 1 depending on assumptions
But this seems messy I wont lie
I dont know where the x^6 comes from
That entire expression is mysterious to me
X^6+x^4 and so on
This is unclear to me
Where are you getting these first equations from?
Like you are saying cauchy schwartz?
But I dont see how that fits
Oh like you are dot producting them
I sorta see it then nvm
Its not too helpful for getting bounds tho
Oh
Maybe you can take f(D)-f(-D)?
We know both are less than 1 individually
So like |f(D)-f(-D)|=|2D(DB+1)|<2
implies |D(DB+1)|<1
Not too helpful
(f(1)-f(0) )- (f(-1) - f(0) )gives something else
Yeah
If they had asked about the supremum instead of the maximum, the answer would have been 7, since we could take polynomials arbitrarily close to 4x^3-3x. But as they ask exactly max the answer should be (D). I think the answer 10 is ruled out, although I can't prove it rigorously.
How were u and v chosen here ? And at last,where I have marked,how it came?
any root of the equation z^n=1 has this form. You can just substitute and check. As for cosine, just draw the unit circle and mark points on it for which cos(alpha)>=-1/2.
Though I think that the phrase 'there are 2*673 possibilities of m for each k' is a wrong statement. So the final answer is not correct.
That's what I've said above. So, the correct answer should be (D)
Then what is the correct answer?
1682/3027
can someone recc me a nice combigeo?
$$ 2024 + 1 = Goodbye 2024. $
I dont get this argument regarding supremum
It looks like you can make this max as close to 7 as you want, but you can never reach it with some specific non-zero alpha, beta, gamma, delta.
Anyone here who knows about Fubini Integrals?
4x^3-3x doesnt get close to 7 though?
Oh you mean for the max though
Yeah I see that
Chat why is the amc 10b aime cutoff 10.5 points higher than the 10as ???
i think i did this problem a long time ago, but i think this was a fairly decent combigeo
this is somewhat combigeo
what exactly do you mean by this?
also this would belong in #real-complex-analysis or #advanced-analysis depending on what exactly your asking
Thanks
i've tried searching for fubini integrals but i can't find anything
did you perhaps mean fubini's theorem, which is about integrals?
or were you more just asking about generalising integration?
oh thanks a lot
yes- so those specific integrals are called fubini integrals
i don't think i've ever heard anyone refer to them as fubini integrals
fubini's theorem is about integrating over product measures and is often applied in the case where we have the lesbesgue measure i.e. the lebesgue integral
also what are you asking about?
yeah I mean they call that iterated integrals I guess
yeah i think that's more common
No need to ask “Can I ask…?” or “Does anyone know about…?”—it’s faster for everyone if you just ask your question! See https://dontasktoask.com/
yeah I had a doubt with a particular question-
if it's about measure theory, post it in #advanced-analysis
alr, thanks a lot
guys
i just came across a suspicious server
that seems to be leaking answers to AIME
i left only seconds after i joined
it's called "anti-maa"
there is something seriously shady about it
i think i should just join back and report
how do i report it my fears are confirmed
code for server
someone help me report it
please
broski
just report it
how did they even get aime answers??
i would highly doubt it is real but still report it
also i would recommend
not to put the code
you are just giving more people the opportunity to join
idk how to 😭
bro
i found out theres an entre network of these crooks
💀
there always will be
i would recommend the best thing you can do is not tell regular people about it
you could report to maa staff, and hope that all comp math servers such as ommc and tops oj insta delete any ads
or you could report this guy to them beforehand
Hint: There’s a cyclic quad. Find it.
Hint 2: ||Power of a point|| tells you that ||(KM)(KN)=(KO1)(KO2)||.
lol
It's wrong
Two real numbers, x and y are chosen at random over the interval [0,1]. What is the average of the value ceil(10x-y) - (10x-y)?
the expected value over a uniform range is a+b/2 right?
so wouldnt x and y expect to be 0.5
so wouldnt it be 0.5?
or am i wrong @torn gate
Not all values of 10x-y are equally likely
oh yea ur right
<@&268886789983436800> advertising
why were the moderators advertising
You ping mods if someone is advertising
hi guys! does anyone know any sources to learn olympiad geometry from scratch?
i mean i do know like id say 60% of the theorems and stuff but my mind goes blank the second i see a geometry question
How does a server get their hands on AIME answers 😭 😭 😭 😭
The euclidean geometry in mathematical olypmiad book is really good
its free to
except it does use some more advanced stuff and techiniques
you can also try grinding alcumus aops
? This follows directly from the fact that $O_1 O_2 MN$ is cyclic
Civil Service Pigeon
No it’s not (unless you pirate it)
I found a website that gave the url out
probably pirating lol
yeah i got a pdf from a friend, thanks again!
Np
Nah website seemed legit
o hm interesting
Ye and it didn’t force me to download anything either
It redirected me to the pdf
Is K a random point ?
someone signed up as a proctor, got the answer key a day early, and sold the key to kids in the server
the guy even sent a picture as proof
Yea it’s pirated but
Who doesn’t pirate
Pirate to see if it’s good then buy it
A group of 10 people visited a bookstore. It is known that:
1. Each person bought exactly 3 books.
2. For every pair of individuals, there is at least one book that both have purchased.
What is the minimum number of people who could have bought the most-purchased book?
I need a better way to solve this!!
and you draw a graph from books to ppl who bought the book
so you get degree of each person is 3
and that any two ppl are at a distance of 2
and you have 10 ppl
hm
so let us say a person get 3books
and those books are shared with all 9 others
so we have
that
(by PHP)
there exists a books which is bought by 4 ppl
now the only construction which works for this
is if all books are bought by 4 ppl
but you have 30 buyings
and
4 doesnt divide 30
so
some book must be bought by 5 ppl
notice 5*6 = 30
so just have 6 books
and have any person by 3 of those books, this is possible to do with overlap in any two ppl, since there are 6C3 = 20 ways of buying 3 books, and overlap doesnt exist only for 2 buyings, so there are 10 pairs of buyings in which overlap soesnt exits, and we can have each person buy from a different pair, and so all buying will have overlap
so we are fone
sigma boy bad
can someone explain to me how to solve exponential diophantine equations
for example 3^x + 4^y = 5^z which is a rlly simple one
No easy way
Just bashing mods and residues is really the only way
hm
3^x=5^z-4^y
if x =0, we are done
3^0+4^1=5^1
z is even
3^x+4^y=5^2c
if y = 0, then there are no solutions
x is also even
3^2a+4^y=5^2c
if z is 0, there is no solutiom
2^2y=(5^c)^2-(3^a)^2
2^2y=(5^c-3^a)(5^c+3^a)
both of these are (non 1)powers of 2
2^r and 2^j suppose
2^j-2^r = 2*3^a
so
(2^j-1)-(2^r-1)=3^a
so
r = 1
so
5^c-3^a=2
and
5^c+3^a=2^j
so
2^(j-1)+1 = 5^c
if we are allowed to use catalm this is trivial
j-1 = 1 or c = 1
only
2^2+1=5 works
j = 3
r = 1
2y=j+r=4
y=2
so
3^2+4^2=5^2
@reef condor
why is z even
oh because $$(1)^y &\equiv (-1)^z\mod{3}\$$
yep
saintyzy
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
and x is even because u took mod 4
$$ 2025^x = 5^y + 2000 ^z$$
find all solutions to the equation $2025^x = 5^y + 2000 ^z , x,y,z \in \mathbb Z$
saintyzy
Consider the powers of 5 on each side for a start
(The greatest power of 5 dividing LHS and RHS should be equal)
do you know how to figure out the number of discontinuities of this function?
try the values were [x+n] or [x] changes
and see if those points are discontinuities
rgar way you can see which value of n has how many discontinuities
are there any good tools to make a prep plan for next years math olympiad?
study what you like and when the exams are nearby mock the sample questions of the oly you’re taking
"Guess what? I haven’t showered since last year!"🤣
do you have the a_0, a_1, a_2? If you calculate some examples it might help
So I barely qualifed for Aime
And I am a sophomore
And I was wondering if getting into usamo even matters senior year for college apps
It can
Wdym
Ur question is asking about
Doing usamo senior year
Or doing usamo for college apps?
If you do good enough on the aime senior year and qualify for usamo will you be able to put it on your college application or will it be too late
Brooo what grade lvl
JEE MAINS level
Oh it’s jee
Yea
could someone drop a solution?
Do you need full solution?
For college apps yea
It should be understandable how you got further steps
@radiant jasper you are blackpink fan a BLINK💜!!
ok
Lemme see
so each discontinuity occurs at x = k-n, where k is an integer. To make sure that x falls into the interval, we set the boundary -2<k-n<1, so n-2<k<n+1. The number of integers that satisfy this inequality is 3. So, for each n, there are 3 points of discontinuity. Since there are 2026 n values, there are a total of 6078 discontinuities.
There are 2025 n values and the options are 4 3 4052 and 2027
Btw even I got till getting the three inequalities but after that finding the summation I am stuck
floor of (x+n) = floor of (x) + n n-> integer
isn't it 0 to 2025? so there are 2026 values of n
Yeahh
There are exactly 2 discontinuities for each n, because there are two integers in the range (-2,1). So the answer is 2*2026=4052.
In chess, a king threatens another king if, and only if, they are on neighboring squares, whether horizontally, vertically, or diagonally . Find the greatest amount of kings that can be placed on a $12 \times 12$ board such that each king threatens just another king. Here, we are not considering part colors, that is, consider that the king are all, say, white, and that kings of the same color can threaten each other.
saintyzy
$Happy:\left(\sum_{i=1}^9i\right)^2$
Aestusy
treat each two pieces as a 3x3 grid
one of them is in the center and the other is in the edge
we want to minimize the number of areas a king gets so we put him in the edge and corners
so we get 12/3 * 12/3 = 16 * 2 for each 3x3 grid which should be 32?
@deft marsh is that right
or can we do better
ill check it out tomorrow cause im going to sleep rn
but the answer is not right
im thinking it is 40
if u want i can send it to u
yeah can u send
56
im not sure yet im trying to get a solution but ill check it out again tomorrow
Will anyone comment on my videos if i upload some math videos on yt🥺
whats the name of ur channel
Havent made one yet
oh alr
I will
36
with proof
take the 36 2x2 squares
each square can have atmost one king
so atmost 36kings
now just put each king at points which can be marked (even,even)
clearly no king can attack another king
and this config has exactly 36 kings
so
atleast 36 kings
so there must be 36 kings
the answer ive seen was 56
We have a standard chessboard with dimensions ( n! \times n! ), where ( n \geq 2 ). We remove the top-right and bottom-left squares. Can we cover the remaining chessboard with ( n \times n ) dominoes? Each domino can be placed either horizontally or vertically, covering two squares of the chessboard.
saintyzy
Aestusy
eyy 56 is possible. no idea how to get the solution though
^
Is anyone here taking the waterloo math contest?
I keep getting the same scores on the practice, and the score is like 2-3 questions away from making it to the honor roll
How can I break this barrier?
No. Just shooting of the top of my head. n = 1 yes. because you said nxn right and you removed from the top corner, so you can't ahve 1x2(n). So your grid is going to collapse when you remove those corners, everything is going to shift, you will need 1 x some number. I Think.
in these squares, some kings attack each ither?
what do you mean by nxn domnioes?
oh
i misread the qn
i though it means no king threatens another king
sry
the answer should be
hm
so
let us say there are n kings
then adding the 4 diagonal adjecencies and the 4 normal adjecenies, we get there are n attacks
we know that in a 3x3 square there are atmost 4 kings
so we get an upperbound of 4*16 = 64
hm
we can use that in the 3x3 surrounding a king there are exactly 2 kings
and combing there arenas
we get
14
14/2 = 7
14^2/7
=
28
hm
how many arenas can share a point
upto 4
so
so
the problem says $n \ge 2$
saintyzy
Hi
So I barely qualified for aime and I was wondering how difficult the Sumac and Promys entrance exams are compared to aime
Did u take the amc 12?
which book is good for preparing for cemc cayley
Oh ur taking it too so am i
D - 54
which resources are you using to prepare for it
Just practice tests
U?
Harder but more time
Definitely harder though
just doing past problems, doing what I can
Ah same here
What do u usually get on the practice tests??
I can’t do 24 or 25
23 if the question is my type
Who wants? 1650 questions in total (50-100 questions each topic)
woah I would like to see
is that x^3 + 3x + 29
na it's +2 , there's a comma after tht
also you can try this if you want it is good but u might do it
( More than one correct )
If need solution for this DM me
this is ez
r u sure
u r from which country
thanks
actually i take it back
@sick tapir
it was good i mean challenging
i have a way more tougher question wanna see
Korea
Bro i answered your qn in pre calculus
i'll pass wanna go basketball
i saw it u r right
its ans are 16 and 666
cya boys in 2 hrs
nah bro matrix is way too ez
i only love calculus and trigo
and geometry
i mean i love MATH
cy
u know its questions from world toughest exam
2nd toughest
it is held in our country
bro but its tough for me
definite integration and seq series 💀☠️
bruh i am in 8th
Why u solving jee qn's then lol
because till 11th i have completed
now 12th started in winter
break
from 5th i have only one goal
360/360
1st person to do so
but thing is that
i only study maths and physics
ur class
12th
Nah focusing on jee rn
its better than it
And the questions asked In the exam are way too easy .. it's just about the speed
have heard same line
its good to watch anime with study
Could someone help me with P4a
Split the sum into odd and even terms
This will allow you to get rid of the floor and hence use |xy|<1
Is that greatest integer function? In the exponent
you mean this [x]?
Me
ik every exam is world in which mathematics is there
cause my favourite subect is MATH and i cant afford to lose even 1 single mark in MATH
Wth 😂
and your JEE ik it very well its hell too ez for us and the math which comes in it is very low level
Come to MIT then we'll have a chat
☠️💀☠️💀☠️💀
I strongly disagree with you here
some1 from indian named Chirag is at MIT i m his friend he showed me his question and they were average
but not too good that can;t be done
Just so you know jee is given at the age of 17
but i deeply respect you all for giving it at an age of 17
Yeah bro i think this level of mathematics is good enough for 17 y/o people
for a 17yo i agree
Bro have you ever tried the book "50 challenging problems in probability"
no
sorry for bothering but could you show me the next step after that. I got two sequence and used geometric series but it seems did not work
Yeah bro its difficulty level is extreme for me
You will definitely enjoy it if you like solving difficult problems
Uh I haven't done it but it might be easier to set |xy|=r
yeah ido
wait tell me is this the one
which one of these 2 iis it
and can any1 try my own made question
ya
Ahh i hate conics
Bro i dont remember shit in hyperbola
Where the f is its asymptote ... Is it its directrix
still try any1 ?
nah
see the image
hey
wanna see just the result of the area what it came out ?
or i should send the detailed solution
Yeah send it maybe I'll revise hyperbola Tommorow and then try the question
check dm
hu ?
I found the equation of tangent by derivative but its different
send the pic
Oh sorry calculation error
I didnt even differentiate the constant 💀
T=0 better fr
ha ?
ohhhok
well its ok
you can try your methods
but just remember to mark the steps pls
yeah ik T=0
i just couldnt connect to it cause u randomly said T=0 better
mb
it can be applied but it will go long
want it ?
tell me topic ?
why dont you do its full solution and give the numerical value
Bro 💀 factorials
is 4 in N or D
N
wanna do 1v1
r u in mit currently
thats my spirit
and in jee it includes pcm all 3 subjects in limited
and its way tougher than mit entrance exam
INDIA WILL ALWAYS LEAD MATHS
and i will prove IIT>MIT
as an indian, ek baat kahu?
it's seldom that we see an indian winning in a prestigious competition such as IMO, THE math olympiad.
the type of questions that are asked in iit-jee math and ESPECIALLY mcq's require rote memorization of formulas; while it can be really useful, doesn't truly test mathematical and logical thinking to the fullest extent.
a more well-rounded and smart 12th-grade-end advanced math paper would be smth like HSC math extension 2.
bro stop texting N study
texting?
you are an undergrad. should care a little more about yourself then to tell a 13 year old what to do.
ik i care abt myself
but like isn't undergrad supposed to be hard
like maybe you should study a little more?
because i'm still young and i dont need to study too much
doesnt mean ill study 16 hrs a day
so you expect me to do so?
na even if u studied that much u will fail
enjoy
how can you make that assumption?
give me your basis man
coz ur dumb
im not going to argue, i just want to know why you made a handful of snide remarks right now.
in what way?
every
explain bro.
well, first of all, you have some french in your bio.
do you know how to speak french?
im an indian but i can.
kinda
oh
vous pouvez comprendre tout ce que je parle?
lemme get translator wait
and even then you call me dumb?
please don't be rude. this is a math forum not an argument club.
idh much time to focus on other langs like u
study 16 hours a day then
learning lang js requires practice not skills
ur dumb if u will study that much ur brain wont get rest
skills are earned through practice.
just like in math.
learning lang isnt skill
language is a skill.
of conveying things elegantly
of speaking and drawing words easily
i understand that nothing constructive can be done with you in this state
i will stop talking over here. do as you please man
times up kiddo
dont be rude, peace out
piss off
very troubled individual
💀
@split quail you know better than to say anything you've said here. come back when you can be nice to others. or don't.
Battle of virgins
😭🗣️‼️
nah i dont care dw
hey man, you're in 8th grade right?
i see that u completed ur 11th grade syllabus as well :o
eww noo 
is this bullying
Made some good points on competitions
def
well he could have at least @ them
ur taking too long to type @fossil adder
see, problem solved
Bullying is way better than high testosterone virgin fights in mathematics
wtf
what r u talking about now
Iykyk
why better 
Plus calling someone immature is not fucking bully
and as far as i can tell no ones passive aggressive
Get it right
I’m not implying anyone here is
what are u an english person
I’m saying in general, people in Math
no clue why u say that but ok
Go to college then you will find out
i dont have money but sure maybe one day
i literally dont get what ur going on about high school stereotypes
I’m not talking about HS
yeah well it sounds like it
where
^
Maybe communication is not your strong suit
Rather not get into it, let people continue their debate on math competition
You should go to college btw, if you’re interested in mathematics
none of ur business
Just a suggestion
Very sincere suggestion
Cuz internet is not real
well tht's a debate on it's own
is this competition maths
no
ok
x~/~x+n/k since n goes to infinity
True
How do I learn the material on Promys and Sumac
Wtf
Grind comp math
pumac susus
avg pumac a8 impossible question
good question
there you go have fun
Btw indian boys
i m learning hindi also
i learned NAMASTE BAI KHAISE WHO MERA NAME RUDYII HAI
its namaste bhai kaise ho mera nam rudyii hai
OK
yes
i m on holidays thats why i joined this server , in 3 days i wont be online anymore
ohk
what you wanted somethin from me ?
hmm
when n is even, we can instead rewrite all instances of n with 2n, thus simplifying some fractions in trig.
so pi *n /24 becomes pi *n/12
we could do some more...
there's a certain point at which cos(pi * n/12) = cos (pi *m/12) although m and n are distinct integers
taking cos(pi * 0)=cos(2pi)= (cos(24pi/12))
So the denominator actually repeats itself!
every 24 numbers.
we'll calculate the same for odd summation.
we replace n with 2n-1
so cos pi *n/24 in any case becomes
cos (π(2n-1)/24)
so we now take
cos(π(1/24)) = cos(π(1/24)+2π)
cos(π(49/24))
49 is 2n-1 where n is 50.
