Show that |x|<2 => |(x^2+2x+7)/(x^2+1)|<15Do you mean
The inequality signs should be 'or equal to' .
Some hints on where to start be good. im not sure i can start with the second inequality cause of the whole P implies Q doesnt necessarily mean Q implies P thing
thanks FlorianKThat took a while, hopefully there are not errors in there...
any ideas on how to do the nasty integral? one of my mistakes was assuming |sin(x)cos(x)|sin(x)cos(x) is the same as sin(x)^2*cos(x)^2...that's the last thing i integrated before changing variables and getting the above erroneous answer
@dcc: how did you choose 10 and how do you the inequality is true?
triangle inequality gives you
Sorry for the late reply, took me a while to (and attempt to) digest that :P
For your claim and proof, are you proving that
is true?
Cause I think you used that in your proof in this part:
(looks like you subbed in)
Claim:
Proof:
N=1
Now assume this holds for N, want to show that
Now
What I did is called proof by induction. Proof by induction has three steps:
(i) Show that what you're trying to prove holds for the most basic case. This is called the base "case".
(ii) Assume that what you're trying to prove holds for all $n\le N$ where $N$ is some integer.
(iii) Using the assumption you made in (ii), show that it holds for $N+1$. If you can show that, then you have shown it holds for any value of $n$, since I can arbitrarily make $N$ as large as I want. It's a real, useful and fun proof technique. Specialist maths should include some of these proof techniques (including proof by contrapositive).
In general it is an idea called telescoping (funnily a lecturer once used this to show that maths has applications to astronomy :P )
In general notice thatwhere
is any sequence. To see this just reorder the terms as follows
1. hint: write an odd integer as 2k+1Spoiler
the first three terms must be even (or 0 when k=0), hence, adding 1 (an odd number) makes it's odd. hence, the cube of an odd integer is odd
Hmmm...I'm still confused by this part:
Cause to me, it looks like he used what he was trying to prove)
1. hint: write an odd integer as 2k+1Spoiler
the first three terms must be even (or 0 when k=0), hence, adding 1 (an odd number) makes it's odd. hence, the cube of an odd integer is odd
sorry again polar, but how would you say i communicate to my teacher that the first three terms must always be even..i understand it, but i don't know how to express it?
Yeah that's right, he proved exactly that by induction, usually the cleanest way of expressing it but not necessarily the most intuitive.
an even number can be written in the form, if we can write each of first three terms in this form, then they are even:
Ok, in the proof, the claim was forbut then we wanted to show that it was true for
, but how can we assume
is true when that's what we're trying to prove in the first place?
Did you really have to take the limit into the exponent or could you just...
1) What does 'coordinatewise addition' mean
2) To provewould this acceptable?
3) To prove \frac{a}{b}+\frac{c}{d}=\frac{ad+bc}{bc}, he starts with the RHS and shows that it's equal to the LHS. Is this an example of a case where P<->Q? Generally, how would you determine if P<->Q or just P->Q?
4) How would you write the set of all even functions using set notation?
This depends entirely on your definition of[/tex]
I don't understand your concern. Which statements are P and Q supposed to represent in this particular example? As an exercise you may want to prove this identity using the definition of fractions I gave above.
From the book ('Calculus' by Spivak), he says 'the symbol a/b means ab^-1.
why do we have to write a/b as ab^{-1}?
Look, when it comes to these sort of foundational things what counts as a proof and what doesn't largely depends on your definitions and what you already know1 (i.e what facts/theorems are you allowed to use). So as for your second query, it depends... sure it is a good enough proof if you already know that the real numbers have multiplicative inverses.
you told me that was the definition! so I used that definition, if you had given me another definition I would have used that definition. For such simple facts, might as well stick to the definitions and everything will work out.
[1] There are many paths one may take to develop the basics of the reals, I don't know which order Spivak goes in.
you should link arun's site about proofs here lol
What do you mean by not in standard form?
Do you mean something like?
In that case lets look at what happens when we expand it out.
Now we know that, which brings us to
Which is what you're teacher was getting at with real times real minus imaginary times imaginary.
I'll start with the sine case, (if we are integrating sine we will use Im part and if we are integrating cosine we will use the Re part, you'll see why later).
Now we notice that we can turn our expression into something involving a complex exponent.
Now we know that
Now if we wanted to take the imaginary part of our expression, how would we find it? What multiplied by what will give an imaginary part?
RealReal gives Real
ImaginaryImaginary=Real (the
terms comes out to give a negative)
RealImaginary=Imaginary
ImaginaryReal=Imaginary
So to find the imaginary part we need to look at the latter two.
If we wanted to take the Real part, when integrating a cosine, we would need to do the first two, that is the RealReal and Imaginary
Imaginary.
Hope that makes sense :)
How would you prove the product of a rational number and an irrational number is irrational?
Thanks
My question is how does defininglet us write g(x) in terms of n's rather than m's?
How would you prove the sequenceconverges to 0? I'm supposing you need to use the epsilons and deltas but not really sure how to manipulate that inequality to get find N.
Note that this is an assignment question so I'm only after some hints :p
I think I'm supposed to prove that it goes to zero ('show that the sequence converges to zero by arguing directly from the definition of convergence'). Worth 3 marks :PI'm assuming that you're just trying to make sure your answer was correct, but just to double check but you did submit the assignment yesterday right?
I'm assuming that you're just trying to make sure your answer was correct, but just to double check but you did submit the assignment yesterday right?:P :-[ :P :-[
1+0=1 which is not 0
nah no translation error :/
z=a*b*c
a,b, and c are positive integers
a² = 2b³ = 3c5
By how many numbers is z divisible including 1 and z.
The answer is 60, but I'm not sure why :/
So or my understanding:
If we have n=2x * 3y * 5z the number of divisors is (x+1)*(y+1)*(z+1) ?
From which 'part' of math did you learn this? discrete mathematics?
Let Z be the amount of 8 digit numbers of which all 8 digits are different from each other and from 0.
How many of those numbers are divisible by 9?
Z/8 | Z/3 | Z/9 | 8Z/9 | 7Z/8 |
How would you show that when you rotate a square, the angles the edges make with the horizontal and vertical are equal? (i'm just assuming it's true :p)
Can you be a bit more specific? Is the rotation by any angle? Which horizontal and vertical are we talking about? And which angle specifically?
How do I do d^4/dt^4 (e^(-t) cos(2t))? Thank you
Thanks guys. Also, can someone explain to me how
Re(1+sqrt(3)i)^51 can be written as -2^51
and
Im(1+i)^75 can be written as 2^37?
I havn't done the calculation myself, but I notice that the two vectors are of norm. So perhaps you forgot to divide out by the norm.
Seeing that you actually GOT an answer (and presumably not the right one) you should actually show us WHAT YOU DID so that we know whether you "used the wrong formula".
It was suggested I use the geometric series but I haven't learnt that yet so I'm hoping there's an alternative method.
1) Let A be a 50x49 matrix and B be a 49x50 matrix. Show that the matrix AB is not invertible.Bahahaha. Are these MATH1115 questions? I remember teaching these two years ago :P (the only difference was that 2013 was replaced by 2011, for obvious reasons...).
If A is a 50x50 matrix then shouldn't it be invertible?
------
2) If A is an nxn matrix such that, show that
is invertible and find an expression for [itex](A+I_n)^{-1}[/itex]
It was suggested I use the geometric series but I haven't learnt that yet so I'm hoping there's an alternative method.
------
3) Define [itex]e^A=I_n+A+\frac{1}{2!}A^2+\frac{1}{3!}A^3+...+\frac{1}{2012!}A2012[/itex]
where A is an nxn matrix such that [itex]A^{2013}=0[/itex]. Show that [itex]e^A[/itex] is invertible and find an expression for [itex](e^A)^{-1}[/itex] in terms of A.
...'bout to attempt this one again but I just know I'm not gonna get far...so here it is...
------
3) Show thatand use this to show that the limit as
approaches infinity is infinity. n is any positive integer.
For the first part, I did used the previous resultand inserted an 'n' with no justification of where I put it and then multiplied by
. Is this valid?
I'm not sure how to do the limit part though.
I guess it is valid, but what argument are you using to show that the denominator goes to infinty?
If you are using the argument thatis exponential in t and
is polynomial in t (monomial even), couldn't you do that without rewriting it?
In any case, I would start by taking the x in the denominator outside the limit. From there, if you want to show things more explicitly, maybe you could consider applying l'Hopitals rule and induct (i.e. show that upon repetition of l'Hopitals rule the numerator becomes constant in t).
I was a bit hesitant in using l'Hopital's rule cause I thought that came after the chapter I'm on but turns out it was a couple of chapters back :p
So we would apply the rule x number of times until the numerator goes to 1 (taking out the constants of course) and then have 1/e^t, which would go to 0
I see, so in other words we want to see that the following is the identity matrix:
Now use the relationwhich follows because the entries of
are
Theorem:
For each positive integer n, let P(n) be a statement. If
1) P(1) is true and
2) the implication if P(k), then P(k+1) is rue for every positive integer k,
then P(n) is true for every positive integer n.
Proof:
Assume that the theorem is false. Then conditions 1 and 2 are satisfied but there exists some positie integers n for which P(n) is a false statement. Let S={n∈N: P(n) is false}. Since S is a nonempty subset of N, it follows by the well-ordering principle that S contains a least element s. Since P(1) is true, 1∉S. Thus s≧2 and (s-1) is in N. Therefore (s-1)∉S and so P(s-1) is a true statement. By condition (2), P(s) is also true and s∉S. However, this contradicts our assumption that s∈S.
s is the smallest natural number for which the statement P(s) is false. Since P(1) is true (statement #1), s must be greater than or equal to 2. Since s >=2, s-1 is a natural number and we know that P(s-1) is also true; but by statement #2 if P(s-1) is true, then P(s) must also be true. Hence we have a contradiction and S must be an empty set.
I don't get the bolded bit. Is there any significance to saying (s-1) is in N? Are they not all in N?
For each positive integer n, let P(n) be a statement.
But didn't we already say s>=2?
Since s >=2, s-1 is a natural number...
Firstly, e^x > 0. I'll denote e^x with y and y>0.
Now cot y = 1/(tan y)
Therefore arccot (cot y) = y = arcccot(1/tan y) = arccot (cot y)
But tan y = 1/ cot y so y=arctan(1/cot y)
So arctan(1/cot y) = arccot (cot y)
arctan 1/y = arccot y = pi/2 - arctan y
Therefore arctan 1/y and -arctan y differ by a constant, so when integrating these two forms are equivalent.
for
And sure, since we only care about how it behaves asis large we could have restricted ourselves to
and obtained a similair inequality. But that isn't necessary, this was good enough.
Does it make sense to talk of a union of a set with one of its subsets?
When proving by induction, when you assume P(n) is true, this only applies for P(n), right?There's the idea of strong induction where you show that P(k), P(k+1), ..., P(n) are true, then P(n+1) is true for some
You can't assume P(n-1) as well...just want to make sure cause only way it's the only way I know how do one of the assignment questions :D
The difference is in what you need to assume in the induction step. For ordinary induction--in the ladder metaphor--you simply go from the rung you are on up to the next one. For strong induction, you need to know that all the rungs below the rung you are on are solid in order to step up. As a practical matter, both have the same logical strength when you apply them - since as you climb up the ladder from the bottom rung, you sweep through all the intermediate rungs anyway.
Ah thanks laser. How're you finding the calculus part by the way? the notes look insane lolYeah, I'm finding it pretty interesting. Its mostly the suggested questions from that Trench Real Analysis book where I've been spending the most time on. I've also been reading through Spivak Calculus (the last part of it is basically what we're covering now) and a couple of other books too.
Yeah, I'm finding it pretty interesting. Its mostly the suggested questions from that Trench Real Analysis book where I've been spending the most time on. I've also been reading through Spivak Calculus (the last part of it is basically what we're covering now) and a couple of other books too.
I wish the Linear Algebra part of the course would speed up the pace though, I really hope we're done with chapter 4 of the book now.
7) Suppose that(finite) and, for each
for large n. Show that
Assignment question:I was stuck on this one too. The way I've gone about it is to have a close look at the hint (you can see what it says in the hint is true by substituting in the equation we have for the unit tangent vector and using the various properties of dot products), the equation we're told to consider and also look at the results you proved in the previous parts of the question (you can see they carry over the multivariable case if you start off with x(t,s) etc. instead of x(s) with your proof of those).
(http://img94.imageshack.us/img94/6560/yf6j.jpg)
If I'm not wrong, we're supposed to prove this, right? If so, anyone feel like pointing me in the right direction? I'm thinking perhaps mean value theorem only because I've seen them used to prove inequalities but still not quite sure how to apply that here.
I was stuck on this one too. The way I've gone about it is to have a close look at the hint (you can see what it says in the hint is true by substituting in the equation we have for the unit tangent vector and using the various properties of dot products), the equation we're told to consider and also look at the results you proved in the previous parts of the question (you can see they carry over the multivariable case if you start off with x(t,s) etc. instead of x(s) with your proof of those).
I had this theorem pointed out to me, but you can interchange the order that you take the partial derivatives http://en.wikipedia.org/wiki/Symmetry_of_second_derivatives#Formal_expressions_of_symmetry I haven't been able to prove this yet, I'm assuming it's in the textbook somewhere.
This one feels like it should be really easy - expressin terms of hyperbolic functions
Let y = f(x) = tanhx = (e^x - e^(-x))/(e^x + e^(-x))
To find arctanhx, swap x and y.
x = (e^y - e^(-y))/(e^y + e^(-y))
x (e^y + e^(-y)) = (e^y - e^(-y))
x e^(2y) + x = e^(2y) - 1
(1 - x) e^(2y) = 1 + x
y = 1/2 ln((1+x)/(1-x))
So arctanhx = 1/2 ln((1+x)/(1-x))
So it seems that ln((2+2x)/(1-x)) = 2ln2 arctanhx
Crap. I knew I forgot something there. However your final step is flawed. You mean 2 (ln 2 + artanh x) right?
If, and
is the complement of
in
, does
?
Don't know why the tex part isn't working but I'm asking if the union of A and the complement A^c equal to X
Can someone please help me with this question?
a positive integer has two digits. The sum of its squares of the digits is 34. The integer formed by reversing the digits is 18 less than the original number. What is the integer?
How do you evaluate? Tried L'hopital's rule but ended with something like
and differentiating top and bottom just gives pretty much the same thing
If the edges of a rectangular box were increased by 1cm, 2cm and 3cm respectively, the box would become a cube and its capacity would be increased by 101 cubic cm. Find the dimensions of the rectangular box.
How would I go about doing this question?
^ just plug in the given values of x and y and solve for a
how do you getfrom antidifferentiating
i'm getting
from substitution + partial fractions but the plot doesn't fully agree with the solution wolframalpha gave
Erm...I don't think I quite understand your answer. I don't think you're meant to get a spare (1+cos x) term anywhere. Is that under another log or something?
dx/sin x => sin x dx/(1-cos^2 x)
Let u = cos x, du = -sin x dx
Integral becomes du/(u^2-1) => du/2 (1/(u-1) - 1/(u+1)) => 1/2 ln(1-cos x) - 1/2 ln(1+cos x) after integrating and back subbing
That's what you meant, right?
Yeah, typo - was in a hurry when I was writing that
OR you can do this
1/(sin x)
Sub t = tan x/2 (dirtiest substitution trick in the book)
You can show quite easily that tan x = 2t/(1-t^2), sin x = 2t/(1+t^2) and cos x = (1-t^2)/(1+t^2) , dx = 2 dt/(1+t^2)
so our integral becomes (1+t^2)/2t * 2dt/(1+t^2)
The 1+t^2 terms drop off
so our integral is just dt/t
We're left with just ln (tan x/2) which really should appear as ln(sin (x/2)) - ln(cos(x/2))
Is the intersection of finitely many closed sets closed? I'm aware it is for a 'collections of sets' but I'm not sure if this means that it has to be an infinite collection or it can be finite.
In general, if something is stated for an indexed collection of sets, does it mean it applies to both finitely many and infinitely many sets?
Is the intersection of finitely many closed sets closed? I'm aware it is for a 'collections of sets' but I'm not sure if this means that it has to be an infinite collection or it can be finite.
In general, if something is stated for an indexed collection of sets, does it mean it applies to both finitely many and infinitely many sets?
Is the intersection of finitely many closed sets closed? I'm aware it is for a 'collections of sets' but I'm not sure if this means that it has to be an infinite collection or it can be finite.Yes. In fact, it holds even stronger than that, the intersection of any arbitrary collection (could be infinite) of closed sets is closed. The proof is very straightforward, just a simple application of De Morgan's laws and the relation between open/closed sets.
How would you evaluate thiswithout using trigonometric or hyperbolic substitutions? Also for
(I tried u=x^2+a^2 and ended up with an integral of the second form)
A florist has to make a floral arrangement. She has 6 Banksias, 5 wattles and 4 Waratahs. All the flowers of each kind are different.In how many ways can the florist make a bunch of 10 flowers if she has to use at least 3 of each kind ?
Thanks
Ummm .... I'm not too familiar with Combinatorics either. So could you explain it in better detail ? Thanks anyways for this answer anyway !!!!! :)