Skip to main content
codeing_monkey's user avatar
codeing_monkey's user avatar
codeing_monkey's user avatar
codeing_monkey
  • Member for 2 years, 2 months
  • Last seen this week
  • College Station, TX
3 votes
0 answers
90 views

Given a homomorphism $\phi$, way to prove that $H \trianglelefteq G$ when $H \supset Ker\phi$

3 votes
1 answer
385 views

Help understanding steps to prove Dirichlet's approximation theorem

2 votes
1 answer
102 views

Proving that for all $1 \leq k \leq p - 1$, $p$ prime, $\binom{p}{k} \equiv 0 \bmod p$

2 votes
3 answers
107 views

Showing that $S^1 \not\cong (0, 1)$ and $\not\cong [0, 1]$ [duplicate]

2 votes
1 answer
67 views

Proof that monic polynomials $\{p_i(x)\}_{i = 0}^\infty$ each have $i$ distinct real roots in $[a, b]$

1 vote
2 answers
75 views

Showing that the set of open sets of the finite-closed topology on $\mathbb{Z}$ is countably infinite

1 vote
2 answers
80 views

Simplification of $(X_1 \times X_2) \setminus ((X_1 \setminus U) \times (X_2 \setminus V))$, $X_1, X_2$ infinite and $U \subset X_1, V \subset X_2$

1 vote
0 answers
59 views

Help understanding proof of error bound on Simpson's quadrature rule

1 vote
1 answer
496 views

Conversion from FOL to CNF

1 vote
1 answer
114 views

Question about the CLT as it applies to the exponential distribution

1 vote
1 answer
112 views

Showing that $\frac{1}{n}\sum\limits_{j = 1}^{n} \left\lfloor \frac{n}{j} \right\rfloor \approx \log(n)$ (with error bounded by 1) using Riemann Sum

0 votes
2 answers
308 views

Proving that an integer $n = 2^{e_2} \cdot 3^{e_3} \cdots$ can be expressed as the sum of two squares iff $e_p$ is even whenever $p \equiv 3 \pmod 4$

0 votes
1 answer
59 views

Demonstrating that $A(N)$, the average number of positive divisors of numbers up to $N$, is approximately $\log(N)$ with error bounded by 1

0 votes
1 answer
184 views

CDF of continuous random variable $Y=X^2$ [closed]

0 votes
1 answer
97 views

Expectation of an exponentially distributed random variable

0 votes
0 answers
65 views

CFG for $L = \{w_1w_2 \cdots w_{2n} \mid n > 0, w_i \in \{a, b\}, 1 \leq i \leq 2n, w_j = b, w_{n + j} = a \ \exists j, 1 \leq j \leq n\}$

0 votes
0 answers
53 views

Showing that the language of this constrained form of the PCP is decidable

0 votes
1 answer
187 views

Help understanding the proof that $L = \{ \langle M \rangle \mid M \text{ is a TM that accepts the input string } 101\}$ is undecidable

0 votes
0 answers
35 views

Annihilate duplicate rows in a $n \times n$ matrix

0 votes
1 answer
82 views

The set of all finite sequences in $\mathbb{Z}$ is countably infinite