#help-49
1 messages · Page 204 of 1
cuz 5 linear terms are being multiplied
hey im actually understanding ts
:D
there are 5 ways for x^4 x y because there are 5 terms in the expression
shouldnt the same be applicable to x^3 x y
sorry x^3 x y^2
Yes
(Don't use x as multiplication symbol)
If you really really want, at least write * not x.
× is typically used in elementary schools when you have no numbers, especially no x appearing
why is x^4 * y wrong
But here I strongly suggest to use either nothing (the best) or •
how to use those symbols
No you are correct there are 5 ways to get x^4*y
I meant the x for multiplying and x variable was confusing
I think you have them on your keyboard (if you're using your mobile phone)
im using my pc
How many ways will be there to get x^3*y^2
by our previous logic shouldnt it be 5?
why is it 10
Then you can copy-paste from the Internet or maybe you could try finding them with the combination "Win + ."
Because there are 10 ways to pick 2 things from 5 things. So there are 10 ways to pick two xs from the brackets and the rest have to be ys which makes x^3*y^2
are brackets fine?
ohhh
and for the x^4 * y case its 5 choose 1
Yes
yeah if you have to choose exactly 1 y, you must have the rest being xs, or 4 xs
What about the x^5*y^0 case
got it now
From the best to the worst notation (in my opinion):
- x³y²
- x³ • y²
- x³ * y²
@oak nymph
(Now I won't interrupt you any more, sorry)
0! has 1 arrangement
so it's pretty clear there are 5 ways to do that, since you can choose 1 y from any of the 5 brackets
Correct
Closed by @narrow edge
Use .reopen if this was a mistake.
you can do:
XXOOO
XOXOO
XOOXO
XOOOX
OXXOO
OXOXO
OXOOX
OOXXO
OOXOX
OOOXX
so that gives you 4 + 3 + 2 + 1 ways for 5 choose 2 and 5 choose 3
XO?
in general n choose 2 = 1 + 2 + 3 + ... + (n - 1)
= (n - 1)(n - 1 + 1)/2 = n(n + 1)/2
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 do i find new limits of integration on Gaussian integral if its from 1/2 to 3/2
When converting to polar
if the gaussian integral doesn't go to infinity then the polar conversion trick doesn't really help because then you have a square region
How can i convert it to polar?
and the only way to solve it is either in terms of the error function or numerically
Or i cant
Why would it not work
you can convert it to polar, but polar only works well for circular regions, and doing the trick where you square it would give you a square region
Cant i find what the rectangle 1x1 starting at 1/2 1/2 transofroms to in polar?
you certainly can, but it will not be nice to integrate
well you would need to convert the lines x = 1/2, x = 3/2, y = 1/2, y = 3/2 into polar coordinates
Meaning ?
Ill get a rectangle no?
well do you know the polar coordinate conversion formulas?
As in with matrix ?
Like the 2x2 matrix
no like [ x = r\cos\theta \qquad y = r\sin\theta ]
cloud
not the jacobian
but you also substitute those to get your bounds
Yes
Problem is its 2 variables
For each bound
So how do i find them
well you would end up with variable bounds for the inner integral
the usual way is for the inner integral to be with respect to r, then the bounds will be the bounds on r as a function of theta
are you familiar with double integrals with variable bounds?
How would i calculate it then
If im stuck with cosθ and sinθ in bounds
because there is an outer integral with respect to theta
your integral ends up looking like
[ \int_{\alpha}^{\beta} \int_{g(\theta)}^{h(\theta)} f(r, \theta) r \odif{r,\theta} ]
cloud
well that's the point where you realize that converting to polar wasn't very helpful in calculating this integral
In the inner integral i first do θ
So how do i calculate it
either in terms of the error function or numerically
there is no formula that will give it to you in terms of elementary functions
if you want a "precise" formula then there is no avoiding the error function
Can i not do any trick to find it
Like some coordinate system conversation or anything
No you can't.
Even if you insist lol
Idrk what the error function is you keep referring to
Is that proven or
the tricks for finding the gaussian integral only worked because the limits were from -infinity to infinity. you could do a similar trick for 0 to infinity, but for any other bounds you run out of luck
Well then you really have no way to do
Is there any other coordinate change or jdk
In mathematics, the error function (also called the Gauss error function), often denoted by erf, is a function
e
r
f
:
C
→
C
{\displaystyle \mathrm {erf} :\mathbb {C} \to \mathbb {C} }
…
erf(z) is the "error function" encountered in integrating the normal distribution (which is a normalized form of the Gaussian function). It is an entire function defined by erf(z)=2/(sqrt(pi))int_0^ze^(-t^2)dt. (1) Note that some authors (e.g., Whittaker and Watson 1990, p. 341) define erf(z) without the leading factor of 2/sqrt(pi). Erf is ...
Like its proven that it cant be calculated in terms of elementary functions
you can do plenty of coordinate changes but none that would give an elementary formula for the integral
How do you know
What is this
Try it and see what you get
What θ bounds though
do the same thing you did to find the r bounds but solve for theta instead
It is known that no antiderivative of e^(-x²) can be written as finite combination of elementary simple functions
The error function erf(x) is basically defined to be its antiderivative (up to some constants)
You can keep trying, but it won't get you anywhere
He won't like this fact lol
But this is a matter of fact 🤷♂️
I opened before
@languid mica Has your question been resolved?
Closed by @languid mica
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 me do this using binomial approximation
do you mean taylor expansion?
sorry
yes
i mean ill send u a pic..im not really sure of the method name
i put theta = h+pi/4
so h--->0
and this is what i got
im kind of new to limits..so are we allowed to expand it like this?
quite messy and hard to follow
i got the answer by simplifying
cos theta + sin theta as sqrt 2 ( cos (pi/4 - theta)
but im unsure why this method was not successful
^^
uh so you used the fact that sinx ~ x for x near 0?
It's quite hard to follow, but if you used that, which it seems like you did, then its incorrect
uh no i used sin x expansion
this works pretty well, as long as x is near 0
unfortunately, theta + pi/4 isnt near 0 (as theta -> 0)
yeah
thats why i put theta as h+pi/4
so that h--->)
h-->0
oh
That doesnt solve the issue
wait i get ur point
the argument of sine is still around pi/4
i did not know it was only applicable for x near to 0
if x is far from 0, you would have to use the entire expansion
which is infinite
so that wouldnt be very helpful
thats why when i simplified it to this form it worked
or alternatively, you would have to make an expansion around x = pi/4
now when theta -> pi/4, theta - pi/4 -> 0
so the argument of cosine goes to 0
so the approximation should work fine
but it's also one of the well known limits
(1 - cosx) / x^2 -> 1/2 (as x -> 0) iirc
whats iirc
"if i remember correctly"
Closed by @woeful turret
Use .reopen if this was a mistake.
General result is (1-cos(mx))/x^2 limit as x approaches 0 is m^2/2 :)
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
Wait, are the cousins considered distinguishable or not?
i would start by asuming humans are distinguishable yes
Lolz
sorry i have to go now i'll keep this channel open
[4] 1
[3,1] 4
[2,2] 6
[2,1,1] 6
?
i liked your method , did i miss something brandon
s(4,1)+s(4,2)+s(4,3)?
Officially zonked 
.close
Closed by @mint ravine
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 for the part where he starts -a≤x≤a he says -x≤a. So I understand he uses the given and just multiplies it by negative one. But what about if you looked at it like this. If x less than 0 |x|=-x. -x<x≤a. So -x<a but then we have two definitions
If x is less than zero then -x < x is false.
Closed by @sand flume
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 have some doubt about Goldbach Conjecture
!da2a
No need to ask “Can I ask…?” or “Does anyone know about…?”—it’s faster for everyone if you just ask your question! See https://dontasktoask.com/
ask away ig
why did you delete your question (same as this) in https://discord.com/channels/268882317391429632/1018703538517454919?
let him spit it out
he asked already, "can we solve it"
@bright shoal
@bright shoal Has your question been resolved?
no question was ever asked
So Sorry
i am struggling with network issues
When i wrote the question in help channel 48
help channel did not get occupied by me
click ❌ on this
no like i have a doubt
well then repost the question here
Does anyone have any info on goldbach conjecture
i need to ensure before asking the actual doubt
click ❌ on bot's prompt unless you want the channel to close
no you need to ask the doubt now
So like is there any exact formula to calculate the number of goldbach pairs for even number
I tried looking up but like could not find any valid source
Mind looking on this?
This is like even number v/s goldbach pairs for each upto 100000 number
s
Probably computed by computer program
i mean number of goldbach pairs
Yes but like i was just interested in asking do we have any formula to calculate the number
of pairs
Sorry guys if like this is not suitable for here but like i asked this in Python and WoC
Probably doesnt get any easier than "sieve out primes and check"
if we did, it would probably not be hard to decide then if no. of pairs is >0 for all even numbers or =0 for some even numbers thus solving the conjecture
Yes
Yes
i am researching on this
Granted some fast convolution algorithm can help but... thats about all the computational speedup you have
Yes, there is, but it involves calculating it by simply enumerating the possible pairs, and checking if both numbers are prime
I have been working and learning prime checking algos goldbach conj primality test etc since few days
oh I was scrolled up lol
So like i thought maybe working on a formula would lead in the direction of solving it
Then i came here to like
cross verify that are their any approximations
and there were as Omnipotent told
Convolution algorithm?
Could you describe some more i could apply that
cause current algo is slow and like sieve takes up space
lets say for n>10^12
Sorry cant help for that
Sieve + convolution can only take you to 10^9
No like describe some about how to define a convolution algorithm
I am writing this down one sec
Look for FFT (fast fourier transform)
scipy.fft ?
@bright shoal do you understand what a convolution is?
if not, you might need some additional background education before you can hope to tackle and open problem 😉
Closed due to timeout
Use .reopen if this was a mistake.
You kinda want exact answers so you need to work in a finite field
rough idea like somewhat combining two functions
.reopen
✅
it's a specific method for doing that, but yeah that's the gist.
So like fft s would help in this case
basically "count number of pairs summing up to x" if you need answers across different x can be processed together by running something like a fourier transform
i checked fft and i could implement them using scipy
but how to define a convolution for this
Its a discrete convolution
Another way is encoding the entire list inside a big integer and doing multiplication
But of course number of digits increases with how big your n is
oh so you mean like first calculate all by running a sum and sieve and then use some fourier transform or so
the sieve?
So you would be working with squaring roughly a 10^10 digit number when doing up to n=10^9
oof
So like implementing a convolution algorithm would speed up ?
Man sorry but i am liking getting a little overwhelmed here
Sorry
No better if the multiplication already uses convolution
well, here's a question: what would checking a whole bunch of numbers accomplish in this case?
I am thinking
if the goal is to prove the goldbach conjecture, then verifying it up to 10^20 or 10^100 or 10^10^10^100 squintillion isn't sufficient.
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.
Oh wait not exactly
Lets say one derives a exact formula to like find the number of goldbach pairs
how we will verify it that it works for all n
like back to the whiteboard typa thing
until its a rigorous proof
Is it going to be easy looking at 10^9 numbers and picking out a formula
You already can see this and you cant imagine a formula which does this
What will more data give you?
Look i am just asking if on rigorous analysis lets say you define a formula or function which fits even 10^4 numbers and fails for 10^7 ?
i just mean how would it be verified that formula is true for all n until its derived from a rigorous proof?
right?
Like omnipotent said the case is same with the goldbach conjecture
Man my original question was like is there a formula but when you told about convolution algorithm i got eager sorry
i was eager to like speed up
and run for more numbers faster
Could you help me like develop and understand how would this help in working out number of pairs for more numbers
If it is pointless then sorry for taking time of you all and thanks for the help to all the people who came here
You run against output limits rather easily when you want to break past 10^9
To produce m bits of output takes O(m) time at least
Right
Man i want to like understand what was about the convolution algorithm you were telling
sieve can be implemented how to implement that
lets say we only want to test upto 10^9
Man i am not interested in asking ai or something thats i would be grateful if you could help
😔 🥲
Task: calculate 110110111 * 110110111 and see how the digits of the result match with number of ways to make 6 to 20 with 2 primes
through sieve we would get O(Nlog(logN)) to find prime list
lets say N is 10^9 here
thats done
ok lemme check
6 to 20 with 2 primes?
Essentially only the even numbers
like every number of pairs for each number from 6 to 20 right
Since the digits of 110110111 encode 19 17 13 11 7 5 3
Actually it works all the way up to 22
,calc 110110111*110110111
Result:
1.2124236544432e+16
6: 3+3
8: 3+5 5+3
10: 3+7 5+5 7+3
12: 5+7 7+5
14: 3+11 7+7 11+3
right
So essentially something similar can calculate number of ways
Though you may need to pad the digits further apart if it gets to more than 10/100/1000/... ways
Yeah
oh
Bro sorry
but i am like confused how this relates to the number sorry again
i am like slow
Sorry again
Ones digit: ways to make 6
Tens digit: ways to make 8
Hundreds digit: ways to make 10
... all the way until 22 (24 is also correct but 26 is missing 23+3 and is hence wrong)
no way
what is this sorcery
no way
Man i cant still believe it
No way
like you wanna say
encoding and multiplying two large numbers gives me no of pairs
beginning from ones digit
no way
$110110111=\sum_{3\leq p\leq19,\text{prime}}10^{(p-3)/2}$
Element118
$110110111^2=\sum_{3\leq p,q\leq19,\text{prime}}10^{(p+q-6)/2}$
Element118
Man this is sorcery indeed where do we learn such math
By living in my head
Man
you are too genius please stay
i now definitely know with your help imma gonna build the algo
please
idk if the algo is going to achieve anything
but like this is like incoding all number of pairs how
i have better projects for myself
🥲
man you single handedly calculated 6 to 22 number of ways to prime
using like multiplication
which can be made faster using ffts
🥲
man your knowledge is helping in a good way
🥲
So like how do we encode for big N
lets say 100
lemme show you for up to 100
thanks man
just teach me this i can implement fft for faster multiplication myself thanks
i think most programming languages already implement it
Well, I wouldn't say most. You generally have to use a bignum library to get fft based multiplication
Yes
$100000001000001000100000101000100000101000001000100010100010000010100000100010100010100010101=\sum_{3\leq p\leq97,\text{prime}}100^{(p-3)/2}$
Element118
so like fft would do multiplication with time complexity O(nlogn)
right
what
Man such big numbers is this possible to achive 10^6 with this?
i mean like pairs for prime numbers
100000001000001000100000101000100000101000001000100010100010000010100000100010100010100010101 if i didnt make a mistake
Yes i will implement that
I am like wanting to work as much as i can this summer on primes
without ai
i feel scipy has it l
Omnipotent do you have any knowledge
yes these are like libraries built by people
these are for years
Python is approx 33 or 34 years old man
Thats why people say everything is there in python
Omnipotent how is Element118 doing this trickery
is there any math i can learn?
I mean i finished my undergrad in math
lemme check the digits of this number
In general use the summation to calculate the number
Its gonna go up to about 10^10 digits for going up to 10^9
if we want to start encoding primes from some q, we can make the exponents in the summation (p-q)/2
and like fft has nlogn where n is number of digits right?
does that help in saving computation?
fft would save
I showed you the page with the algorithm, you just need to read and understand if you want to learn how to multiply. There's also, like, the Russian Peasant's algorithm for multiplying numbers. element 118 could have been using that as well.
no like how is encoding these primes
and like the sum?
Russian peasant is still quadratic time tho
Thanks again
Sure i am gonna read
Which
oh that one
so we need to sum
oh
so like we just need to sum for the prime numbers we want?
and we get the number
like the bounds
right?
Hard to get bounds this way
But lets say we do for 3<=p,q<=10^9
so we need 10^9 prime number right
oh shi
we need all 10^9 numbers
by sieve
Yeah you still need to sieve
O(nlog(logn))
ok
and like lets say we get the number
how much complexity does the sum have
But after you sieve you construct the big number, square it then read the digits
You may need to work in the computers native base to speed up
like numbers would be summed up
Which is likely a power of 2
So instead of 100^... you might want to do 1024^...
because its essentially useless for this problem
Man i am shocked
why?
like its making finding pairs faster right
its useful
Calculating lots of values brings you no closer to solving
;-;
i know you are right but this solves my current problem of computing
bigger number pairs
ok so like
Sieve
to find bounds
then we sum to get number
what is tc of sum ?
fft has O(nlogn) for n bits right?
You may have to optimize that part
Summing up - best to see how the numbers work to see what base to use instead of power of 10
I only did power of 10 for human understanding
@bright shoal Has your question been resolved?
@pine wave Sorry i went
actually i need to go
i will come
hopefully this does not reset due to timeout
It kinda does
But at least the messages stay on this server
If you need to dm me, you may, but i may not be available at all times
@bright shoal Has your question been resolved?
hiiii i'm new here
!occupied
Someone else is already using this help channel. If you need help with a question, please open your own help channel/thread (see #❓how-to-get-help for instructions).
oh sorry
Don't worry
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 reading on Wikipedia that polynomials in one variable over a field F are zero on finite sets or on all of F. The latter case occurs iff it is the zero polynomial, correct?
yes
.close
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
Let ABC be a triangle with orthocenter H. The tangent lines from A to the circle with diameter BC touch this circle at P and Q. Prove that H,P,Q are collinear
no idea😓
i know that PQ is polar of A wrt to the circle but how do i show that H is on the polar??
@chilly cobalt 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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 what values of the parameter m the equation |x − 1| + |x + 2| = m has
maximum number of solutions?
Consider the x-values where the moduli change sign
Then just do case bashing
@waxen knot Has your question been resolved?
Closed by @waxen knot
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 I properly format this proof
you should be more concerned with the fact that what you are trying to prove is false
Counterexample: x=1
Seems like you intended to write |x| = 0 <=> x = 0
Yes but if you plug that in the definition you get 1
How so?
but |1|=1, however 1≠0
Oh oops
Ok sorry for that but then what is the right way to format this because it looks ugly
Generally when you're doing proofs of an iff (<=>) statement, you'd just break it in two parts, and there's really no need for the bullet point or the "Work" subheading
You could either go for a one liner
|x| = 0 iff ...... iff x = 0
or split it into the two directions as neon suggested
So I need to show that if |x| = 0 then x=0 and the other way around right?
But what about the actual formating itself with latex
you can also do
\begin{enumerate}
\item[$\implies$] this direction
\item[$\impliedby$] the other direction
\end{enumerate}```
Also I just want to make sure it would be necessary to define the absolute value definition correct?
Why is that because don't we need to refer to it when evaluating |x|
sure but that doesnt mean we have to copy it down from whereever else we defined it
\begin{enumerate}
\item[$\implies$] Let $\abs{x}=0$. We consider two cases. Let first $x\geq 0$. From the definition of the absolute value it follows that $0=\abs{x}=x$, i.e. $x=0$. Let now $x<0$. Then from the definition of the absolute value it follows that $0=\abs{x}=-x$, hence $x=0$. In both cases we see that $x=0$.
\item[$\impliedby$] Let $x=0$. Then in particular $x\geq 0$ and from the definition of the absolute value it follows that $\abs{x}=x=0$.
\end{enumerate}```
for example something like that
but proof writing and formatting is somewhat subjective and other people will write and format it differently
Closed by @sand flume
Use .reopen if this was a mistake.
also if you think the arrows are too long, you can use \Rightarrow and \Leftarrow instead
you can also put them in () or in "" or something else
Ok thank you
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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,
Bayesian inference: Where does it comes the ' in the integral?
Or am I overcomplicating stuffs and it's simply the theta?
It’s just another symbol
It’s being integrated away
It’s just the dummy symbol for integration
@sullen scaffold Has your question been resolved?
Closed by @sullen scaffold
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
,, \int_2^n \frac{\ln(x)}{x^3} \dd{x}
criRata
not a lot else you can do
how do i verify if my work is correct?
look over it painfully
hi anyone?
no
this is my channel , go read those introduction channels
rules and other shit
i need to know what are the prerequisites of abstract algebra
bruh
or ask in #math-discussion
if its a question related to a hormework or smth , open a channel
Do you know the tabular method of IBP? Might prove to be a bit easier
bro its fine i'll ask them
hmm , i just use u ,du
and then integrate by parts
should i learn it ?
It's basically the same but using the tabular method can be easier to write
Integration by parts by using the DI method! This is the easiest set up to do integration by parts for your calculus 2 integrals. We will also do 3 integrals to illustrate the 3 stops of the DI method.
Dear calculus teachers, please let students use the DI Method (& why it is really the same as integration by parts) 👉 https://youtu.be/8xPfNu...
Closed by @upbeat timber
Use .reopen if this was a mistake.
You can get an easier IBP with the sub u=ln(x)
.reopen
✅
(or just a faster one)
criRata
is this where i ibp @dusty portal ?
Yes
proof writing
parsing logical statements
$\int ue^{-2u}du$
set theory
;(
!occupied
Someone else is already using this help channel. If you need help with a question, please open your own help channel/thread (see #❓how-to-get-help for instructions).
Closed by @upbeat timber
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 I prove |. |x|-|y|. |≤|x-y|
!showyourwork
Show your work, and if possible, explain where you are stuck.
Ok so I have attempted it in two ways
@exotic stratus
I then tried using the triangle inequality but that was also a dead end
What domain are you working in?
i.e. are x and y real or complex numbers?
Real
If you go case by case this will be lengthy but that is the simplest way
Yes I tried that but I must have made a mistake which I cannot seem to find since it gets equal not less than or equal
Quick question you state that case work is the longest what is a more efficient way then?
Yes, you aren't considering the differnt outputs when |x| > |y|, |x| = |y|, |x| < |y|
Prolly something with triangle inequality as you also guessed, though I don't see it immediately, I think there prolly does exist one.
Yes I saw this on stack exchange: https://math.stackexchange.com/questions/127372/prove-that-x-y-le-x-y
But it wasn't clear how they achieved the final results
Why do we have to consider these? So if I consider these do I need to look at the different values of x and y. Or is this more important than that. And if so why
@sand flume Has your question been resolved?
ill have to go soon so i prob wont be able to explain it, but this is wrong
if x < 0, then |x| should be replaced with -x
you replaced it with |-x|
it's not true that ||x| - |y|| = |x-y| in general
it's true for some specific cases (x, y > 0 or x, y < 0) but not in general
.close
Closed by @sand flume
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 tried graphing it
but like the equation for their intersection only gives it in x and y
$6x^{2}+4y^{2}+5\left(x^{2}+y^{2}\right)^{2}=30$
smeagol
but I'm not quite sure how to get the tangent lines
I think z is constant when they intersect
since it's like a slice of the elipsoid
but this makes me doubt that now 
z isn't constant when they intersect
since I see purple inside of the red and blue on the outsdie
z = x2 + y2
but I am not sure what strategy to use to get the tangent line
Implicit diff for the tangent line from this, I think
Do the gradient of both and then cross product
The cross product of the gradients at that point will give you a directional vector of the tangent of the tangent line to the curve of intersection
I got <48,21,-10>
as the cross product
wait i messed up
<-2,2,-1> gradient at (-1,1,2) for the first eq
I got <48,52,8>
<-12,8,20> for the gradient of the sec
gradients: -2 2 -1 and -12 8 20
I messed up with the first eq gradient's x comp
I got this now yeah
so now that I have the direction and point I am all done?
Yeah
just x= 48t-1 etc
Closed by @safe onyx
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
googoogaga
Mb bro
anyways this is just killing me
Note: $\kappa(a, r)={z\in\bC:|z-a|=r}$\
$I=\int_0^{2\pi}\frac{\frac12+\frac12\cos(4\theta)}{1-2p\cos(\theta)+p^2}d\theta}=\frac12I_2+\frac12\int_0^{2\pi}\frac{\cos(4\theta)}{1-2p\cos(\theta)+p^2}d\theta=\frac12I_2+\frac12I_3$, where $I_2=\int_0^{2\pi}\frac{1}{1-2p\cos(\theta)+p^2}d\theta$ and $I_3=\int_0^{2\pi}\frac{\cos(4\theta)}{1-2p\cos(\theta)+p^2}d\theta$
;(
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
I'm slow at typing today
Jesus
So I know that $I_2=\int_{\kappa(0, 1)}\frac1{1-p(z+z^{-1})+p^2}\frac{dz}{iz}$ with the sub $z=e^{i\theta}$
Nah wrong
;(
I've seen something very similar; try to re-writing it as [\frac{A}{2i(1 - qz)} - \frac{B}{2i(1 -q \overline z)}] where $z \coloneqq e^{ix} = \cos(x) + i \sin(x)$, in the case of what I've seen, namely [\frac{q \sin(x)}{1 - 2q \cos(x) + q^2},] that was the way to go and rewrite this into a series
Kepe
This is really funny because it was on the last homework sheet at my uni
💀
Trying to find a fourier transform or something?
Maybe it could be rewritten in a similar fashion
Or just a conversion
Just conversion
I think I have the gist of it
Like, I "solved" it in my notebook but my working is very convoluted
I know how to get to the answer, I'm just not being precise
For convienience I'm just going to call $\kappa(0, 1)$ $\gamma$
(quadratic explaining the simple pole part)
and thennnnnn
Ugh, since 0<p<1 we have that 1/p is outside K(0, 1) but p is inside
So we only need the residue at z=p
So that is what I was missing
Now I guess we need to calculate I_3 with the same approach
;(
Use LaTeXOCR 
@gray widget Does it look good?
Fucking hell
<@&286206848099549185>
I gotta eat people
brr
GOOGOOGAGA
I NEED DA VERIFICATION
@dusty portal 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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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 help me understand what is going on here
<@&286206848099549185>
Ik whats going on
math
jk
<@&286206848099549185>
Any info about how g(x) and f(x) are related?
Show the full context
The rest if pretty simple
that's the full context
question 2
let me translate
and which line confuses you first
second
let u = x + 1 , x: 0 -> 2pi that means that u : 1 -> 2pi + 1
but what they wrote is u : -1 -> 2pi - 1
that's the translation
This is why they shifted the bounds in the 2nd line, so that after the u-sub they become the same as beforehand
yeah but the bounds seems wrong
how it's u = x + 1
u = x + 1
for the 1st integral:
when x = 2pi - 1 --> u = 2pi
when x = -1 ---> u = 0
(works)
2nd:
u = x - 1
when x = 2pi + 1 ---> u = 2pi
when x = 1 ---> u = 0
(works)
alright alright let me try to understand so let's say that you trying to integrate x from a to b and then from a - 1 to b-1 you will not get the same result meaning the changing the bounds without a changing the variable does affect the integral's result
i don't know how it worked here
and i really want to understand so i can use it later
but
hold on
does that have any relation with the 2pi period
@spark nebula Has your question been resolved?
Yes
Modus
In fact you can change the bounds in any way as long as they difference is 2pi
wait
I wrote it wrong
okay but again it works only for periodic funcs
Yes
Okay thank you so much
I recommend you to read this article
The guy literally had the same problem as yours
@spark nebula 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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
f^-1 denotes the preimage
@tidal turret Has your question been resolved?
@tidal turret Has your question been resolved?
@tidal turret Has your question been resolved?
Closed due to timeout
Use .reopen if this was a mistake.
,w solve x - 3y = 1, -2x + y + az = 2, y + bz = b - 3
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
yea can u translate it into english
Let B = ... be a basis of R^3 and f : R^3 -> R^3 be the linear map whose matrix wrt B for input and E for output is [see image].
Find a ∈ R such that f(1,2,-1) = (1,3,2) and for this value of a find all v ∈ R^3 such that f(v) = (1,3,2).
thanks ann
E stands for the canonical/standard basis, yes? @tidal turret
I was about to use my basic french to try and translate it
yes!!
i got some ideas
i'm riding on that and latin lmfao
i can find a such that the first condition holds
the problem is when i try to figure out the preimage of (1,3,2)
,w rref {{3,2,1,1},{1,2,1,3},{2,2,1,2}}
@lyric charm do you happen to see the mistake?
the answer is different, though, a = 3 is correct
uhh sorry im a little busy with other stuff and dont feel like reviewing your arithmetic and shit
@tidal turret Has your question been resolved?
Closed due to timeout
Use .reopen if this was a mistake.
.reopen
@tidal turret $$ \beta = 2 - \frac{\gamma}{2} $$
StrangeQuarkAL
yes xD
not (2-2gamma)/2
good catch, i found it a bit ago, fixed it, ty
no problem
isn't the (alpha, beta, gamma) you get from solving for the preimage expressed in B?
yes (x)B is equivalent to (f^-1(1,3,2))B
is a line of coordinates
yeah that's what I got as well
what?
thanks
but i think there is something
what else
i don't get the same line of solutions prof got, where is the mistake? 🤔
please don't leave, there must be a logical explanation
i'm looking don't worry
we found (v)B correctly
if you check in geogebra this two (x)B lines are the same line
oh
so we found (v)B correctly, but fucked up when finding all the v
there must be a logical explanation
no, we found it correctly
(5, 0, -1) + t (-1, 1, 0)
and (3, 0, -1) + s(1, -1, 0) describe the same line
wait no
yeah no, my bad
we made a computational mistake somewhere
ohhhhhh
🤔
i did both possibilities
i did (x,y,z)=(-1,y,4-2y) and (x,y,z)=(-1,2-z/2,z)
your teacher copied the answer wrong
this is how i got the lines earlier, which both are correct representation of (v)B
should be (5, -2, -1) not (5, 0, -1)
notice when they summed the vectors, they got (-L + 5, L - 2, -1)
so what we got before should still be correct
$$ (3, 0, -1) + t(1, -1, 0) $$
$$ (5, -2, -1) + s(-1, 1, 0) $$
are the same line
StrangeQuarkAL
bro my teacher is stupid
you are a genius mate!!
everyone makes mistakes :/
ha idk about that but thanks
sure, but you shouldnt do them where other people will use your solution to correct themswlves
because i have been stuck in this one for 24h
true true, it definitely becomes a hassle for everyone else
i appreciate it and sorry for wasting your time
you're welcome and it's all good! Maths is what summer break is for
you are a genius
ty for your time !!
.solved
Closed by @tidal turret
Use .reopen if this was a mistake.
no

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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
Hullo
Should my answer give the eigenvector solution in terms of basis for W?
Like always?
there's nothing wrong with that
for example here
what you shouldnt do is give the eigenvectors as for example (0,0,1)
cause that is not an element of W
Got it
thank you for confirming that's a good catch i should have thought of
.close
Closed by @nimble 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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
is there a way to simplify or do i just notice that denominator is bigger than numerator
@woeful turret what have you tried so far?
Just use standard limit properties
latter if you can prove it
You can divide the numerator and denominator by 5^n and handle it term by term
I think answer should be quite obvious
(notice that 5^-n / 5^-n = 1, so this is an allowed operation)
by that u mean handle each term in the numerator?
The thing is
There's a hidden 9^n in the denominator
and denominator
I see that now
So instead you'll want to use 9^-n / 9^-n
I think u can tell its over
Dont need it
Just neglect everything smaller
do need it if you want to prove it
The best solution is to factor out the numerator by the "largest growth term", and same for the denominator
can one person help
So factor out the 5^n above and the 9^n below
proof by BIGGGG
Also can be seen as q^n where |q| < 1 so it converges to 0
It's (5/9)^n factor some things that converge to a real number
So by product you should get the answer
0
oh ok so that is the only term we need to worry about? if that term was >1 then it would not converge?
It'd diverge to +oo (or -oo depending on signs)
Approaches to 0
This factoring out method is quite neat in general
ohh alr 👍 thank you
.close
Closed by @woeful turret
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.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• 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.
dim(U+W) = dim(U)+ dim(W) - dim(U interesct W)
dim(U+V) = P_3 = 4
dim(U) = 3
dim(W) = 1+ dim(U intersect W)
Hence D is correct
I stumbled looking at E. I felt like D would have be correct on exam, but I was unsure about why E was for sure wrong
can someone explain?
imagine if dim(W) = 4
the only 4-dimensional subspace of P_3 is P_3 itself
so W = P_3
then the intersection of U and W is just U
uhh, hold on 







