21,484 reputation
22679
bio website
location
age
visits member for 2 years, 7 months
seen 2 hours ago

6h
comment What is the smallest positive integer that has never been mentioned?
Well yeah, we can't answer the real question. But that number still does not appear in the wikipedia list of numbers.
6h
answered What is the smallest positive integer that has never been mentioned?
6h
revised The drawer has M different colored socks. What is the least amount of socks I that I need to draw to guarntee N pairs
added 41 characters in body; edited body
14h
answered Let $f: G \to H $ be a group isomorphism. Show that for every $a \in G$, one has $o(f(a)) = o(a)$
16h
comment Proof of a Combinatorial Summation
this question has been asked a ton of times before.
17h
comment Product of Divisors of some $n$ proof
you have to take the square root on both sides and use laws of exponents. But if you don't see that you might want to review some stuff.
17h
comment Example of graph pebbling number and significance
@dunka how do you propose we do that?
17h
comment Example of graph pebbling number and significance
What have you tried. Sometimes making sure you understand the question is an important step.
17h
comment Need Verification on a Modulus Proof
Oh yeah, my bad. Thank you
17h
revised Need Verification on a Modulus Proof
deleted 2 characters in body
17h
answered Need Verification on a Modulus Proof
17h
answered Primitive Roots Modulo $2^n$ for $n\geq3$
17h
comment GCD of 1: Prove set is Complete Residue System Proof
Yeah, I know, It is a good comment.
17h
comment GCD of 1: Prove set is Complete Residue System Proof
Well, what Bill Dubuque means is that if $jn\equiv kn \bmod m$ then $j\equiv k$. You can prove this using what I said, or you can use that since $m$ and $n$ are relatively prime $n$ has a multiplicative inverse $n'$. So $jn\equiv kn \implies jnn'\equiv knn'\implies j\equiv k \bmod m$
18h
comment GCD of 1: Prove set is Complete Residue System Proof
Well , then I guess that's that, if you have any questions about the working of the proof I'd be happy to answer.
18h
comment GCD of 1: Prove set is Complete Residue System Proof
Well, I assume the point of proving this is that you understand it, do you think it is a proof? What could be a hole in the argument?
18h
answered GCD of 1: Prove set is Complete Residue System Proof
18h
comment A starting lineup consists of 2 forwards, 2 guards and 1 center. How many different starting lineups..
Yes. It is correct.
19h
answered A starting lineup consists of 2 forwards, 2 guards and 1 center. How many different starting lineups..
19h
comment fourth grade math
Yeah, that's correct. Thank you.