Reputation
Next tag badge:
375/400 score
94/80 answers
Badges
6 84 184
Newest
 Good Answer
Impact
~829k people reached

4h
comment The sum of all numbers between 1 and 1000 INCLUSIVE that are divisible by 3 or 5 BUT NOT BOTH (exclusive or)
No, just twice. @Asydot
4h
comment The sum of all numbers between 1 and 1000 INCLUSIVE that are divisible by 3 or 5 BUT NOT BOTH (exclusive or)
Any time a person posts here asking for an explicit answer, it inspires suspicion. If you are interested in learning, a complete answer is no help. If a person is not interested in learning, they are posting here for reasons that are independent of learning. If you want an explicit answer, Google "Project Euler Problem 1"
5h
comment Number of divisors $d$ of $n^2$ so that $d\nmid n$ and $d>n$
It actually doesn't really help solve the problem to know that $d\not\mid n$ - it is both redundant and a red herring.
6h
comment 93388•9546985339
What does the title have to do with the question?
8h
comment How do you factor $3x^{3/2} -9x^{1/2}+6x^{-1/2}$?
No, that really doesn't help, @Dr.MV Something like it might help.
10h
comment How do you factor $3x^{3/2} -9x^{1/2}+6x^{-1/2}$?
Factor out $3x^{-1/2}$ first, not just $3$.
10h
comment Computing the limit of $(\lg n)^{0.5}/\lg(n^{0.5})$
Is $\frac{x^{0.5}}{x}=1^{0.5}?$ Have you tried that with $x=4$? Your use of $\cdot$ in the expression $\lg\cdot n$, which I edited out of the question, might indicate some confusion about what $\lg$ is...
10h
revised Computing the limit of $(\lg n)^{0.5}/\lg(n^{0.5})$
edited title
12h
comment Conjectured new primality test for Mersenne numbers
I didn't say it was wrong here, just that you might be more likely to get appropriate eyeballs on the question if you posted there. Note: no answers here so far. Not even an indication that anybody but me tried to read it.
13h
comment Moebius Identity
See Wikipedia for more details.
13h
comment Moebius Identity
There's a generalization of this Moebius function and Moebius inversion for any "locally finite" partially ordered set. When the partially ordered set is a finite boolean algebra, Moebius inversion is just inclusion/exclusion. Indeed, you can prove your version via inclusion/exclusion, roughly.
17h
revised zeros of p-adic power series
added 4 characters in body
18h
comment How is $\mathbb N$ actually defined?
I'm personally agnostic on the matter. I don't think there is a "better." As a pedagogical question, it depends on the student, and having multiple metaphors can be better than having one. @AsafKaragila
18h
revised How is $\mathbb N$ actually defined?
added 36 characters in body
18h
revised How is $\mathbb N$ actually defined?
added 36 characters in body
18h
comment How is $\mathbb N$ actually defined?
That works, but I think it is much more natural to compare two people in a queue than compare two queues with potentially different people. For example, a "successor queue" can certainly be defined the queue resulting from adding an element to the end, but finding of one queue's ordinal is the successor of another's is a bit obscure. It's certainly not a bad alternative, but it has trade-offs. @user87690
18h
revised How is $\mathbb N$ actually defined?
added 447 characters in body
19h
revised How is $\mathbb N$ actually defined?
added 447 characters in body
19h
answered How is $\mathbb N$ actually defined?
19h
answered Can $AB-BA=I$ hold if both $A$ and $B$ are operators on an infinitely-dimensional vector space over $\mathbb C$?