Reputation
33,243
Next tag badge:
95/100 score
43/20 answers
Badges
3 42 97
Impact
~335k people reached

Aug
20
accepted Tzaloa 2015 game problem (piles with $1,2,4 \dots 2^{19}$ coins each)
Aug
20
revised Tzaloa 2015 game problem (piles with $1,2,4 \dots 2^{19}$ coins each)
added 8 characters in body
Aug
20
comment Tzaloa 2015 game problem (piles with $1,2,4 \dots 2^{19}$ coins each)
Yes, it would take a while.
Aug
20
revised Tzaloa 2015 game problem (piles with $1,2,4 \dots 2^{19}$ coins each)
edited body
Aug
20
answered If $f:X \to Y $ is continuous then $f^{-1}(\emptyset)= \emptyset?$
Aug
20
asked Tzaloa 2015 game problem (piles with $1,2,4 \dots 2^{19}$ coins each)
Aug
20
comment Prove that it is NOT true that for every integer $n$, 60 divides $n$ if and only if 6 divides $n$ and 10 divides $n$.
Thanks for accepting, I added the thing about relatively prime.
Aug
20
revised Prove that it is NOT true that for every integer $n$, 60 divides $n$ if and only if 6 divides $n$ and 10 divides $n$.
added 447 characters in body
Aug
20
comment Prove that it is NOT true that for every integer $n$, 60 divides $n$ if and only if 6 divides $n$ and 10 divides $n$.
The result is only true if the two numbers are relatively prime, $3$ and $5$ are relatively prime, while $6$ and $10$ are not.
Aug
20
comment Prove that it is NOT true that for every integer $n$, 60 divides $n$ if and only if 6 divides $n$ and 10 divides $n$.
Writing up a solution to that question is harder since the statement turns out to be true.
Aug
20
comment Prove that it is NOT true that for every integer $n$, 60 divides $n$ if and only if 6 divides $n$ and 10 divides $n$.
"The statement is false since $30$ is a counterexample" This is a well written proof.
Aug
20
answered Prove that it is NOT true that for every integer $n$, 60 divides $n$ if and only if 6 divides $n$ and 10 divides $n$.
Aug
19
comment Omission in Jacobson's BAI regarding extension of isometries.
What is BAI? ${}{}{}{}{}$
Aug
19
comment Slick proof that if an open set contains $\mathbb Q$ it has all irrational numbers, except a countable amount.
No worries. I managed to find a proof I am comfortable with using the first suggestion @columbus8myhw gave
Aug
19
comment Slick proof that if an open set contains $\mathbb Q$ it has all irrational numbers, except a countable amount.
Thanks, the first argument worked.
Aug
19
accepted Slick proof that if an open set contains $\mathbb Q$ it has all irrational numbers, except a countable amount.
Aug
19
comment Slick proof that if an open set contains $\mathbb Q$ it has all irrational numbers, except a countable amount.
How would one prove that set is closed?
Aug
19
comment Slick proof that if an open set contains $\mathbb Q$ it has all irrational numbers, except a countable amount.
$(1,2)$ does not contain $\mathbb Q$
Aug
19
comment Slick proof that if an open set contains $\mathbb Q$ it has all irrational numbers, except a countable amount.
@RudytheReindeer that would give you a set that is missing a countable number of irrational numbers.
Aug
19
comment Slick proof that if an open set contains $\mathbb Q$ it has all irrational numbers, except a countable amount.
I need a set that is missing a number of irrational numbers that is not countable.