4,222 reputation
41339
bio website
location
age
visits member for 3 years, 6 months
seen Jan 3 at 16:19

Mar
16
revised Is there any advantage to the $a \equiv b\;\;(\mathrm{mod}\;c)$ notation?
added 40 characters in body; edited title
Mar
16
asked Is there any advantage to the $a \equiv b\;\;(\mathrm{mod}\;c)$ notation?
Mar
16
comment On last digit of 4 consecutive primes less than 10 apart
If I understand it correctly, your argument looks incomplete to me, because, as far as I can tell, it covers only the case where $x$ is congruent to $0$ modulo $3$, whereas $x$ could also be congruent to $1$ (e.g. $x=10$) or to $2$ (e.g. $x = 20$) modulo $3$.
Mar
16
revised On last digit of 4 consecutive primes less than 10 apart
deleted 1 characters in body
Mar
16
asked On last digit of 4 consecutive primes less than 10 apart
Mar
16
revised On proving $n = \sum_{d\mid n}\varphi(d)$
deleted 2 characters in body
Mar
16
comment On proving $n = \sum_{d\mid n}\varphi(d)$
@GregMartin: I suppose that the proof I wrote above closely parallels the one you mention, but somehow I find it more natural and useful to partition the set of integers $\{1,\dots,n\}$ than to partition the set of fractions $\{\frac{1}{n},\dots,\frac{n}{n}\}$, even though both procedures are basically equivalent.
Mar
16
revised On proving $n = \sum_{d\mid n}\varphi(d)$
added 29 characters in body
Mar
16
revised On proving $n = \sum_{d\mid n}\varphi(d)$
added 29 characters in body
Mar
16
revised On proving $n = \sum_{d\mid n}\varphi(d)$
added 7 characters in body
Mar
16
revised On proving $n = \sum_{d\mid n}\varphi(d)$
added 493 characters in body
Mar
16
revised On proving $n = \sum_{d\mid n}\varphi(d)$
added 493 characters in body
Mar
16
revised On proving $n = \sum_{d\mid n}\varphi(d)$
deleted 29 characters in body
Mar
16
asked On proving $n = \sum_{d\mid n}\varphi(d)$
Mar
14
revised Expectation expression
added 51 characters in body
Mar
14
revised Expectation expression
deleted 10 characters in body
Mar
14
answered Expectation expression
Mar
14
revised How to convert the ln part of this equation to log10?
added 27 characters in body
Mar
14
revised How to convert the ln part of this equation to log10?
added 27 characters in body
Mar
14
revised Why is $H_1 \le G \land H_2 \le G$ necessary in $a(H_1 \cap H_2) = aH_1 \cap aH_2$?
added 97 characters in body