« first day (1572 days earlier)      last day (3456 days later) » 

12:00 AM
@Pedro since I can fill the cycle structure in 5*4*3*2 ways, then I divided by 2*2*2 because it doesn't matter which element is first in each of the cycles, or which of the two cycles are first
 
Ooops.
@JustDanyul Wait, you mean $5!/(2!2!2!)$.
 
@PedroTamaroff Can we prove it like that?

$x \in V(IJ) \Leftrightarrow (f_i \cdot g_j)(x)=0$, where $f_i \in I$ and $g_j \in J$

$\Leftrightarrow f_i(x) \cdot g_j(x)=0 \Leftrightarrow f_i(x)=0 \text{ OR } g_j(x)=0 \Leftrightarrow x \in V(I) \text{ OR } x \in V(J)$ $\Leftrightarrow x \in V(I)\cup V(J)$

So, $V(IJ)= V(I)\cup V(J)$.
 
Pedro, haha, im getting confused, what you say makes perfect sense. but, my book shows the procedure above.
 
@Pedro @JustDanyul coming to think about it, mine does just the same.
 
@Pedro what confuses me, is that it seems like you have to count elements (--)() and ()(--) even if they are really the same. For example, that you have to count (1 2)(3 4 5) and (3 4 5)(1 2) as two separate element :S
 
12:05 AM
@JustDanyul Let's start over.
 
hahah :D
 
Let's do the easier one first which is (ab)(cde) in $S_5$.
Essentially, the idea is this.
You have $5$ elements.
 
@Pedro (im with you so far :D)
 
You can move them around in $5!$ ways.
Wait, we can do this differently.
Do you know about partitions and conjugacy classes?
 
i know about conjugacy classes. And partitions in the context of equivalence classes
 
12:11 AM
OK.
So, suppose you have a partition of $n$, $(n_1,\ldots,n_p)$.
 
@PedroTamaroff harro
 
Here $n_1$ is repeated $q_1$ times, and in general $n_i$ is repeated $q_i$ times.
So your permutation looks like $q_i$ $n_i$-cycles.
Then I claim the number of elements in this conjugacy class is $$\frac{n!}{\prod q_i!\prod n_i}$$
So for example $(ab)(cd)$ in $S_5$ is $(1,2,2)$.
This gives $$\frac{5!}{2!2}$$
Which is $15$.
By looking at the formula can you deduce a proof, @JustDanyul?
@anon What's up?
 
just got pikmin 2
plan to get pikmin 3 and smash bros
 
I have no idea what Pikmin is.
I do know Smash Bros though.
 
@Pedro that's very elegant. I'll have to mock around with it. I'm still not 100% clear on why the strategy in my book comes with a caveat. Hold on, let me show you a question I posed here earlier
2
Q: Cycle structure in a symmetric group

JustDanyulI have a bit of a problem. I'm currently reading about permutations, and I have a little exercise that asked me to find all cycle structures in $S_6$. I came up with the following $ ( -)\\ (- -)\\ (- - -)\\ (- - - -)\\ (- - - - -)\\ (- - - - - -)\\ (- -)(--)\\ (- -)(---)\\ (- -)(----)\\ (- -)(--...

@Pedro
oops
 
12:19 AM
@JustDanyul I'm looking at it. You can use the code [text](link) to avoid big links. Like "here, this is my question"
 
@Pedro ok :) thanks
 
Hah, doing it Alex's way indeed gives the right number of permutation. Which is odd since all disjoint cycles permute.
 
Its this bit "Note that we do not divide by an extra factor of 2 since 2-cycles and 3-cycles are different" I don't really understand. As in, that sounds to me like we are counting (ab)(cde) and (cde)(ab) is distinct elements :S
 
Indeed, I never got that either.
 
@Studentmat magic?
 
12:23 AM
Most likely there's a counting argument we're missing\don't understand just yet. But it might be magic too, who knows!
 
@JustDanyul I've given an answer.
 
@Studentmath im sure its the former :D
@Pedro thank you :)
 
"and since we care about the order in which the $n_i$ appear" @Pedro saves the day :)
So it's not magic @JustDanyul, just a missing counting argument. Such a shame
 
@Studentmath Some counting arguments are magic.
 
12:36 AM
I'd be lying if I said I completely follow Pedros example, but I'll get there (im currently on my first uni level pure mathematics course haha) :D
thanks alot for giving me something to grogg, I really appreciate it the help :-)
 
@TedShifrin I'm reading French.
 
Tu t'amuses bien? :)
 
I said I'm reading, not that I understand French. But I can guess that is "Are you being properly amused?" or something of the sorts. =D
Math-French is easier than French-French.
 
So I shall only address you in math French.
 
how do I tackle this?
which rational primes less than 50 are also Gaussian primes?
 
12:46 AM
For example, by context I can understand things as "Pour qu'un A-module à droite E soit M-plat"
@usukidoll Hint $5$ is not, since it is a sum of two squares. Generalize.
 
Subjonctif, even, @PedroTamaroff
 
so I got to find any number that's not a sum of two squares?
 
French is easy, @Pedro. Now read my profile.
 
It's Gaussian Integers stuff...not in my book, but I'm being tested on that shizzzzzz
 
@usukidoll: there's a convenient characterization modulo 4. See if you can't prove it.
 
12:47 AM
I hate hate chatting on Chrome on the iPad. I may give up chat on the iPad.
 
so would 4 not be one since $2^2+0^2$?
 
$4$ isn't a rational prime :)
 
ipad sucks anyway :D
what the
ok what are the rules to determine if there is a rational prime that's also a gaussian integer
 
no more help for @usukidoll
 
:(
oh I see we need all primers
up to 50 I think
 
12:49 AM
Bon soir!!
 
1 3 5 7 11 13 17 19 23 29 31 37 39 41 43 47 @AWertheim
like that?
 
Howdy @AWertheim ... How goes the job?
 
That's a start, @usukidoll: note, however, that $(1+2i)(1-2i) = 5$, so $5$ can't well be a Gaussian prime, can it? Try following Pedro's hint: this is the last I'll give.
Hey @TedShifrin! :)
Not too bad. Busy though. How are you doing?
 
Busy's good. Challenged?
 
Hello professor @TedShifrin.
 
12:52 AM
Hi @skull
 
Certainly. :) It's good honest work. Math's my passion, but this is nice in it's own right too.
 
whattt
 
@Ted So now we're up to about 18% of the first years using MSE. This might be a national best!
 
what the heck do I do? Come up with some weird (a+bi)(c-di) stuff?
 
LOL ... Using?
 
12:54 AM
ughhhhhh I need an example
besides 5
like try 11 ^_^
 
Sure, @Ted. Big kids learn something here too.
 
I don't think it can be represented as a sum of 2 squares... highest is $3^2$ and that's 9... 2 gets left out
 
Or teach ...
 
>_<
 
-_-
 
12:56 AM
Sam hasn't asked any questions yet... but I'm sure he has good ones.
 
gawd I need a definition of a gaussian prime or something
 
hint @usukidoll: What can $a^2+b^2$ be mod 4?
 
like what does it want?!
so I'm in mod 4 meaning $Z_4=[0,1,2,3]$
any remainder that i need to satisfy like does it have to be a 3 mod 4 or something
?
 
A Gaussian prime is a Gaussian integer $p$ such that if $p=ab$, where $a$ and $b$ are Gaussian integers, then $a$ or $b$ is a unit.
This is all you need to solve the problem; the next step is thinking.
 
maybe suppose p is 5 then a =1 and b =5? ok that's just lame-o
ok it has something to do with a+bi
complex imaginary numbers
 
1:01 AM
@usukidoll: do you know what the Gaussian integers are?
 
Have you ever heard of Gauss :P
 
it's a complex number a+bi such that the real part is a real integera nd the imaginary is the real part multiplied by the imaginary unit
@skullpatrol yeah I solved his ass in Elementary Linear Algebra in Gauss and Gauss-Jordan
but that's a different Gauss :P
 
ok so what next ~_~ @AWertheim
besides the a part being real and the b part being complex
 
@usukidoll: I think you've been given many hints and need to do some focused thinking. Try writing some things down. But first, I don't think your definition of a Gaussian integer is quite right, if I understand you. So here's a clearer definition: a Gaussian integer is a complex number $a+bi$ such that $a$ and $b$ are integers.
 
1:06 AM
so a and b belong in Z because Z is the set of integers
 
Yes, that's right.
 
Good clear def^
 
so do I just choose some random a and b? ok wait so I know a and b are integers

and we need all primes less than 50
1 3 5 7 11 13 17 19 23 29 31 37 39 41 43 47
 
$a$ and $b$ are not random, and you are not "choosing them", per se. I think you need to carefully read the task at hand. Here is one final hint: try to see when $(a+bi)(c+di)$ is an integer. That may help you determine why you're interested in numbers representable as a sum of squares in the first place.
 
but also the question is which rational primes less than 50 are also Gaussian primes?
so we need to know which one on the list is a Gaussian Prime which is a Gaussian Integer divisible by two distinct... Gaussian Integers
ac+adi+bci+bd(i^2)
$ac+adi+bci-bd$
becomes an integer when the i's get lost or something
I need an example ._.
 
1:11 AM
Time to put on your "thinking cap"
Make your own simple examples.
Work them out yourself
 
^ shut up
 
@AWertheim can we do an example? Maybe that may help.. let's try 11 instead of 5
 
@usukidoll Actually no.
You should hush and think.
 
^ I used to eat your rabbit avatar
 
1:15 AM
Step back and look at the picture everybody in here has given you.
 
I AM TRYING TO
STOP BEING MYTHICAL GEEZ
get straight to the point
 
@usukidoll That's useless.
You have to think.
 
no it's not
 
Dude. Skull is being very nice and trying to help you.
 
"get straight to the point = give me the answer"
 
1:16 AM
no I just need an example so I can follow along
besides 5 because that is obvious of course it's not a rational prime due to (2+i)(2-i)
hmmm...
 
What was wrong with the example of $5$, along with the other suggestions given? Did you notice anything special about the factorization $(2+i)(2-i)$?
Math is difficult. The answer isn't always going to be evident after a few minutes. You have to be patient, sit down, and write down a few things. Don't take "the obvious" for granted. Working out examples can help you figure out why things work in one situation, but don't in another.
 
if I expand it, it becomes 5.
$2^2-2i+2i-(i^2) = 4+1=5$
noting that $i^2=-1$ and the negative distributes
aiyahh! Don't we need the norm too?
 
What about the norm? Why is it relevant? I'm not saying it's not, but you can't just jumble together concepts that are loosely related in your head. Try to fashion these into a coherent understanding of the problem, starting with understanding what you are trying to do in the first place.
 
There are no royal roads in mathematics
 
I got two questions. What's the term for the polynomial that has roots the powers of the generator of a group, and what's the fastest way to find a group knowing its generators
 
1:22 AM
skull I am going to throw PDEs if you don't knock it off. Obviously, PDEs are way more lengthy than number theory
I don't see anything special with the 5... argh
let's try this again... gonna gather what I have
let's see we have integers a and b...
Gaussian integer is a complex number $a+bi$
all primes less than 50 - 1 3 5 7 11 13 17 19 23 29 31 37 39 41 43 47
need to find out which rational primes on this list is a Gaussian prime.
so we need to find out when $(a+bi)(c+di) $ is an integer that I need and determine if it's a Gaussian prime which is a Gaussian integer p such that if p=ab, where a and b are Gaussian integers, then a or b is a unit. So I need to apply all those numbers and see if it's a Gaussian prime or not.
hmm... if we have 2 and 5 and represented as sum of two squares then we have $2^2+5^2 = 4+25=29$.. well that's a prime in the set of integers
so would that mean that I would have $(2+5i)$ as a Gaussian prime?
 
@UserX Has Anyone Really Been Far Even as Decided to Use Even Go Want to do Look More Like?
 
the capitalization threw me off
also, no i haven't gotten around to reading that @PedroTamaroff
 
@KarlKronenfeld Sorry, almighty Karl.
@KarlKronenfeld Dang, read my mind.
 
@PedroTamaroff is my question really that nonsensical?
 
yeah
 
1:34 AM
if I make like >9000 assumptions I can understand it.
 
@KarlKronenfeld one does not simply make over 9000 assumptions.
 
hmm I don't think we can have 3 as a sum of squares... I think 1 would be since $1=1^2+0^2$
 
someone should finish off this question
 
$ 5 = 2^2+1, 13 = 3^2+2^2$
$17 =4^2+1^2$
 
Mike: done!
Or, at least, only one to go.
 
1:35 AM
cool stuff @usukidoll
 
I'm dying from this problem :/, but at least I'm trying
 
@usukidoll Hint $p=1\mod 4$.
 
so I need a remainder 1 in mod 4
 
Yeah, bro.
 
17 will work
 
1:36 AM
Why though?
 
13 too I believe
and 5.. oh I need all primes that are congruent to 1 mod 4
 
Yeah, bro.
 
where 1 is the remainder and I'm in mod 4 land which is $Z_4=[0,1,2,3]$
 
or do you?
 
Example1; $x^3-1=(x-k^0)(x-k)(x-k^2), k=\exp (2i\pi/3)$. $\{k^0,k,k^2\}$ form a cyclic group. What's the name for $x^3-1$?
 
1:38 AM
there isn't one, because there isn't something like that for groups in general
 
$2^2+5^2 =29$
$29 = 1 mod 4$
yayyy
so far I got 5,13,17,29 all can be represented as a sum of 2 squares and have a remainder 1 in mod 4
37 is also possible since $37 =6^2+1^2$
 
so you can list all rational primes <50 that can be represented as the norm of a Gaussian integer. woohoo. What can you do with that?
 
I'm getting there .__.
 
Example2; $\langle \{(1,2,3,4),(1,2),(1,2,3,4,5,6,7)\}\rangle$ are the generators. What's the fastest way to see if they'll form a cyclic group and find $n$ in $\Bbb Z_n$?(numbers are random)
 
so the conditions are needs to be represented as a sum of 2 squares... needs to have p = 1 mod 4 where p is the prime.
hmm what if $37=6^2+1^2$ could also be represented as $=(6+i)(6-i)$
$6^2-6i+6i-(-1)^2=6^2+1^2=37$
let me guess this is far from over isn't it? o_O
 
1:42 AM
aha
is 37 prime in the Gaussian integers?
 
@usukidoll: that's a good start.
 
Great work pal
 
@Karl should be isn't it
so I'm finding all primers less than 50 that I can represent as a sum of two squares and must satisfy p=1 mod 4 where p = prime before I can represent it as a (a+bi)(c-di) combination?
 
Remove that question mark from the end of that sentence yourself
 
1:47 AM
That's why it's called self-studying.
 
hmmmm......is 37 prime in the Gaussian integer (I'm seeing that it's not :/)? does it mean that I need p =3mod4 for it to be considered a gaussian integer
 
You JUST wrote $37=(6+i)(6-i)$. That's a factorization of $37$ into a pair of Gaussian integers, neither of which are units. Now reread what Mike told you.
 
now I am going backwards if we have a prime in Z then it has to be a Gaussian Prime. So how come 29 works well and 37 may not?
hmmm...all of my primers as sum of squares < 50]
$1=1^2+0^2$
$5=2^2+1^2$
$13=3^2+2^2$
$17=4^2+1^2$
$29=2^2+5^2$
$37=6^2+1^2$
$ 1 = (1+0i)(1-0i)$
$5 = (2+i)(2-i)$
$13=(3+2i)(3-2i)$
$17=(4+i)(4-i)$
$29=(2+5i)(2-5i)$
$37=(6+i)(6-i)$
missed a number
$41=4^2+5^2 = (4+5i)(4-5i)$
and then....there was silence in the chat room..which reminds me...lunch time
 
 
4 hours later…
5:38 AM
Wow, chat's quiet tonight.
 
hiya
 
Hey there Mike
You on break yet? We get the whole week off here at UGA, but other schools seem not to get the whole week.
 
Next week.
We get thurs/fri off
 
Ah
@MikeMiller, might be a stupid question, but someone was in here earlier asking why (1,2,3)(4,5) and (4,5)(1,2,3) are considered two different elements in $S_5$, and I realized I didn't know myself. I didn't have the time to stick around to see the explanation though. Why is that the case?
 
They're not.
 
5:50 AM
Ok, then that is consistent with what I thought to be true.
I was really confused for a while.
 
I mean, it depends what you mean. If you let $g = (123)$ and $h = (45)$, then you're writing $gh$ and $hg$ which are not a priori the same. But in this case, since the cycles are disjoint, they commute, so $gh = hg$.
 
Certainly
 
hey
 
Hey there @beginner
 
hello kaj hansen, this is my first time on a chat
 
5:57 AM
:D
 
did you see my question about russells paradox?
 
I'm reading it now
I know very, very little about logic/foundations of math though.
 
Creepy, @Kaj. Do you read everyone's questions when you meet them?
 
there are a heap of questions so it would be hard to keep up with all of them
 
I click on people's profile when I meet them @MikeMiller
 
5:59 AM
What if their profile contains deeply personal info?
 
Then that's on them, lol
 
(I'm kidding, of course)
 
so ZF forces us not to refer to the universal set?
 
I wouldn't know :/
I'm fairly sure my school doesn't even offer any foundations courses
 
6:03 AM
Yes, @beginner.
Neither did mine, @Kaj, but I picked stuff up. You can learn outside of class!
 
i don't know what foundations courses are actually, this was just something i wanted to know from reading about naive set theory
 
@beginner Russell's paradox is actually a proof that there isn't a set that contains all sets that contain themselves.
 
@MikeMiller so since this is the case, we can't construct a set that contains itself, as we build some set B, off of A for example
 
Hello guys. A moderator on a math forum pointed out errors in some stuff of mine, but I can't actually see what he refers to. It turns out we was wrong in saying a lemma was incorrect, that is, "you need more conditions if you want to keep the same conclusion." Now I'm looking at the other two remarks.

> "It seems that the first major mistake is the first inequality, where you absorb the factor of 1/2 without justification. In fact I can't find any number for which the assertion holds -- I searched to 10 million." Here's what I did:
 
Absolutely @MikeMiller. I'm actually a big fan of autodidact-ing. Personally, I just don't find foundations interesting enough to self-study in any serious depth, lol.
 
6:05 AM
oh okay, that makes sense
is ZF in foundations? what is foundations?
 
(I can't see LaTex so there might be some typo)
 
@beginner, I mean foundations of math. I.e. mathematical logic, and I'd probably lump mathematical philosophy in there too.
 
Yes you can, @VincenzoOliva. Look at "Latex in chat" on the right.
@beginner The difference between ZF and naive set theory is that in naive set theory, given a statement $\phi$, there's always a set $\{x : \phi(x) \text{ is true}\}$; for instance, $\phi$ could be $\phi(x) = \text{every injective map from } x \text{ to itself is a bijection}$
 
@KajHansen oh okay, i am just starting to learn math now . the most we have done in school in algebra is a=b+c elimination and substitute so far
so some set constructed from each x subbed into that statement
 
It's just the set of all things for which $\phi$ is true.
 
6:08 AM
I think it's interesting that you're asking about ZF in that case @beginner. Are you in high school? Undergrad?
 
@KajHansen primary school, but don't tell the site because it didn't let me put my age in
 
If $\phi(x)$ is "$x$ is a subset of $\Bbb Z$" then the set you get above is $\mathcal P(\Bbb Z)$, the power set of $\Bbb Z$ - this set is totally alright, it exists, everything's fine.
 
i just got told about ZF when i asked, i don't know anything about it really
 
This is known as the principle of unrestricted comprehension. But Russels paradox shows that there isn't a set $\{x : \phi(x) \text{ is true}\}$, where $\phi$ is "$x$ does not contain itself".
 
let me understand that for a little mike, so much information thank you
 
6:10 AM
So our assumptions are contradictory! That's bad. So we recast set theory with a new set of axioms - the ones we liked most ended up being called ZFC - that didn't contain the principle of unrestricted comprehension.
 
There are actually quite a few people who frequent this chat who are in middle school and the sort.
 
@MikeMiller In fact I already had those bookmarks, but it wasn't working strangely. Now I clicked on them and it worked, uhm.
Not that much, actually. I can't see in LaTex what you typed.
 
Anyone want to offer some advice on whether this question is suitable for migration to you?
 
so i have all the subsets of integers, so infinite sets of increasing number of elements in each, all in one infinitely big set. why is this the principle of unrestricted comprehension?
i see the paradox though, that is fine
 
@beginner the principle of unrestricted comprehension says that that set exists. I was just remarking that that set actually exists in ZFC too.
 
6:15 AM
i just don't get the part before the paradox
 
@DavidZ I'm a bit wary of any calculus question whose correct answer involves the delta function.
 
so if it exists than the principle of unrestricted comprehension holds?
is that 'the principle of unrestricted comprehension holds' if and only if 'the set exists'?
or the set existing isn't sufficient or reverse?
 
No... UC says that $\{x : \phi(x)\}$ exists for every $\phi$. This is just a particular one.
 
Anyone who can tell me what's wrong (if something is) with what I wrote some minutes ago?
 
okay i might have to come back to this in a while, i am not totally sure i get it, thank you very much mike
 
6:19 AM
@MikeMiller fair enough, though it is a legitimate distribution
 
@DavidZ No question there, but I don't think the OP was thinking about distributions.
That's why I had the adjective 'calculus' :)
@DavidZ It also just doesn't look like a generally good question... shouldn't migrations be for questions that would be well-received on the target network?
 
Yeah, that's more what I had in mind. I'm wondering whether it would be well-received here.
 
what is a good textbook for me to learn math in?
apparently real math for students is only in analysis books?
thats what my friends dad said, and he is an engineer
 
@DavidZ I'm fairly downvote-happy, but I would probably downvote that question if it were here.
 
@MikeMiller reasonable. It's probably not worth migrating then.
 
6:25 AM
I try to encourage good questions with upvotes instead of downvotes personally. I almost always upvote questions with a reasonable amount exposition or apparent effort on behalf of the OP.
 
I do too. I just downvote the bad ones.
If they get improved (and I see it), they get upvotes. Hooray!
 
0
Q: Somewhere to write and check my work?

beginnerIs this somewhere I can work on my problems and get answer feedback? Is there somewhere I can type up work as I go, like a journal, and other people will give me feedback, and I can give feedback on their journals? Thank you very much. Could I write up my work for a set of exercises and have i...

 
I usually just ignore them, although it sounds tempting to start downvoting given recent times.
 
what was the first textbook you did kaj hansen?
 
For whatever reason, I've noticed a huge influx of questions that not only demonstrate no effort on behalf of the OP, but are also so full of grammar and formatting related errors that I cannot even parse them.
 
6:28 AM
Can you parse my sentences, or should I attempt to write them slowly with full grammar like this?
 
@DavidZ It would be a duplicate anyway. Maybe even asked by the same person, who knows.
 
No, no. I wasn't referring to you @beginner
 
yours isn't the kind of thing he's complaining about
 
Just talking to Mike.
 
ok
 
6:29 AM
@beginner, the one that sticks in my mind the most is Thomas' 3rd edition of Calculus & Analytic Geometry.
 
was it fun?
 
@Rafflesiaarnoldii Have you noticed the user "Godparticle"? Do you think his questions are being asked in good faith?
 
Not very theory oriented, but I taught myself most of the integration techniques that I know from that book. I'd say it's good enough to teach yourself calculus out of assuming you have a good grasp of trig and algebra.
 
I guess I was too rude lol
 
@MikeMiller Two most recent ones are weird. Downvoted. Other than that, I don't see a cause for concern. Physics enthusiasts can be like that, no offense to David Z here.
 
6:33 AM
I haven't looked at others than the most recent. I guess getting concerned by two questions is a bit silly.
Thanks for looking.
 
BTW Sow added three new clones this week.
 
Who is this guy?
 
A few downvotes on this would be nice.
 
@Mike Are my questions here too specific to interest anyone, like with Pedro?
 
6:37 AM
it is 1564 pages @kaj that is a heap. did the @ tag work?
 
I think your questions are probably not well-received in this chat, @Vincenzo, yes.
 
haha, yeah it did. @beginner. That sounds a bit long though.
There are LOTS of crappy remakes of the book @beginner. The later editions with extra authors are a lot worse than the 3rd edition.
I'd actually be surprised if you can find a copy. It's been out of print for decades :/
 
thank you @Kaj i will go and read some of it now. i downloaded the 11th edition
i will see how it does
 
Holy hell, I actually found it. You can get yourself a physical copy for under 10 dollars if you're interested @beginner
 
oh really
oh wow
 
6:42 AM
Just remember that you aren't going to get all the theory that you should be exposed to, so you'll want to go back and supplement it with other books later on.
 
@Mike Uhm, I see.
 
thanks kaj, i'll see what my parents say
 
You'll want to master your trig and algebra first though :)

Know your rules for exponentiation, logarithms, trig functions, etc.
 
If anyone wants to help out a sister site under daily spam attack, flag this Drupal post as spam.
 
yeah that is a good point, i will try to get all the main stuff down so i don't get demotivated on the big textbooks
 
6:47 AM
The most important part to succeeding in calculus is being comfortable with its pre-requisites.
Most people who struggle with calculus are actually struggling with one of those more basic topics.
3
 
Very true, as I can attest after grading midterms.
 
haha, and as I can attest after a few years of tutoring :P
 
are people here normally this helpful? or should i only come here at this time?
my first question got closed, should i delete it??
 
So long as you're asking good questions with a good amount of context and detail, there is no shortage of people willing to help.
The chatroom is usually full of people mid-day. It's just that it's in the middle of the night for the US, so there aren't many people on right now.
 
@Mike is A|B = {x element of M | x element of A and x not element of B}

in ZF since it comes from the set M rather than the universal set?
oh okay kaj, are you in the US?
 
6:55 AM
Yeah, but I stay up super late, lol
 
oh okay haha
 
rawr
 
hello usuki
 
Hey there @usukidoll
 
hiii
 

« first day (1572 days earlier)      last day (3456 days later) »