2,650 reputation
624
bio website
location
age
visits member for 3 years, 2 months
seen 2 days ago

Jul
19
accepted If $x\equiv y \pmod{\gcd(a,b)}$, show that there is a unique $z\pmod{\text{lcm}(a,b)}$ with $z\equiv x\pmod a$ and $z\equiv y\pmod b$
Jul
4
comment Notation of random variables
@Trismegistos in this context $X^-1(S)$ refers to the preimage of $X$, which always exists.
Jul
4
revised Notation of random variables
added 272 characters in body
Jul
4
answered Notation of random variables
Jul
4
accepted A die is rolled until a 6 comes up. Should the sample space of this experiment contain the set of all infinite sequences which do not contain a 6?
Jul
4
comment A die is rolled until a 6 comes up. Should the sample space of this experiment contain the set of all infinite sequences which do not contain a 6?
@AndréNicolas Not a homework problem, just self study with a textbook that doesn't have solutions. I was just curious as to whether there is a "right" way to do this. It seems like the answer is no.
Jul
4
asked A die is rolled until a 6 comes up. Should the sample space of this experiment contain the set of all infinite sequences which do not contain a 6?
Jul
4
comment The principle of duality for sets
Thank you, this is exactly what I was looking for. I've been reading up on lattices now it is very interesting. Can you recommend any resources for learning more about lattice theory?
Jul
4
accepted The principle of duality for sets
Jul
1
asked The principle of duality for sets
Jun
28
accepted Is every day tau day (or pi day) to some base?
Jun
28
comment Is every day tau day (or pi day) to some base?
@HagenvonEitzen oh. Duh.
Jun
28
asked Is every day tau day (or pi day) to some base?
Jun
20
accepted Find the Dirichlet inverse of the identity function
Jun
18
asked Find the Dirichlet inverse of the identity function
Jun
13
accepted Using Fermat's Little Theorem, find the least positive residue of $3^{999999999}\mod 7$
Jun
13
asked Using Fermat's Little Theorem, find the least positive residue of $3^{999999999}\mod 7$
May
28
revised If $x\equiv y \pmod{\gcd(a,b)}$, show that there is a unique $z\pmod{\text{lcm}(a,b)}$ with $z\equiv x\pmod a$ and $z\equiv y\pmod b$
edited title
May
28
asked If $x\equiv y \pmod{\gcd(a,b)}$, show that there is a unique $z\pmod{\text{lcm}(a,b)}$ with $z\equiv x\pmod a$ and $z\equiv y\pmod b$
May
28
asked Prove that if $p_1,\dots,p_k$ are distinct odd primes then 1 has $2^k$ square roots $\mod m$ where $m$ is the product of the primes.