#help-27
1 messages · Page 385 of 1
Doesn’t look correct
(An element x of order m, order of x^i, say k. You will notice that m|ki
What
What
What what?
m|n
| means division
Ik
m|n means n is divided by m
n=km+r, x^n=e=x^r. m is the order means r=0
Euclidean division
Like Euclidean division of 15 by 7
15=2 times 7 +1
You do Euclidean division of n by m
If x^n=e, let n=km+r, r<m x^n=x^(km+r)=(x^m)^k time x^r=x^r
I just want to know it
Okay then m|mi
order of x^i is k then x^ik=e-> m|ki
m not k bro
Look at the question
x^ki=(x^i)^k=e
By this m|ki
If |x^i| = m then gcd(m,i)=1 wdym by saying ki
Yea but why you put k instead of m
Okay
Then m|ki
We don’t have that
If m|i hmm
But m’=m/gcd(m,i) , i’=i/gcd(m,i)
you have m’ | i’ k
Im truly confused
Okay im done with that
That’s fucking cycles notations im done with that
minimal k such that m’ | i’ k is when k=m’, thus order of x^i is m’ =m/gcd(m,i)
order being m is the same as saying m/gcd(m,i)=m
(a+b)² =?
Stop trolling
Hmm bro
Since m’, i’ are relatively prime to each other
Can you explain what we conclude from m|ki
Just i wanted to confirm
Again
a^2 + b^2
We divided by gcd(m,i) on both sides
Thanks
of m|ki
gcd(m, i)
Even basic algebra make me confused bruh in this shitty cycles
order of x^i is k, we forget the condition that k actually is m
m| ki
divided by gcd(m,i) on both sides
m’ | k i’
m’ and i’ are relatively prime. So it’s the same as m’ |k

(x^i)^k=e <-> m|ki <-> m’|k i’ <-> m’ |k
Minimal k such that (x^i)^k=e <-> minimal k such that m’ |k<-> k=m’
Okay
We need show that
If sigma^i is ordered by m
Then gcd(m,i)=1
That’s what we want to prove?
I use x for σ since I don’t want to switch keyboard. Let’s summarize my thought again:
x is an element of order m
No we don’t assume its order being m for now. Pretend we don’t know its order
Then k its order?
I will make it clearer
For any k
(x^i)^k=e <-> m|ki <-> m’|ki’<-> m’|k
<-> means being equivalent to
You kidding me
thus minimal k such that (x^i)^k=e (which by definition is the order of x^i) <-> minimal k such that m’|k
Thus order of x^i is m/gcd(m,i)
How we conclude that
Those three <-> above, you still have any question regarding any one of them?
m/gcd(m,i)
I mean these three <->
(x^i)^k=e <-> m’|k
{positive k such that (x^i)^k=e}={positive k such that m’|k}
Take minimal both sides
order of x^i = m’
=m/gcd(m,i)
Minimal positive k such that m’|k of course is m’
Since the order of x^i is k then is the least possible positive integer
An least possible integer is m’
Since m’|k
Yeah
From this point we can stop pretending we lost that condition
m/gcd(m,i)=m <-> gcd(m,i)=1
wait
All we have done are
Showing
(x^i)^k=e <-> m|ki <-> m’|ki’<-> m’|k
Choosing minimal positive such k both sides
Nothing else
Is equivalent to gcd(m,i)=1, yeah
1*
Yeah
So I understand your confusion. I should have made it clear we don’t use the condition of order being m only until the last step. I want to deduce the formula of order(x^i) in general first
Yes i see
We want to show that x^i is ordered of m
So now you have a general result, order(x^i)=m/gcd(m,i) given order(x)=m
Better right
Oh right
Didnt make
Order(x^i) = order(x) / gcd(order(x),i)
A general property of given i?
Yeah, any i
But again why my first prove is incorrect?
I don’t think your solution even discussed i
You obtained x^mi=e
Then what follows doesn’t make sense
You mean mi=1?
Order(x^mi) = mi
Order(e) =1
Now you know which isn’t true
mi=1
We have that property
Gcd*lcm=1
Gcd(m,i)*lcm(m,i)=mi
=1
It follows that gcd=1
We just proved order(x^p)=m/gcd(m,p). Not order(x^p)=p
So you understand now mi=1 isn’t true
Oh i think you’re right
This doesn’t make sense. And the formula that does make sense was just proven
mi=1 in general not correct
Yeah
Take m=8 and i=7
Order is 8
m*i != 1
Anyway, any other question?
No. Just want to make sure I made it clear
8 or 9
8
A finite group , order of an element | order of the group
I mean if |G|=n, then any x in G, x^n=e
If your group in 8 really is finite, you obtain a contradiction by this
We suppose the group to be finite then?
Yeah
and any m you can find a order m element in Ω
The |Somega|=n
m != n
any positive m
Though m=n+1 will suffice
(1,2,…,m)
(f: N->N
restriction of f on {1,2,..,m} is m-cycle (1,2,…,m)
restriction of f on the complement is identity
Why you saying that?
Mean cycle as function do you mean?
And we can define an another cycle with order n
n != m
I don’t see the point
Since that we obtain there a infinite permutations
Anyway, there exists an order n+1 element
Contradiction
order(f)=n+1 we can’t have f^n=e
n+1 doesn’t divide n
Can we use upper bound concept
Suppose G is finite
Then there exist M ..
M such that forall elements in G
@supple narwhal 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.
So I'm trying to implement this code in python
import sympy as sp
import numpy as np
import matplotlib.pyplot as plt
import math as math
print("Please enter a differentiable function whose roots you would like to find using fixed point iteration as a function of 'x'")
x = sp.symbols('x')
f=input("Enter your function\n")
f=sp.simplify(f)
print("The function you input has been registered as:", f)
print("Please enter the interval over which you'd like to find roots, along with the error as prompted ")
a=input("Enter the lower bound of the interval\n")
a=sp.simplify(a)
b=input("Enter the upper bound of the interval\n")
b=sp.simplify(b)
print("The lower bound has been registered as:",a,"\nThe upper bound has been registered as",b)
c=input("Please enter the desired accuracy")
c=sp.simplify(c)
print("The accuracy has been registered as",c)
n=input("Please enter the desired number of iterations")
n=sp.simplify(n)
print("The desired number of iterations has been registred as ",n)
y=input("Please enter an initial value from which the search for roots will begin")
y=sp.symbols('y')
for i in range(n):
z=f.subs('x',y)
if z-y<=c:
y=z
else:
print("Method failed")
print("The root is approximately",z)
I would like this checked ( also lmk if I should take such questions to coding servers in the future)
oh my lord
The reason I included user input is to allow me to reuse this later on
this is useless for later
you would have to rewrite it anyway
to put it into a function
are we good here?
How we doin fam?
wait you're not even using the interval (a and b), what's that for?
Holdover from the last method I assume?
I thought I would need it
I guess I'll remove it
your spec asked for four inputs so you should have the word input four times in your code
assuming you're supposed to do i/o and not just hardcode values into your program
yea
@lost laurel Has your question been resolved?
Closed by @lost laurel
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.
I'm sort of confused here, isn't it simply $\frac{1}{\theta^n}$?
waimas
I feel like I'm missing something
isn't it just theta?
3 theta - 2 theta is 1 theta so x cannot be more than 1 theta? right?
oh right
1/ theta^n yeah
huh?
never mind carry on
@lost laurel Has your question been resolved?
Closed by @lost laurel
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.
who mentioned me
.close the channel
.close
by mention you mean ping?
Closed by @rustic musk
Use .reopen if this was a mistake.
no one mentioned you
yes
you can check inbox to see who pinged you
ok
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.
can someone help
do you have a specific question?
yes
The guy was asking about trig functions
ahh okay.. but that's still vague no?
can some one please explain what is sine, cosine, and tangent
Have you googled it in advance?
yea
Alright, could you share your understanding regarding them?
We can amend it for you if there is any flaw
Closed by @fossil haven
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 can any one help me with numerical integration
Please don't occupy multiple help channels.
Can you please stop spamming this in multiple channels.
Stick to #help-8.
and try to be more specific in your request.
.close
Closed by @winter patrol
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.
- Define f(n) to be the sum of the positive integer factors of n. If f(n) = 360 and f(3n) = 1170,
what is the sum of square of digits of the smallest possible value of f(2n) ?
Now Now N 's sum fo factors is 360
Upon multiplying with 3
how th ehell did it jump 1170?
shudn't it be like 363
3 isn't the only new factor that is added upon multiplying by 3.
Give example
hold the 💀 up
😅
i immediately think of something
2*3 has factors 1,2,3,6
Upon multiplying by 3,
2*3*3 has factors 1,2,3,6,9,18
Huh?
prime factorization
Sum of positive integer factors of n.
assume n has a certain prime factorization
then 3n is just that prime factorization adding in a new 3 factor
I don't know what's there to "huh" about it
f(n) is 360 right?
yup
now do you understand this
If power of 3 is a in n, f(3n)/f(n) by prime factorization, should be (3^(a+2)-1)/(3^(a+1)-1) and you have this fraction
ya ig
if n is not divisible by 3
what......
then the sum of all factors of n and 3 is 363
@loud monolith this is what the problem intends I believe
so 1170-363 is the sum of your remaining factors
Mhm
and if n is divided by 3, 1170-360 is the sum of your remaining factors
that's all i can think for now
hope anyone sees this :)
I ended up minimal f(2n) is ||3024||, not sure whether my method has flaws. Checking?
Now how did you end up with that
Anyway I found error anyway, fixing…
@loud monolith Has your question been resolved?
||n=120,
f(n)=360, f(3n)=1170
f(2n)=744|| seems to be smaller
Let k be highest power of 3 dividing n.
f(3n)=1770
We also know
f(3n)=(3^{k+2}-1)/(3^{k+1}-1)*f(n)
So 1770=(3^{k+2}-1)/(3^{k+1}-1)*360
Try to proceed from here on your own, view this for hint.
||k=1 works
So n=3m where 3 doesn't divide m.
f(n)=f(3m)=(1+3)f(m) so f(m)=90
m=40 is smallest with f(m)=90.
So n=3m=120,2n=240, so f(2n)=744||
I had a brain freeze, i somehow calculated f(3)=2. No wonder
f(n)>=n+1 always.
Got it. Yeah that one should be the minimal
@loud monolith Has your question been resolved?
@loud monolith Has your question been resolved?
Closed by @loud monolith
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.
hello guys can anyobody help me with one
image sending?
a or b?
both
can anyone solve and send it would be sucha great help
hello??
can anybody help
The purpose of this server is to help you learn, not to hand out answers. Do not ask someone to give you the answer directly.
can anyone help me out and tell me the concept
do you know how to do proof by induction in general?
yes kind of
ok. can you write down your base case?
i wwant the answer of B not a like the main theme.
is it as the areas are different?
the areas are different, yes. but by how much? and how does this "missing" area actually show up?
ok and can you spot where the extra 1 cm^2 of area is hiding in the 5×13 rectangle?
no
give it some thought. maybe try to make a really really accurate drawing on graph paper.
@chrome falcon Has your question been resolved?
no
@chrome falcon Has your question been resolved?
@chrome falcon 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 is there no 'help' channel?
wdym
Got it
the server is set up so that everyone can get their own dedicated channel
and you've currently reserved one of them
Hey Omega I'm 10th grader and i wanna get help in my mathematics.
Would you help me?
You'd need to post specific questions
That's exactly what I got it
Sure
that you're stuck on
Sure
I'm having problems in number like
Continuity and infinity
And I don't know what does it mean
......... less than 0
Something like this
Teach me the concept of infinity since I am a 10th grader
this sounds like something that would benefit from showing a question to show what you mean
Closed by @fair solar
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.
My thought process is the green one and the answer given is in red
btw i just have problem listing the equation and i can solve the differential equation afterward myself
my bad, i messed up myself
.close
Closed by @zenith bronze
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.
Can you guys help me with this. I did understood the comm.. and associ... what does this question even want like eg I tried the first want (a + b) + (c + d) to be a + (b + (c + d)) and from there what do I even do
I just want a lead
worst collection of problems i've seen in the past 10 minutes
can you state the defn of associativity and commutativity?
commutativity = swap able and get the same answer
associativity = can the bracket be move and get the same answer
eh... yeah, but I was looking to see the definition in algebraic terms
but one property some might forget about associativity is that you can apply it to remove brackets
mmmm nope
not here
here we have to engage in heavy duty bracketfucking
and we CAN'T write a+b+c in a setting like this. bc we have to have each and every application of assoc accounted-for
I suppose OP was already partly correct with this move of
a + (b + (c + d))
then it remains to do the Kansas city shuffle to shift the inner pair around, then the outer pair, and once more the inner pair (of parentheses), if that makes any sense
you want the b and d to be next to each other
notice assoc never messes with the order of the letters; only comm does
so the next good step is to swap the c and d around with comm
@analog fjord 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.
how to solve this?
Hint: Fundamental theorem of calculus
differentiate both sides
And use Leibnitz rule to differentiate the integral.
I'll have to apply the product rule right?
also put x=0 here for integration constant
ohh
You will first need to justify that you can differentiate this expression using fundamental theorem of calculus
If you take (1+x^2) to the left hand side
Prathmesh
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
You can't do that because f(x) is not given to be differentiable.
$y = e^{2x} \cdot e^{\frac{\ arctanx}{2}} \cdot 2$
Prathmesh
Prathamesh you first need to observe that if you take the (1+x^2) on the right hand side
You have an expression that looks like the integrand of the integral on right hand side.
correct
Now let $\int_{0}^{x}\frac{f(x)}{1+t^2}dt =g(x)$ then $g'(x)=\frac{f(x)}{1+x^2}$
silicate
So the expression reduces to a first order linear differential equation.
yea
I did that as soon as you said it
You could not just differentiate because f isn't given to be differentiable
This equation is a consequence of Fundamental theorem.
Next step is solving the ODE.
I believe you already did that.
we get $\ln(1+g)=2x$
Prathmesh
Prathmesh
Hmm
and differentiate both sides?
I am not too sure but I think it should be a -2x instead of just 2x
Yeah, you can do that, which will get rid of the constant in addition on our right hand side.
I don't think so
but why can we differentiate this and not the function in the question
i mean if u take 1+x^2 to the otherside and differentiate both sides it still works out
You did not mention that when you hastily answered in the beginning.
Which is why Prathamesh asked if they need to apply product rule or not.
Because this time there is no f(x) in our expression. The derivative of the integral exists from Fundamental theorem of calculus.
bro ofcourse u cant differentiate directly..the integral will still be there
?
the integration term will still be there
I see
The point I am trying to make is that instead of hastily dropping a message try to work with the person and provide hints instead.
"hastily"?
i didnt give him some ground breaking insight here that will solve the whole problem i just told one of the main steps
you can’t differentiate the original equation until you invoke FTC by defining the integral term properly
after that differentiating is valid
@fervent helm still here?
$\ln(1+g)=2x+c \Rightarrow
1+g=e^{2x} \cdot e^c$
Prathmesh
Yes, now you can differentiate the expression. Use Leibnitz rule to differentiate the integral.
After that substitute 0 in the original expression and see what you get. That will be helpful later.
yea
I don't know why but I feel like there is a negative sign that is missing.
Let me just solve the ode real quick.
,w y'-2y=2
I got the answer
Oh alright
I had another question of vector algebra. Can I?
ahh no problem. Happens with me everyday
Pick a new channel so the bot can pin your message.
Closed by @fervent helm
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.
I need help
Anyone here?
You can just post your question
Now lemme write question
I'm very confused.
GB Star exchanged some Nepalese rupees for American dollar at the rate of US $ 1= NRs. 110. After one week, Nepali currency devaluated by 10% in comparison to Us dollars.
If GB Star gained NRs. 33000 changing the US dollars again into Nepali rupees after one week, find the amount in dollars that he exchange.
Explain me
Anyone help me plsss
I want someone to explain me
so first you exchange NPR into USD at 1 USD = 110 NPR
then the rupee devalues by 10% against the dollar
then you convert the same dollars back into NPR
and you end up with 33,000 NPR more than you started
did i understand you correctly
@fair solar
of course op goes offline
@fair solar Has your question been resolved?
Closed due to timeout
Use .reopen if this was a mistake.
.reopen
✅ Original question: #help-27 message
Yup it's exactly what I said.
ok you're back
so tell me first things first:
after the devaluation, what's the new exchange rate?
10% of old exchange rate
incorrect and also not what i asked
first it says devalued BY 10% and not TO 10%. second the number of rupees per dollar goes UP
You have to calculate from the old exchange rate and the percentage of devaluation
ok well then YOU go calculate it, and tell me what it is
I calculated it, it's $1 = NRs. 121 (with devaluated 10% against dollars)
ok
so we exchange x rupees into dollars at 110 NPR/USD, then exchange that back at 121 NPR/USD, and end up with x+33000 NPR
can you find the value of x from here
I am so confused to do this
In the textbook, the answer is $3000
ok then let's take this step by step shall we
But I can't calculate
Yup
when you exchange x rupees to dollars at 110
Should I send you my rough?
So I have to rewrite in English
what language is it in right now
Nepali with Devanagri script
yeah you can if you want. i don't speak nepali
or we could continue with my guidance instead.
I'm a 10th grader
do you want to translate your work or do you want my guidance independent of that
Lemme convert it.
After observing my rough you may understand what I am unable to understand
sure
I'll be right back in 5-7 minutes
You know what, somehow I calculated the answer correctly but I didn't know how.
Still check is it correct? @pseudo basin
ok you took x as the dollar amount
yeah sure this works
so then, what remains in doubt?
I somehow solved it but i couldn't understand it well,
How does it work and how do I understand these types of questions
i mean
you took x as the amount of USD
you calculated how many NPR you get when exchanging it with each rate
you used the known value of the DIFFERENCE between these rupee amounts
there's nothing else to it
Yup I got it already
Ok
Let me come with another question
@pseudo basin
When a dice is rolled and a coin is tossed one after another,
What is the probability of getting 1 on dice and head on coin
ok, what's your doubt about this one
hmm.. one after other sounds like bayes
,rccw
nothing of the sort
Lol, i don't know how I solved it again.
I think I wrote every simple thing for a pic and I solved it carefully.
had a feeling
your solution was methodical but also very long lol
Yup, i tried in short and I wronged
Ok I think now I should close
Thanks for help
.close
Closed by @fair solar
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 what did I just doodle
??
this kinda triangular E you wrote is just sum notation; the subscript is where you're summing from and the superscript is what you're summing to
it substitutes every integer value between those into your expression on the right hand side
conceptualized what exactly?
I guess I wanted to describe gravity
then, i am confused what you are asking about exactly ...
What do you see from the formula
sum
You just see a sum?
i am sorry to tell you that it is nothing more than gibberish
okay
Are you talking about the $\Sigma$
Erebus
My opinion on it?
given that you don't seem to have a well-formed question I'm going to say this belongs more in a discussion channel
It's nothing much
.close
Closed by @light saffron
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.
how to find the limit when $x \rightarrow -1$ of \sum_{n=0}^{+\infty} x^{n^2}$
bloubbloub
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
apparently it's 1/2 but idk why
Uh this is the exact same as Σ (-1)^n. It's just an alternating sum of +-1 in pairs
So it doesn't really converge to 1/2 but the limit can just be treated as a geometric series
Even and odd squares map exactly to even and odd numbers!
I'll leave that proof to you
bloubbloub
but I think I maybe got it thanks to you
how would you justify it in this case?
for x^n^2 I mean
the series doesn't actually converge at x = -1
So no abel radial convergence th
Ok online I found a few things
notably that this is the theta function applied to some specific values
@inland carbon Has your question been resolved?
I mean I really want to say that the cesaro mean is uniformly convergent
since the cesaro value is 1/2 at -1 and we have pointwise convergence on (-1, 1), this would imply that the limit is 1/2
@inland carbon Has your question been resolved?
Closed by @inland carbon
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.
∀x∀y(x \neq y → ∃p∃q(p \neq q ∧ C(p,x,y) ∧ C(q,x,y)))
domain of x and y is the set of all points
domain of p and q is the set of all paths that connect two points
C(x,y,z): Path x connects two points y and z
Now I have to translate this into english
Any two distinct points are connected by at least two distinct paths?
$\forall x \forall y (x \neq y \rightarrow \exists p \exists q (p \neq q \wedge C(p,x,y) \wedge C(q,x,y)))$
Sean [Ping On Reply Please!]
I would use the word points instead of endpoints
done
is everything else correct
@gray oriole Has your question been resolved?
Closed by @gray oriole
Use .reopen if this was a mistake.
.close
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.
physics 
do you have a question to ask?
ok then .close this
What
.close
Closed by @wide basin
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.
,rcw
how to prove that these graphs are not isomorphic?
I mean I can see that they are not, but how to write it
as a proof
yeah
nno cycle
is there an invariant for longest path
in the first one longest path is length 2
in 2nd one it is 3
whats that shrug for
😭.
Because I have no idea if there's an invariant for it
then how to disprove isomorphism
If directions count for chromatic number then their chromatic numbers are different
both are bipartite
.close
Closed by @gray oriole
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.
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.
yay!
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.
The second part of the question says at least 5
But I am getting ceil(800k / 200k) = 4
Yes but it says more than 800k
ceil(801k/200k) = 5
Yep
What are the pigeons and what are the holes?
That's also a nice one
100 million pigeons?
And how many holes - considering we're working in pennies
remember the "less than"
are there a hundred pennies in a dollar
is this the calculation
Yeah :)
why is it 100mil in the denominator
We're not working in the Carolingian monetary system lol
1 mil dollars is how many pennies?
Good job :)
i'd recommend a diagral
diagram?
yes^
arent there gonna be two buckets
Got to turn off my phone
one for friends one for enemies
.
two walls i guess
can this be solved using only the pigeonhole principl
.close
Closed by @gray oriole
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.
Uhhh idk where to start
join OB
the semidisk falls apart into 4 pieces:
- sector AOB
- isosceles triangle OBD
- the target piece
- minor segment CD
Okok then what?
use this information to express area of target piece in terms of the other areas which you can find
@compact hawk 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.
Please don't occupy multiple help channels.
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.
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.
can anyone help me find a way to solve this with pure geometry and properties of tangents and parabolas? the coordinate geometry way includes some calculations and i wanna find a good method for it but i can't seem to find a way with just geometry
@scenic eagle What did u try ??
I dont think their is excessive calculation when using coordinate
no yeah not a lot I've got that done but i wanted a geometry way
I dont think there is one with pure geometory u need to use the equations of tangents and all that
But I'll leave the helpers to it
maybe this could explain it? i didnt watch the video though https://www.youtube.com/watch?v=M0v7krRq3mU
To ask Unlimited Maths doubts download Doubtnut from - https://goo.gl/9WZjCW T is a point on the tangent to a parabola y^2= 4ax at its point P. TL and TN are the perpendiculars on the focal radius SP and the directrix of the parabola respectively. Then
i tried using the reflection property that the tangent is angle bisector to line joining P to directrix and focus and taking that angle as theta then making a rhombus by joining those points but idk it got too complicated
this is just using coordinate geo ive done that alr
alr
<@&286206848099549185>
@scenic eagle 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.
This one seems fairly easy
\begin{proof}[Proof of \textbf{45}]
Let ordered pairs be defined as $(a,b) := \{\{a\}, \{a,b\}\}$.
($\implies$) Suppose $(a,b) = (c,d)$.
Then $\{\{a\}, \{a,b\}\} = \{\{c\},\{c,d\}\}$.
Because these two sets are equal, we have $\{a\} \in \{\{c\},\{c,d\}\}$.
But since $\{\{c\},\{c,d\}\}$ only has one singleton element, $\{a\} = \{c\}$, i.e., $a = c$.
Similarly, we must have $\{a,b\} \in \{\{c\},\{c,d\}\}$, which must be its doubleton element $\{c,d\}$.
Then $\{a,b\} = \{c,b\} = \{c,d\}$.
Therefore we either have $b = c$ or $b = d$.
If $b = d$, we are done; if $b = c$, then $\{c, b\} = \{c\} = \{c, d\}$ and thus $d = c = b$, completing this direction.
($\impliedby$) Suppose $a = c$ and $b = d$. Then $(a,b) = \{\{a\}, \{a,b\}\} = \{\{c\},\{c,d\}\} = (c,d)$.
\end{proof}
Coolempire2026
\begin{proof}[Proof of \textbf{46}]
By definition, for $S \in S$, we must have $S \notin S$, which is a contradiction.
Therefore, suppose $S \notin S$. Then $S \cancel \notin S \implies S \in S$.
\end{proof}
Coolempire2026
Looking for any comment/evaluation on these two proofs
they seem alright to me 
Let $|S| = n$ and write an $n$-bit binary word consisting of all 0's, where each bit corresponds to one element of $S$.
We will show that this correspondence is in bijection with the subsets of $S$, and therefore by iterating through all of the binary words with $n$ bits (e.g., through counting), we may obtain every subset of $S$.
Coolempire2026
this is not combinatorics 
Yeah I said I was skipping to the next chapter
We would come back to the combinatorics later
Although 47 is combinatorics
Slightly

I think you've got the right idea 
what if c=d

\begin{proof}[Proof of \textbf{47}]
Let $\phi : \mathcal{P}(S) \to \{0,1\}^n$ be the correspondence described above.
First note that $\phi$ is well-defined, because each subset of $S$ may contain only elements of $S$, so it will be representable within $n$ bits.
Now, suppose that $\phi(S_1) = \phi(S_2)$. Then $S_1$ and $S_2$ contain the same elements, and thus $S_1 = S_2$ by definition. Therefore, $\phi$ is one-to-one.
Next, let $b$ be a binary word of length $n$. Let $T$ be the positions of the bits that are $1$ and let $S'$ be the set of elements corresponding (importantly, $b$ is of length $n$, so $S'$ is well-defined). Because $S'$ only consists of elements from $S$ (given that bits of $b$ correspond with inclusion/exclusion of elements of $S$), we must have $S' \subseteq S$, i.e., there exists $S'$ such that $\phi(S') = b$ for all binary words $b$ of length $n$.
\end{proof}
Coolempire2026
Isn't that what's writen at the end
Ah are you saying then the doubleton element doesn't exist
yes
So cardinality isn't sufficient to mark inclusion
Mm yes I should have done the 'or' idea at each step
I would've ended with like 8 cases 🥲
But good shout
why eight cases 
you get either {a} = {c} or {a} = {c,d}
the former is trivial
the latter immediately collapses back to {a} = {c}
just don't say it must be the singleton element
a in {c, cd} -> a = c or a = cd
ab in {c, cd} -> ab = c or ab = cd -> b = c or b = d
Okay 5 cases
It felt wrong writing it but now I know why 😆
The one I used in the proof?
{a,b} in {{c},{c,d}}
So the correct split is
{a,b} = {c} or {a,b} = {c,d}
this also looks good to me
The answer is yes but the proof is abhorrent to write
Well I saw that, at least for students it is
Let me see if I can skip steps here
Only because I'm taking liberties
Ah wait
No this is the easy one
The hard one is distributivity
Yeah that's the abhorrent one
You're right
\begin{proof}[Proof of \textbf{40}]
Let $x in A \triangle (B \triangle C)$. Then either $x \in A$ or $x \in B \triangle C$.
\begin{case}
If $x \in A$, then $x \notin B \triangle C$, so either $x \in B$ and $x \in C$, or $x \notin B$ and $x \notin C$.
If $x \in B$ and $x \in C$, then $x \notin A \triangle B$ (because $x \in A$), and thus $x \in (A \triangle B) \triangle C$.
If $x \notin B$ and $x \notin C$, then $x \in A \triangle B$ and thus $x \in (A \triangle B) \triangle C$.
\end{case}
\begin{case}
If $x \in B \triangle C$, so that $x \notin A$, then either $x \in B$ or $x \in C$. WLOG this is just the first case again tbh. If $x \in B$, then $x \notin A$ and $x \notin C$, so $x \in (A \triangle B) \triangle C$. Otherwise $x \in C$, and thus $x \notin A$ and $x \notin B$, so $x \in (A \triangle B) \triangle C$.
\end{case}
Therefore, in all cases, if $x \in A \triangle (B \triangle C)$, then $x \in (A \triangle B) \triangle C$. The other direction follows similarly.
\end{proof}
Coolempire2026
That was too much work as is
wait
coolemplud
what does symmetric difference mean
because your definition isn't right
In one or the other but not both
Either means it can't be both

,w either or
hm
What type of english do you all speak that either-or isn't taught in grade school to mean one or the other 😂
They teach it to us with neither-nor
this blud is making fun of me now
I've worked with some native american logicians who say either or to mean OR and not XOR
so that's probably why I think it means OR
Do you mean native american as in native american native american
no I meant
Or like native to the US
That's quite interesting, using either as inclusive or
I didn't even know it was ambiguous
(neither did cambridge and merriam-webster, it appears)
your cheekiness will be your downfall
i think they get cleared when the channel is reset anyway
probably
lancey must have lied to me when they said i'm close to helpful
anyways all of these problems are just like statements about logic
undeniable facts
so like, set xor is associative
undenacts
is just for all a, logic xor is associative w/ a in A, a in B, a in C
which is true because logic xor is associative
That is how proof exercises work yes
so you can just like make a truth table
I had to try my hardest not to say "look, it forms a group ok"
\begin{proof}[Proof of \textbf{41}]
Let $A$, $B$, and $C$ be such that $A \triangle C = B \triangle C$.
Suppose, WLOG, that $x \in A$ but $x \notin B$.
If $x \in C$, then $x \notin A \triangle C$ but $x \in B \triangle C$, a contradiction.
Therefore $x \notin C$. But if $x \notin C$, then $x \in A \triangle C$ and $x \notin B \triangle C$, a contradiction.
Therefore we must have $A \subseteq B$, and since the proof was without loss of generality, $B \subseteq A$.
Thus if $A \triangle C = B \triangle C$, then $A = B$.
\end{proof}
Coolempire2026

here's another way
suppose A (+) C = B (+) C
uhh
im just gonna call it xor
suppose A xor C = B xor C
then (A xor C) xor C = (B xor C) xor C
applying associativity, A xor (C xor C) = B xor (C xor C)
A xor {} = B xor {}
A = B
XD not you applying the group action
I never actually proved that XOR preserves over =
As in applying it
does it need to be proved?
surely that's just like a basic fact about logic
if you have any operation and you apply it to both sides of a true equality the equality stays true
define f(A) = A xor C
A = B => f(A) = f(B)
Coriol Anus
Yes that does make sense
Now I have to figure out why that doesn't directly imply cancellation law
(which is what we proved here)
Like what operation can hopelessly mangle the objects so they're not equal anymore
Oh non-invertible one?
Yeah
Non-invertible one
Okay makes sense
well that can turn non-equal objects into equal
but it can't turn equal into non-equal
thats impossible
the one that satisfies the substitution property of equality 
This is interesting
So cancellation law proves that the operation is one-to-one
Since it proves the reverse of this
And since XOR is well-defined we have the equality part dreyuk mentioned already
Interesting
the same proof works for any function symbol f
well a function symbol is automatically well defined
Lovely, very interesting this
as long as it's a function
also you're proving the cancellation law, you can't use it
it's not a fundamental property of equality, while A=B => F(A)=f(B) is
Well yes
I meant that the cancellation law is what we proved here not the implication 😅
Because we definitely didn't prove that
But yeah
I should add that to my list of things
Prove that a function of the binary operation with a fixed element is one-to-one == prove that the operation has cancellation
I guess if you can prove it with inverted positions maybe that shows it's commutative
As well
Okay now the section on functions
I can learn what all these words that I'm using mean
I'll be honest I always called it an injection
Like bijection or surjection
What is injunction
injection but worse ig
Jesus why is this section so long
I've just had basically everything there is to know about the basics of functions thrown at me all at once
Including asymptotic notation
And now partial functions
i come back here every once in a while and every time it’s still no combinatorics
Yes those will likely not be back till tomorrow
\begin{proof}[Proof of \textbf{34}]
Let $f$ and $f \circ g$ be one-to-one functions and suppose that $g$ is not one-to-one.
Then for some $x,y \in \mathrm{Dom}(g)$, $x \neq y$, we have $g(x) = g(y)$.
But since $f$ is one-to-one, this means that $(f \circ g)(x) = f(g(x)) = f(g(y)) = (f \circ g)(y)$ and $f \circ g$ is not one-to-one, contradicting our original assumption.
Therefore, if $f$ and $f \circ g$ are one-to-one, then $g$ is one-to-one.
\end{proof}
\begin{proof}[Disproof of \textbf{35}]
I wish more was said about the codomains of these functions, but $g$ may be onto the domain of $f$, thus making $f \circ g$ onto, but $g$ but not onto its own codomain.
In other words, I feel this question is malformed.
\end{proof}
Coolempire2026
likely it may be assumed that the codomain of g is the domain of f, but not necessarily the range of g
one does not compose functions if codomain doesn't match domain
Oh I didn't know that 🤔
well
Like sqrt(x) can be written as R -> R>=0
But I can compose that with f(x) = x +1 from R to R
Even though they don't 'match' one's a subset
Okay let me rewrite my answer
truly wiser words have been said
In the book all they said was range subset domain
So knowing to set them equal is helpful
otherwise I would have just like chosen f(x) = lnx and g(x) = sqrt(x) : R -> R
Ah they marked it in the definition
Sneaky
\begin{proof}[Proof of \textbf{35}]
Let $f : B \to C$ and $g : A \to B$, where $f$ and $f \circ g$ are onto $C$, and suppose that $g$ is but not onto $B$.
Suppose that there exists a subset $B' \subseteq B$ such that $f(B') = C$ (possible if $|B| > |C|$).
Then if $g$ is onto $B'$, all the given conditions still hold, meaning that $f$ and $f \circ g$ onto does not yield that $g$ is onto.
\end{proof}
Coolempire2026
And we have the simple example of
A = {1,2}
B = {1,2,3}
C = {1}
g(1) = 1
g(2) = 2
f(1) = 1
f(2) = 1
f(3) = 1
If C is infinite then the comment about their cardinals is sufficient but not necessary
I didn't even think about the infinite case
I guess as a baby mathematician I should probably start thinking like that
How does this version look
for the proof of 34, g(x)=g(y) implies (fog)(x)=(fog)(y) just because f is a well defined function, it doesnt have anything to do with the injectivity of f
Last one before I go


