You are not logged in.
1) Use (For all epsilon>0)(There exists delta>0) such that (0<|x-c|<delta ⇒ |f(x)-L|<epsilon) to prove limx->c (f(x))=L for the following:
(a) limx->4 (√(x))=2
(b) limx->2 ((x³-8)/(x²-4))=3
2) Let I be an open interval that contains the point c and suppose that f is a function that is defined on I except possibly at the point c.
(a) State the definition for a function that does not have a limit at c. Then use it to prove that limx->0 (sin(1/x)) does not exist. (Hint: limx->c (f(x))=L if and only if limn->infinity (f(Xn))=L)
(b) State the definition for a function that does not have a limit at any point on the interval I. Then use it to prove that the function X(CHI)subQ (x) does not have limit at any point.
3) Let f: (a,b) -> R be continuous at c ∈(a,b) and suppose that f(c)>0. Prove that there exist an interval (u,v)C(a,b) such that c ∈ (u,v) and f(x)>0 for all x ∈ (u,v).
4) Suppose that f is a continuous function defined on an interval I. Prove that |f| is continuous on I.
5) Suppose f is an increasing function defined on an interval I. Prove that f can have at most countably many discontinuities.
Please, this is my practice test to get ready for my final exam, could someone please help me out on these, I would appreciate it very much.
I need help with these practice problems. If anyone knows how to do them, I would be very appreciative if they would help.
{Xn} is a sequence.
1) Suppose that {Xn} converges to L and that L > 0. Prove that there exists a positive number E and a positive integer N such that Xn ≥ E for all n ≥ N.
2) Let {Xn} be a sequence of real numbers that converges to infinity.
(a) Prove that {Xn} is bounded below.
(b) Let {An} be another sequence. Suppose there is a positive integer N such that An ≥ Xn for all n ≥ N. Prove that {An} converges to infinity.
4) Let {An} and {Bn} be two number sequences. Suppose {An} is increasing, {Bn} is decreasing, and An≤ Bn for all n.
(a) Prove that both sequences converge.
(b) Must both sequences converge to a same limit? Give proof or disproof.
5) Let {An} be a sequence of nonnegative real numbers that converges to A. Prove that the sequence {√An} converges to √A.
I need to find a function that is one-to-one and onto between the set A:{(x,y); x,y∈Z+} another words, the set of ordered pairs (x,y) such that x and y are positive integers, and the set of positive integers.
So, I have to come up with f:A to Z+ such that f(x,y) is one-to-one and onto.
Please someone help, I have been trying to come up with one for a while. I was trying to maybe come up with another set that I know has a one-to-one and onto function g with respect to the positive integers that would be easier to come up with a one-to-one correspondence between A and that set, then I could conclude that f o g is one-to-one and onto. I don't know if that even makes any sense, but if not, I just need a one-to-one and onto function from A to Z+.
Could someone please help me solve this ODE for my practice test. I only need to know how to get to the Implicit solution.
dy/dx = (4x^3*y^-1 + 12x^2)/(x^4*y^-2+4y)
Please help me out, my midterm is Wednesday and I need to know how to solve one of these types of ODE's.
Thanks.
I am having trouble with a couple of problems on my practice homework, could someone please help me figure these out, thanks.
1) For each pair of sets, find an explicit one-to-one correspondence between them. That is, find a one-to-one and onto function that maps one set onto the other.
(a) The even positive integers and the odd positive integers.
(b) The interval (-1,1) and the interval (0,1).
(c) The interval (-∞,∞) and the interval (-1,1).
(d) The interval (0,1) and the interval [0,1].
2) Let S be a nonempty set of real numbers that is bounded above. Let B=supS and let E>0 be a constant.
(a) Suppose that B is not an element of S. Prove that the set A={x∈S:x>B-E} is infinite.
(b) Give an example in which the set A is countably infinite, and another example in which A is uncountably infinite.
Please help, I would greatly appreciate it.
Can't you just plug it into the 89?
Hi guys, thanks you were a huge help last week. I have a couple more homework questions that are troubling:
Some of these may seem very simple to you guys, but I am just getting started in this, and it is very difficult for me.
Thanks
Thank you so much this was a great help!
Prove that m^2 - 25m > 0 for all m>25
Proof by induction:
Basic step:
Assume P(m): m^2 - 25m > 0 for all m>25
Prove P(m+1): (m+1)^2 - 25(m+1) > 0
Induction step: P(m+1): (m+1)^2 - 25(m+1)= m^2 - 25m + 2m - 24 This is where I am stuck! I don't know what to do from here.
Could someone please help?
1) Prove that every decimal expansion represents a real number.
2) Let A and B be nonempty sets that are both bounded above. Define a set C by C={a+b:a∈A,b∈B}. Prove that C is bounded above and supC=supA+supB.
--------------------------------------------------------------------
Prove that the supremum and infimum of the open interval (a,b) are b and a, respectively.
Don't even know how to start.
--------------------------------------------------------------------
Prove that the set S={x∈R: (x^2)-25x>0} is unbounded.
I know that a set S is unbounded if for each number M there is a point x∈S such that |x|>M.
I just don't know what to do from here. I am not sure if I am supposed to prove by contradiction or directly. I tried to do it by contradiction, but I don't know how to set it up. Please help me on this, thanks.
Let a be a nonzero real number and let S be the set: S = {x∈R: |x-a| < |a|/2}
(a) Show that |x|>|a|/2 for all x∈S.
(b) Write S as either an interval or a union of intervals.
Please help me on this, thanks!
Let G = Z x Z, be the group consisting of all ordered pairs with entries in Z.
Let H be the set of all elements of R of the form a + b√2 where a and b are integers.
R denotes the real numbers and Z denotes the integers and both R and Z are groups under addition.
Assume a + b√2 and c + d√2 are elements of H. Prove that if a + b√2 = c +d√2, then a = c and
b = d. To do this, you may use that √2 is not a rational number without proving it.
Let n be a positive integer, and consider U(n), the group of units in Z sub n. We know that
theta(n) = |U(n)|.
a) Assume a is an element of U(n). Prove that if r is equivalent to s mod theta(n), then a^r is equivalent to a^s mod n.
b) Is the converse of a) true, in other words, is the following true: If a is an element of U(n) and a^r is equivalent to a^s mod n, then r is equivalent to s mod theta(n).
That is another good one, Ricky. Thanks.
Thank you JaneFairfax. You were a great help!
Let G be a group and assume that every nonidentity element of G has order two. Prove that G is abelian.
Ricky,
In my proof where I have "Now we will assume two cases, either f(s) is an element of s or f(s) is not and element of s. If f(s) is an element of s, then s is a subset of A and f(s) is not an element of S." My professor says that I need to be more explicit here. He says that I need to use the assumption that f is injective here to have it make more sense before I declare it a contradiction. I have stared at it for hours and don't understand what it is he wants me to say. Maybe you could help me out on this. Also, where I have my other case too. He is asking for clarification. I don't know how to do it.
Ricky, I tried doing the proof like you said, I am not sure I fully understood what you were saying. Could you please look at the draft I sent my professor and help me on this, thanks. The red comments are from my professor.
Let A be a set. Prove that there is no injection f: P(A) to A.
Please someone help me on this!
I have started it by supposing there is an injection f: P(A) to A.
I am not sure where to start. I don't even know what my cases could be.
I understand the base case, but I am not sure how to set up my problem to take k away. I am really confused by all of this because I have not seen any examples in class on this sort of proof. My Prof. is in to discovery teaching, so he doesn't give us any examples.
Prove by induction the following: Let f be a bijection from [m] to [n]. Prove that m=n.
Please someone help me. Thank you.
Thank you Ricky and Jane. You were both very helpful.
Are you saying that the n is the number of '{' surrounding the empty set?
Define a sequence of sets E sub n for n≥0 by setting E sub 0 = empty set, and for n greater than 0, E sub n = {E sub n-1}. Prove that these sets are all distinct, that is, that if m≠n, E sub m ≠ E sub n.
I hope you know what I mean by E sub n, because I don't know how to type this here without MathType. Please someone help me at least get started because I am confused at what I am supposed to do.
Thank you Ricky, I appreciate it.