Reputation
1,838
Next privilege 2,000 Rep.
Edit questions and answers
Badges
1 2 9
Newest
 Fanatic
Impact
~6k people reached

1d
answered What is the mathematical distinction between closed and open sets?
May
21
comment $A \subset B \implies f^{-1}(A) \subset f^{-1}(B)$
This should be an answer. :)
May
21
revised Extension of fields $[L:K]=2$. Show that there is a element $\alpha\in L$ such that $L=K(\alpha)$ and $\alpha^2\in K$.
formatting and syntax
May
21
suggested approved edit on Extension of fields $[L:K]=2$. Show that there is a element $\alpha\in L$ such that $L=K(\alpha)$ and $\alpha^2\in K$.
May
21
answered Extension of fields $[L:K]=2$. Show that there is a element $\alpha\in L$ such that $L=K(\alpha)$ and $\alpha^2\in K$.
May
20
comment Is there an element in $(\mathbb{Z}/7161\mathbb{Z})^*$ that has order 30?
Yes. Because $(1,1,1,g)^n = (1,1,1,g^n)$, the smallest positive $k$ such that $(1,1,1,g)^k = (1,1,1,1)$ is also the smallest positive $k$ such that $g^k = 1$, and that is $30$.
May
20
comment Is there an element in $(\mathbb{Z}/7161\mathbb{Z})^*$ that has order 30?
Yes, $1$ is the identity element. No, $n = 30$ because $g$ is a generator and the group has order $30$. Since you are not aware of this fact, you should prove that a generator of a cyclic group of order $n$ always has order $n$ (starting with whatever definition of a generator you have).
May
20
revised Is there an element in $(\mathbb{Z}/7161\mathbb{Z})^*$ that has order 30?
added 4 characters in body
May
20
comment Is there an element in $(\mathbb{Z}/7161\mathbb{Z})^*$ that has order 30?
Well, what is the smallest positive integer $n$ such that $g^n = 1$?
May
20
comment Is there an element in $(\mathbb{Z}/7161\mathbb{Z})^*$ that has order 30?
I suppose you are aware that $(1,1,1,g)^n = (1,1,1,g^n)$?
May
20
comment Is there an element in $(\mathbb{Z}/7161\mathbb{Z})^*$ that has order 30?
Think about it for more than one minute.
May
20
answered Is there an element in $(\mathbb{Z}/7161\mathbb{Z})^*$ that has order 30?
May
18
comment Derivative of a polynomial in finite fields
It's the same thing because $2 = 1+1$.
May
18
awarded  Fanatic
Apr
20
awarded  Autobiographer
Jan
12
comment Divisibility Question.
However, your proof is sketchy. For example, you write $s/2$, but do you know that $s$ is even?
Jan
12
comment Divisibility Question.
$|t|<b$ is asserted by the Euclidean division. (If you need to prove it, just look at any proof that Euclidean division exists in $\mathbf{Z}$.)
Jan
5
comment Solve mod equation, how?
Modular inverses are usually computed using the extended Euclidean algorithm.
Jan
1
comment Potentially Flawed Probability Question
That's correct, yes. It does not fully answer the question, however (you need to prove that the winning probability of all the other sequences are less than $7/8$).
Jan
1
comment Potentially Flawed Probability Question
If Ha chooses HHH and Mo chooses THH, then Ha cannot win unless the three first tosses are HHH. Otherwise, there is a T before the three HHH, and Mo has won.