What are you up to @usukidoll? Still need some help?
Though looknig over it it seems you reached the step before the final one.. Just need to use the definition of $+$ (symmetric difference I assume) again over that
I have an algorithm that when I fee a set of 100 numbers to process takes 1 second when I double the numbers (200) takes 4 seconds, if I double again (400) it takes 16 seconds, for 800 takes 32 seconds
Hi guys, a quick question on terminology. What is that fundamental approximation called where you sandwich a value between a lower point and an upper point till you get a descent approximation.
@Nick I'm still guessing here but I'd call that "bounding the result". You know it's between two values so you keep going until you find something in the bounds.
@Anthony they are always there in the approximations, but they are getting squished into arbitrarily tight neighborhoods of the discontinuity, so that in the limit every point that is not the discontinuity itself gets to where it needs to be
so I shouldn't have taking the complement def of $A+B$ in the first place... I should've left it alone.. expand the symmetric difference and applied the distributive law for $ \cap C $ and then symmetric difference again
anyone seen this problem before or encountered something close to this just let me know :) http://math.stackexchange.com/questions/698478/a-problem-with-concyclic-points-on-mathbbr2 I have been banging my head with this one since 10 grade :P
now I'm trying to remember 2 questions oh man!!! I think the last one was about proving or disproving that two injective composite functions are injective
well I'm trying to remember a question oh man... it had something to do with proving or disproving that two injective composite functions are injective
what the hell... we have like a one to one situation twice
too bad I don't have my damn paper back... I'm trying to remember the last two questions
nughhh the struggle is real
see everyone pretty much f bombed on the midterm so the prof is allowing corrections...only problem is that I don't have my paper because I lost my voice over the weekend. the only questions I could remember on the top of my head are the set theory questions...I only remember a part of the function questions
either I have to wait until Wednesday to grab my stuff back and do the last two remaining questions or some kind soul from class would email the last two questions.
I can't remember every detail for those function questions.. except fragments.. the second to the last question was $X \rightarrow Y$ ... power set X -> Power set y onto... which means that there is a surjection
so I can't fully ask that question because what if I mess it up?
$(A+B) \cap C = (A \cap C ) + (B \cap C)$ $(A \cup B) \cap C = (A \cap C) \cup (B \cap C)$ only things I remembered
I messed up on the second one.. I've used set union and set intersection and got the symbols or something lost...
I only received like half the points for that one.. ... but wow I can't believe I just... : / so you can prove the first one after all...because complement defintion and symmetric difference are two different things...