#help-49
1 messages · Page 275 of 1
there actually is a way to calculate that by hand but it is fairly advanced
Do you even know how to divide on a paper?

Closed due to timeout
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Kind of unsure of how to do this
for context
so $L(\alpha, \theta)= \left( 1- \left( \frac{\alpha}{x} \right)^{\theta} \right)^n$
wai
and I need to maximise this wrt $\alpha, \theta$ right?
wai
I don't get the values of x given
Like do I have to maximise $\prod_{i=1}^{5} \left( 1- \left( \frac{\alpha}{x} \right)^{\theta} \right)^n$
\prod
wai
Closed by @twilit field
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Guys I need help with the following series :
Limit as N approaches infnity Sum(F_n) where sum goes from n=1 to N
your series is $\sum_{n=1}^{\infty} F_n$ and you are 100% sure you wrote it correctly?
Ann
Where F_n is the nth fibonacci numbe
yeah
not 1/F_n not anything else, just summing the fib numbers straight?
are you REALLY sure
picture please.
my bad
The sum is correct , just the terms are reciprocal of the fibonacci numbers
This question came into my dream
Then tried to solve but couldnt, so asking for help here
$\sum_{n=1}^{\infty} \frac{1}{F_n}$
Ann
do you want value or only convergence status
ratio seems most straightforward
This is the real challenge
yeah im wondering too
and an OEIS entry too
Btw can you pls teach me to type in latex
from here
\frac{}{} makes fractions. first {} is the numerator, second is the denominator
\sum makes the big sigma symbol.
_ is for subscripts, ^ for superscripts, and by extension also gives you lower and upper boundaries on summations and integrals
if your sub/superscript is more than a single character long, you need to wrap it in braces
(also, recommending OP to visit #latex-help, esp. the pinned message there, for some LaTeX beginner guides and cheatsheets.)
e.g. $a_10$ vs. $a_{10}$
Ann
also yes this
Thank you so much for helping me
anything else? if not, you may close this channel, and see you around
thank you so much for thanking him.
Thank you so much for Thanking me to Thank him
thanki you so much for thanking me when i thanked you for thanking him
... yall done?
okay folks, let's not

no
Bro maintain the dignity of the group
btw neither hanako nor i are a "he".
ok
it?
...
what
we have she/her role diamonds
do you know how to read
You two are friends?
<@&268886789983436800> transphobia?
hello, omg see it is a @lyric charm !!
wow
No way
That is rude as fuck
how is it that you see "we don't use he/him prns" and your default assumption is "it" of all things.
not rude
right folks, if there's no other question here, please just close this and move on, OP.
it is @lyric charm 's discord account
That's rude, stupid and uneducated. Please be better next time?
-# hi bubblesssssss 👋
ok 
Then as fun I converted the inputs into Biryani numbers
biryani numbers?
Then saw the the outputs are obtained by reversing the digits of the input
Omg i love biriyani but what are biryani numbers
Sorry my bad , Binary Numbers
oh but then f(n)=n means n is a palindrome in binary doesn't it
This called for Induction
I need help for the Induction
How to prove the conjectured hypothesis via Induction
yes, you are right
think you want strong induction
Then it boils down to a combinatorics problem
that, or prove that g(n) = binary reversal of n satisfies all the same properties that define f
Can you elaborate on this?
define a function g by your conjectured rule
g(n) = number obtained by reading the binary digits of n in reverse order
show that it satisfies all the same properties that the question gives you about f
it'll follow that f=g
btw are you into MO?
MO?
Mathematics Olympiad
no
You are a College Student?
wrong again
@nova lava Has your question been resolved?
Closed by @nova lava
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Suppose A is an n x n Hermitian matrix of rank k < n. I know that it then has a k x k principal submatrix with nonzero determinant. I'm trying to figure out if it's possible to move this submatrix to the top left corner by consecutive row and column operations, and then also have the remaining entries in the matrix be 0 by consecutive row and column operations.
Thus I want A to be congruent (or equal?) to P^t UP where U has the principal submatrix in its top left corner and 0s everywhere else (and P is a product of elementary matrices).
Yes you can
P is a product of elementary matrices
Correct me if I'm wrong, but this is the same as just saying P is invertible, right?
Yes
Ok. I understand the part of moving the principal submatrix to the upper left corner by consecutive row and column operations, but I fail to see how its possible to get the rest of the entries to be 0. I feel like there's a bigger underlying theorem/result that motivates what I want.
hello and welcome to the server. if you want to chat, go to #discussion or #chill. if you want help, then open your own help channel.
(see #❓how-to-get-help for instructions)
can i like ask any level of math doubts ??
yes
alr
but not here
ikik
This problem is beyond me
But I'll caution about applying any results that are actually about P*UP (conjugate transpose)
Applying permutation you have a matrix of the form (A,B;C,D) with A invertible, A can eliminate B,C and you will find the place where D was will be 0 by rank of the whole matrix being equal to the rank of A
Since evidently despite being a complex matrix were interested in P^tUP
U^h(A,B;C,D)U does make your matrix of that form where U=(I, -A^-1 B; 0, I)
So yeah that invertible matrix can be unitary (given that (A,B;C,D) is hermitian (A^h=A, C=B^h))
(A B; C,D)=Q^h (your original matrix) Q where Q is a permutation matrix, so it can be done by a unitary matrix, not necessarily a orthogonal real matrix
So not an orthogonal P, but a unitary P. Not P^t but P^h (conjugate transpose)
Ok. Thank you. Since my matrix is Hermitian, we have B=C^h, right?
Yeah
Are you sure that U=(I, -A^-1 B; 0, I)? I was looking at a decomposition involving the Schur complement, where we have the following formula:
Ah wait, I think it works.
yeah, I was thinking about why the Schur complement is 0
so you mean D has the same rank as CA^{-1}B?
I didn’t mean that but it is obviously true
Since D=CA^-1B
What I meant was, rank(M, 0;0,N)=rank(M)+rank(N)
And do we know that (A,0;0,D-CA^-1B) has the same rank as (A,B;C,D)?
rank(A)=rank(A, 0; 0, D-CA^-1B)=rank(A)+rank(D-CA^-1B)
Only zero matrix can have rank 0
Yes, multiplying by an invertible matrix doesn’t change rank
Closed by @inland patio
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
kinda random question but is there a name for inequalities like nesbitt's inequality?
like notorious/famous algebraic inequalities
i want to look into more of these inequality identities
Yes I think the name is Nesbitts inequality
🥀
not sure wym by that
oh wait, you mean another name for nesbitt's inequality? or like a random famous inequality name
yeah
Maybe you would say it’s a rational inequality
2nd one
So, some famous one are AM-GM-HM, cauchy schwarz, titu's lemma
yuh
those r like
lwk exactly what i've been looking into
cauchy schwarz has many variants
https://en.wikipedia.org/wiki/List_of_inequalities
there's a wikipedia page but they're so egregiously out of the scope of what i'm learning that i don't think it's worth it to
This article lists Wikipedia articles about named mathematical inequalities.
like
go through it
Each has a name
titu is derived with cauchy, right?
yeah
oo
I suppose high school competition math has thousands of inequalities
It does
yeah actually
i should look into IMO
I have learnt at least 20
I forgot all of their name btw lol
Closed by @buoyant linden
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Integral 0 to infinity k e^(-a r⁴) 4 pi r² dr
I don't need the exact value just need to get 'a' out of the integral
$\int_0^{+\infty} 4\pi kr^2 e^{-ar^4} \dd{r}$
Ann
Original question was
The number density of molecules of has depends on their distance r from the origin as n(r)= k e^-(a r⁴). Then the total number of molecules is proportional to
(a) k a^(-3/4)
(b) sqrt(k) a^(1/2)
(c) k a^(1/4)
(d) k a^(-3)
I need to integral to be independent of 'a'

ok i think i see where you are going with this
you want to write the integral so that all a's appear only outside of it
u := ar^4 lmao
$ar^4=(\sqrt[4]{a}r)^4$, maybe let $u=\sqrt[4]{a}r$ then?
;(
Wait
I don't need to do all this
i was gonna do it in such a way that results in a Gamma integral
Dimensionsal analysis works 
@tardy bloom Has your question been resolved?
Closed due to timeout
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Why the homomorphism function is like that
I mean i know homorphism is a tool to compare two groups structure
But how this definition make us deals with that (comparing two structure)
in words, the property given here means this:
if we run any two elements through the homomorphism, then operate on them in H,
the result will be the same as if we'd operated on them in G and then run the result through the homomorphism.
in other words a homomorphism is a function which allows this sort of "translation"
you may know an example of one of these by another name:
the exponential function x ↦ e^x is a homomorphism (an isomorphism, in fact) from (R, +) to (R^+, *)
@gaunt mauve Has your question been resolved?
Closed due to timeout
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
<@&268886789983436800>
Channel closed due to the original message being deleted.
If you did not intend to do this, please open a new help channel,
as this action is irreversible, and this channel may abruptly lock.
Didn't u hv the newbie badge a day ago?
And you also hv the helpful role? :0
Yeah I've just been in the server a lot 😆
Wow
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
how can we study the monotony
aka the derivatives
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
well it surely doesnt hurt to compute the derivative
@clear lion Has your question been resolved?
Closed due to timeout
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
On Q, if x = t, what's y=?
How are you getting x = 5t?
Sorry typo
Yes it is
how do you know
"parallel to y axis"
Closed by @urban ferry
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
@stiff bison I- didn’t do actually anything
Bro just because I have a personality doesn’t mean I’m a robot.
Unlike other people here…
Yall expect people to be sad, depressed, calm and boring..
💀 ?
Closed by @bold peak
Use .reopen if this was a mistake.
AND AGAIN someone pinged mods for no reason on me.
NO IM NOT TROLLING.
What's the matter? How about you both go on with your day/evening? 
/night
You were either
- Ragebaiting
- Being a racist
or 3. Being oblivious
go sleep xavier
It’s Christmas and it’s a mess on this day.
I suggest you direct any similar claims to ModMail where the team will investigate the situation 
I wish y'all a Merry Xmas, and please move on now 
I needed help and they just closed my channel.. for no reason.
.
Fine.
I don't see a question.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Now this is equivalent to solving for $7x^2+5x-9=x$
waimas
ofcourse I could factorise as a product of two linear polynomials but that'd be pretty useless
But that's basically finding the solns
oh hi
we won't require fixed point iteration anymore will we
hello
no
you are supposed to find the roots of g
brb
you want to express g(x)=0 as x=f(x)
so $7x^2+4x-9=-x$ for instance
waimas
no
Like if I have $7x^2+5x-9=0$, I have $7x^2+4x-9=-x$ no?
waimas
sure but thats not what you want
i mean, sure, but does it converge?
A fixed point problem wants you to solve something of the form f(x)=x
I don't follow
Why are you trying to solve something of the form f(x)=-x
dont think about convergence for now
yea, so here I have $9-4x-7x^2=x$
waimas
alternatively $x= \frac{7x^2-9}{-5}$
waimas
cool
As for convergence you're talking about the derivative being less than 1 near the roots I suppose
sure but idt you can use this for fixed pt iteration
The question just asks us to reduce one problem to another.
sure, but the problem asks us to reduce it to finding the fixed points of some other function
It doesn't say that the fixed points need to be found via some method.
"via fixed point iteration"?
Well, I completely forgot about that. In my mind the question started from the part about "in other words.." which just asks to reduce one problem to another.
hmm
@twilit field Has your question been resolved?
Closed by @twilit field
Use .reopen if this was a mistake.
.reopen
✅ Original question: #help-49 message
to verify that this works I have to show there exists an interval around the fixed point in whihc the derivative is less thn 1, right
.close
Closed by @twilit field
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Am I supposed to convert the first matrix into the second one using row/column swap operations
you could just draw the graphs
proving that is a pain isnt it
i'd have to prove that the graphs are isomorphs
Sure, but it may give you reason to suspect non isomorphism, and it doesn't hurt to take a minute to draw it anyways.
Check whether two matrices are different up to row/column permutation
can i use row and column operations on these
And pay attention to ranks
i will only swap
Just swaps, yes.
Which one, b)?
yea
1st is easy
two swaps
btw if i had adjacency matrices can i do the same
but i have to preserve order
dont i have to follow every row swap with a corresponding colum swap
and vice versa
Yeah PAP^t
wat is that 💔
rows and columns doing the same permutation for adjacent matrix case
PAQ is arbitrary column and row swaps, but PAP^t forced the row swaps to be followed by corresponding column swaps.
how do i know when to stop
i mean i'd be doing swaps forever this way
if they are not isomorphs
That's why you draw pictures... You have argued non isomorphism before as well.
It will tell you what to do
like the c part in this looks like they are non isomorphic
You can also do some counting arguments I think
To save your time. b) check rank. c) check eigenvalues
I mean these methods are simply overkill here.
Yes the first step should just be drawing the graphs
Sure, they are valid methods. I don't disagree
Oh, just want to save his time on b) , c), in case he tries dozens of permutation first
man this is dumb
these graphs are squares or smth
herzog is right
i'll just draw them its easy then
i will draw the graph
for c, first is a literal square and the second is a straight line
Sure. Whatever works
yea ty
i will draw the graph if its a 5x5 or 4x4 matrix
thanks guys
.close
Closed by @split ingot
Use .reopen if this was a mistake.
.reopen
✅ Original question: #help-49 message
alright isomorphism question
u2->u3 and v2->v3 are the only ones different here
how to write this in a formal way (for exams and stuff)
?help
Said some dumb thing ignore this
!help
To ask for mathematics help on this server, please open your own help channel or help thread. See #❓how-to-get-help for instructions.
Maybe try to show they might be isomorphic first?
I don’t know. Might make no sense. Because it’s like choosing two different vertexes of the same graph
but the edges are different, can they till be isomorphic?
can anyone help me at ( a )
Oh
like all the other ones are same, its only the problem with a single edge
Both 2 circles
@shell granite This channel is currently occupied by
another user, please take this to
another channel
so what about the question guys
Found the permutation
what is it
PAP^t on the first matrix A where P=(0,1,0,0;0,0,0,1;1,0,0,0;0,0,1,0)
are you talking abt the earlier question
I was talking about this
so did you find an isomorphism
how did you do that
i drew thhe diiagrams of both and theyre identical
(Outer degree, inner degree)
Both graphs four vertexes
(2,1),(2,1),(1,2),(1,2)
So you only have four possible choices
By examining case by case exactly one worked
wat abt dis one'
What do you mean
Yeah
.close
Closed by @split ingot
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
look at the degree of each individual vertex and not their sum
its gonna be even
so n = 2m
n-1
right
indeed
and K_n has a path
circuit mb
what if they asked me abt the path
exactly two vertices have odd degree
all vertices in K_n have the same degree
therefore if you are in a "2 vertices have odd degree" then those 2 must be the only ones in the graph to begin with
and C_n has an euler circuit for all values of n right
C_n graphs start from n>=3
yes. it is its own euler circuit
Closed by @split ingot
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
isnt it exactly two in case of euler path?
An Euler circuit is an Euler path
@split ingot Has your question been resolved?
There's an Euler path if there are two or zero odd vertices (can't have an odd number of odd vertices)
In the zero case it's a circuit
single vertice of odd degree is impossible?
alr yeah it is
handhsake lemma
Yes
Closed by @split ingot
Use .reopen if this was a mistake.
Exactly two for "path but not circuit"
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
in these problems, can i remove as many edges as i want (as long the graph stays connected of course)
Pretty sure you can only remove a specific number of edges
All spanning trees have the same number of edges (one less than the number of vertices), so the difference is always equal
well if i try to remove m-n+1 edges from a graph with m edges then i will ultimately end up with a disconnected graph
No?
In (2), there are 5 vertices and 6 edges, 6-5+1 = 2, you can remove edges a-b and b-c for example
Still connected, and it indeed yields a spanning tree
i think i meant more than m-n+1
that would give me a disconnected graph
m-n+1 is the number of edges i need to remove to convert it into a tree
Well yeah, since that would be equivalent to removing an edge from a spanning tree
Closed by @split ingot
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Hi guys, could someone help me as to how to label this diagram?
I dont know where to resolve the forces
i think its something like this?
and then where do i add 4gcosalpha and 4gsinalpha
and mgcosalpha and mgsinalpha
You assume the system goes one way and put everything in terms of the accelerations
And because the string is taught they both have the same acceleration
So for one side you set the net force equal to tension minus gravity minus friction and the other side gravity minus tension minus friction
it would be better to resolve the tension into its sin and cos components rather than gravitational force in this case
I dont think so, since you need to resolve everything up and down the plane
i heavent done these questions in a while but cant you just resolve the tension, put the vertical component equal to the weight and find tension in terms of g and then as tension on both sides is equal you can just equate them?
Hmm yeah perhaps
yea ok let me try that thank u
But you also need to deal with friction
isnt the surface smooth?
but i need to resolve the weights into components
It mentions coefficient of friction at the bottom
oh nvm only one is smooth
so mgcosalpha and mgsinalpha
and i dont resolve the tension right?
cuz its already along the plane
Yeah like @atomic mist said you can also resolve them vertically and use equalibrium but it works both ways
mgcosalpha for reaction force and sin for gravity along plane
okk tysmm
so like for the yellow part
i resolved P particle
did i do it right
legt is 4gsinalpha
left
and down is 4gcosalpha
and then equate R = 4gcosalpha
In the yellow box the plane is the horizontal?
Yeah
yayy ok wait then where does my friction go
cuz ill do the same to Q wtva but frictionnn
this way?
cuz f = mew R
Then like it'll be 1/4 R
Yes
Np
.close
Closed by @west sundial
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Please show the original problem, exactly as it was stated to you, with the entire original context. A picture or screenshot is best. If the original problem is not in English, then post it anyway! The additional context might still be helpful. Do your best to provide a translation.
Let D be any point on BC. Draw DF and DE || AC and AB respectively. Extend EF to meet BC produced at G. Find any relation only between two or more segments of GC, which are GB, BD and DC.
That is, find a relation that consists of GB and BD, or BD and DC, or GB and DC or GB, BD and DC.
I guess you can use properties of transversals here?
and then find the length of one of the segments in terms of the other segment?
perhaps you could work with GB and BD since according to me, they seem the easiest
Actually, only a relation between all GB, BD and DC is possible.
Are you trying to find a relationship between ALL of them or any two of them?
I confirmed that it isn't possible to find one between only any two of them.
An equation which consists of only and all GB, BD and DC.
Just gonna ask lol
Exactly what properties, because transversal simply refers to a line cutting a system of lines?
menelaus' theorem should do the trick, with similar triangles on top
Wow i've never seen that
I was just referring to the relations of the angles in a transversal
but I guess you could also try what @late rover is saying
@delicate meadow Has your question been resolved?
*cutting parallel lines
Not necessarily.
Seems like Menelaus and Thalès
ic but they are here
Of course.
i hv exam in january :(
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
Closed by @delicate meadow
Use .reopen if this was a mistake.
i am dumb
ok
well that's what I said 
Sorry i didn't read the whole chat, you get the credit
not that serious mate
but thanks

out of curiosity did you find a cleaner approach in the end for that question
Not yet, i took a break and did other problems. But i'm definitely not done with it yet
I will continue until i find a more elegant solution
hmm it feels like there should be a more elementary route i’ll think about it as well
gl
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
For part (ii) two obvious candidates are [ \lambda\cdot z = \lambda z ] and [ \lambda\cdot z = \overline{\lambda}z ]
kheer257
Is it possible to find all such scalar multiplication maps?
something something related to all automorphisms of C over Q maybe? which would be a lot
?
havent thought about such a question before
How did you get this?
if you set z=1 then z*1=phi(z) and from all the vector space axioms you should get some axioms for phi
that would be my first idea anyway
is z the scalar here
well then phi is additive and phi(1) = 1
so we just care about what happens at i
or some complex number with non-zero imaginary component
what about multiplicative?
we have z1 * (z2 * 1) = (z1 x z2) * 1
@zealous schooner Has your question been resolved?
I don’t think you can. Too huge, Hom_ring(C, Hom_Ab(C,C)). Probably why the exercise only asks you to show it has more than 1 element. You found two. In reality I think it’s infinitely many, and unaccountable
Other than the two you have found, the rest almost always require some set theoretical construction
Closed due to timeout
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
[0] = {x | x belong to Q}
[1/2] = {x | x belong to Q} (same class as [0])
[sqrt 2] = {sqrt2 + k | k belong to Q}
is this right for 1?
Yes
btw here 1/2 is in the equivalence class of 0, then why do we have a separate class for 1/2?
is it the same class, but the representative has changed from 0 to 1/2?
I think the question just wants you to realise [0]=[1/2]
Indeed
How would I state that in the solution?
You don’t really have to
[0] = [1/2] hence 1/2 has same class as0?
What you’ve written here is basically a full solution
also elements in [0] shoudlnt be in [sqrt 2]
but it doesnt look like that
I mean look at the two sets you wrote down
Do they look disjoint?
sqrt 2 is gonna be in [0]
oh alr
Isn’t root(2) irrational
Well if you believe xRy is an equivalence relation then the answer is yes
Any equivalence relation defines a partition and vice versa
Regarding what it looks like, you don’t really get anything clean, each equivalence class is just a translated copy of Q
all rational numbers have the class Q right
i mean the same class as [0]
and [1/2]
All rational numbers are in the class [0]
But observe that say [sqrt(2)] is just the rational numbers translated root(2) units to the right
A result you can prove is that
[a]={k in Q: a+k}
Idk how you want this answered
is a rational or irrational
a is an arbitrary real here
ig it works for both
got it
ty
what about the last question
are there gonna be infinite classes cuz there are infinite irrational numbers
Hm idk what results around cardinality you know
Well to start, do you know what cardinality is?
Or is this just asking if the number is finite or infinite
number of elements in a set
Okay cool so you’re not doing anything like “it’s countable” or “it’s uncountable”
Okay that makes this easier 
ik aleph null is a thing but idk anythin abt it
Anyway c you’re right in that it’s infinite, the way youd prove this is to provide an family of infinitely many disjoint equivalence classes
cant i just say that there are infinite irrationals and each irrational has its own class
Well it’s non obvious to me that these are disjoint
Like if I used [sqrt(2)] and [sqrt(2)+1] these are the same class right
Use part ii to obtain infinitely classes
how
yup
You did (2)?
well, 2 and 3 are primes
thats what i said
Isn’t the result you need to do that non trivial (linear independence of square roots of square free integers over Q)
I don’t think so. sqrt(q)-sqrt(p) is rational then its square is rational
Oh yeah you can do things pairwise
how to prove infinite equivalence classes
So got it Sean?
no 💀
There are infinitely many primes
No. Just make things simpler
Just like you proved (2) for 2,3 you can use the same proof for p,q
i did not prove anything, i just stated that [sqrt 2] = {sqrt2 + k | k belong to Q} and [sqrt 3] = {sqrt3 + k | k belong to Q}
then i wrote that they have different classes so they dont belong to same class
thats it
You understand that x is rational then so is x^2 right?
yea
square of a rational number is still ration
If sqrt(q)-sqrt(p) is rational, then its square is, impossible
(For prime p,q)
so whats the method of proving infinite classes
[sqrt(p)] : p primes
These classes
what about [pi]
or [e]
which class are they in
That’s a different question. So you understand (3) now? Then we move on
well no but lets move on
tell me abt pi
Then you better finish (3) first
And π-e is rational or not is unknown to human at this stage
btw does this (3) ask for the number of distinct classes?
Like double lance suspected, which I agree, (3) only wants you to answer whether there are finitely many classes or not
I am saying these are already infinitely many classes
but are they talking about the distinct classes or just the classes
Using this
distinct or not
Distinct
if parent set has infinite elements then the equivalence relation on that set will have infinite classes?
right
No
Trivial relation, any x,y x~y
Only one class
Back to (3)
{[sqrt(p)]: p prime} is a subset of R/~
Former infinite, thus latter infinite
can you please clarify this confusion, if we are asked about the number of classes of mod 3 relation, would we say that there are infinite classes, or would we say that there are only three classes
Z/~ where x~y when x=y mod 3?
the word 'distinct' is not mentioned in the question
yea
Three
but they did not mention the word 'distinct'
why are we stating only the distinct classes?
Definition of set
Elements of a set are distinct
Any set X and its equivalence relation ~, the quotient set X/~ is still a set
Whose elements are distinct [x] for x in X. We omit distinct because X/~ is a set. Definition of set already contain “distinct”
so the x is just a class representative here right
Yeah
the class is basically the same right
What do you mean
in (3), what if i say that there are infinite irrational numbers, isnt that enough for proving that there are infinite equivalence classes?
That’s not useful, [sqrt(2)]= [100-sqrt(2)]
Two different irrationals
R-Q -> R/~, mapping x to [x] is not injective
{prime numbers}->R/~, mapping p to [sqrt(p)] is
Whatever works, any infinite subset of R/~
but i can just say root 2 has diff class than root 3 and root 5 and root 7 and so on...
Thus there are infinite distinct classes, as this process can be continued for root n
That’s exactly what I was trying to tell you
Any two [sqrt(p)] and [sqrt(q)] are different
When p doesn’t equal q, for prime p,q
Np and
And we still don’t know whether [e]=[π]. So don’t give it too much hope that human can find out recently
sure
What’s your result
i have only proved reflexivity yet
Good
Other two will fail
So to save your time better start to find counterexamples
(3,2) and (1,3)
not anti symmetric
Good
(0,3) and (0,1) and (-1,2) for transitivity
isnt this gonna be transitive
That’s not a counterexample, but you don’t have to disprove transitivity anyway
why?
You don’t have (5,5)R(1,3)
i think it is transitive
However, (1,2)R(2,0), (2,0)R(0,1)
what abt this
Good
is it symmetric?
No
what if i do not realize that it is not true
and i end up wasting my time trying to prove symmericity
youre not gonna be there tomorrow in the exam hall 💔
btw this is not even reflexive right
Yeah
alright
a word can’t come before its own
Dictionary in general doesn’t have exact duplicate terms for all words I guess, though no law prohibits it
cool
thanks dude
Np good luck with exam
.close
Closed by @split ingot
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
why is 2(ln2)^2 not 4(ln(2))^2?
what do you mean
order of operations
because it only squares what's in the bracket
im a bit confused bc doesn't the power multiply the 2 infront and also the ln(2)
no
If it was ln(2²) then u could say 2ln2
But if it's (ln2)² then u cant move the exponent
ohh
$ab^2 \redneq a^2b^2$
ραμOmeganato5
true
The exponent needs to be on the function on which the logarithm is being applied
Not on the whole logarithm
ah okok so it actually becomes 2ln(2)^2
Closed by @umbral tusk
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
In (c), how is omega defined on morphisms?
but as $\Omega$ is a presheaf, an arrow $a \to c$ in $A$ should be mapped to an arrow ${b : b \leq c} \to {b: b \leq a}$, and there are multiple ways of doing this mapping
do you mean \Omega
Eduude
wdym?
@ocean plaza Has your question been resolved?
And which book is it from?
It's from sheaves in geometry and logic
Kashiwara?
Oh, thank you
And the answer to your question
Thank you
@ocean plaza Has your question been resolved?
Closed due to timeout
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
Here for another proof evaluation
Excusing the abuse of notation with S, what do we think of this
\begin{proof}[\textbf{37.a)}]
Let $x_1, x_2, \dots, x_n$ and $y_1, y_2, \dots, y_n$ be the nondecreasingly ordered sequences of positive real numbers as described, and let $S'$ be the sum of these in any ordering not matching $S = x_1y_1 + x_2y_2 + \cdots + x_ny_n$ (for example, we could have $S' = x_1y_2 + x_2y_1 + \cdots$).
We seek to show that $S - S' \geq 0$ for all possible $S'$.
We can express the difference between $S$ and $S'$ as a permutation, keeping $x$ in order and permuting the locations of the $y_i$.
For example, transposing $y_2$ with $y_3$ corresponds to $S' = x_1y_1 + x_2y_3 + x_3y_2 + x_4y_4 + \cdots + x_ny_n$.
Consider any transposition of $y_i$ and $y_j$ with $i < j$.
Then $S - S' = x_i(y_i - y_j) + x_j(y_j - y_i) = (y_j - y_i)(x_j - x_i) \geq 0$ as $j > i$.
We use induction to reduce every $S'$ to a transposition of $y_i,y_j$.
Begin with $n = 1$. Then $S = x_1y_1$ is trivially maximal because no $S' \neq S$ exist.
Now suppose $S$ is maximal when $n = k$ and let $n = k+1$.
Since $S$ is maximal when $n = k$, we know that permuting the locations of any $y_i, y_j$ for $1 \leq i,j \leq k$ will result in $S' \leq S$.
Therefore, we limit ourselves to transposing $y_{k+1}$ with a $y_i$.
But we have shown that $S'$ under a transposition always has $S' \leq S$, so $S$ is still maximal in this case.
Finally, suppose we compose multiple transpositions involving $y_{k+1}$.
This permutation is equivalent to taking some $S''$ with $n = k$ and transposing $y_{k+1}$ with a $y_i$, $1 \leq i \leq k$.
By the inductive hypothesis, $S'' + x_{k+1}y_{k+1} \leq S$, and since $i < k$, $S' \leq S'' + x_{k+1}y_{k+1}$.
Therefore, we have that $S - S' \geq 0$ for all $S'$ and $n \in \NN$, and thus $S$ is the maximal.
\end{proof}
Coolempire2026
Personally I don't like it, also induction hasn't even been introduced in the book but doing it without I couldn't prove that a product of transpositions had S' <= S
Originally I had planned to go transposition -> product of transpositions -> product of disjoint cycles = permutation
The fact that texit doesn't indent my paragraphs or space the lines more than half a pixel from each other doesn't do any favors for reading this either
you could show that for any sum, you can always reduce its value by ordering 2 terms, thus proving that S is minimal
it's like "short circuiting" induction by considering a minimal element that satisfies some hypothesis, and looking whether the previous element satisfies the induction hypothesis
I think I've heard of this before
it's very analogous and sometimes faster to pick a minimal element then find a contradiction or smth
Okay back let me read your feedback again
Oh yeah
Strong induction
First time bro asks a question 🔥
Im thinking of induction
@tawdry kraken Has your question been resolved?
rearrangement
Okay I was revising for review but I have to run so I'll leave now 😂
But your idea of strong induction basically yields this immediately I think
But yeah nex I'll come with polyomino tilings because I'm not sure how to start some of the proofs
Hopefully layla is on then
.close
Closed by @tawdry kraken
Use .reopen if this was a mistake.
Send your question here to claim the channel.
Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• Do not immediately ping people or roles. After 15 minutes, feel free to ping <@&286206848099549185> once.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!
Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.
You can’t do this right?
yeah thats impossible
I cant
from what i know yeah
because |2x-5| is positive and -3 is negative
You could make a new number though that satisfies |x| = -1
Lets call it σ
Then uh... you have an entire third axis
similar to how i^2=-1
haven't learned about imaginary numbers yet, someday I will understand what that means u.u
ok cool then
@mystic condor but is it impossible
yes its impossible
you can solve for that
Ok ok
ohhhhhhh wait I think I understood now what you both said gamer and oakley
@mystic condor Are absolute lines considered as brackets?
so if you had another dimension to it, you can satisfy it theorically, but not with just what's given right?
You first calculate inside it and then change to positive number?
yes in order of operations
if you add*
so if you add omega for example you could bypass the | | I guess? but wouldn't that change the equation? idk
yeah it just helps represent answers
instead of going "error"
oh makes sense
also x = 1
for any real or complex number the modulus of the number is never negative
small correction,
|2x - 5| >= 0
it can equal to 0 if x=2.5
so basically here what's happening is that |2x-5| = -3 so |2-5| = -3 which means |-3| = -3 but |-3| is not equal to -3 because the | | makes the numbers inside always turn positive so it would be: 3 = -3 which is not right, because 3 is not the same (or equal) to* -3
true, forgot about that, you are right!
pretty sure thats irrelevant for the point he was making
Ikik
@mystic condor why do you multiply by sqrt3 - 1 not sqrt3+1 like it is?
to rationalise the denominator
you know difference of two squares?
$(x+y)(x-y)=x^2-y^2$
ImOakley
when you have sqrt3 as x then when you multiply by the conjugate that sqrt3 will just be squared in the result
thus always making it rational
I don't know what this means, I tried to solve (x+y)(x-y) and I arrived at x^2 - yx + yx - y^2, ohh wait as I'm writing this I understand, -yx + yx annulates themselves so it's just x^2-y^2
try to solve (x+y)(x-y) and you will arrive at that conclusion, in this specific case your (x+y)(x-y) is the (sqrt 3 +1) * (sqrt 3 - 1)
I'm learning new stuff here too, it's hard, but I think that's it?
which solves into sqrt3^2 - 1^2
$(10sqrt3-10)/(3+1)$
druiditbeau
Bruh
@maiden bridge do you understand difference of squares
Ya
So if the denominator is $\sqrt{a}+b$
ImOakley
But idk why that matches that
And you multiply it by $\sqrt{a}-b$
ImOakley
ImOakley
Which is just $a^2-b^2$
