Reputation
31,869
Next tag badge:
92/100 score
39/20 answers
Badges
3 42 93
Newest
 Necromancer
Impact
~321k people reached

Jul
24
comment Is 1 always an element in multiplicative group?
@lulu I think $\mathbb G_T$ is the multiplicative group taken out of another structure, sort of like how you can take the multiplicative group of a ring, by taking all the elements with inverses and leaving the product operation.
Jul
24
comment Is 1 always an element in multiplicative group?
What is $T$? A ring?
Jul
24
comment Is 1 always an element in multiplicative group?
what is $\mathbb G_T$?
Jul
23
comment An extremal coloring problem
what is a simple cycle?
Jul
23
comment Negate the following logic statements
There exists a rose that has odor and no spikes.
Jul
23
comment Prove that $a_j=b_j$ for the $2$ sequences $a$ and $b$
I think $(n,6)=1$ is just so that $n$ is not $2,3$ or $4$.
Jul
23
revised Olympiad inequality
added 8 characters in body
Jul
22
comment Simple string permutations question
Looks good to me .
Jul
22
comment Size of a maximum matching of a complete multipartite graph?
Yeah, probably. I just wasn't able to prove it really short. So I had to use this ugly induction.
Jul
22
revised Frog jumping on leaves
added 5 characters in body
Jul
22
revised Frog jumping on leaves
added 746 characters in body
Jul
22
answered Frog jumping on leaves
Jul
22
comment Size of a maximum matching of a complete multipartite graph?
Did you read what I wrote?
Jul
22
revised Size of a maximum matching of a complete multipartite graph?
added 422 characters in body
Jul
22
answered Size of a maximum matching of a complete multipartite graph?
Jul
22
comment Size of a maximum matching of a complete multipartite graph?
Hakimi-Havel is used for something different but I am almost 100% sure you can extrapolate the idea mutatis-mutandis. You also have t be carefull because in Hakimi-havel you can only substract from the same two piles once.
Jul
22
comment Size of a maximum matching of a complete multipartite graph?
I think you can reach the optimal solution by using an argument similar to that used for the hakimi-havel algorithm. In other words at each step you have to remove a coin from the two largest piles.
Jul
22
comment Size of a maximum matching of a complete multipartite graph?
Your problem is not really about graph theory, it is equivalent to having $r$ piles of coins with $n_1,n_2\dots n_r$ piles each and at each step selecting two non-empty piles and removing one coin from each. What you want to know is what is the maximum number of coins you can remove.
Jul
22
comment If I buy 2 lottery tickets do I double my chance of winning?
The reason why lotteries are successful is a lot simpler, the prize is less than the cost of tickets they sell. A simple corollary of this is that the expected value of a ticket is less than its price.
Jul
22
comment If I buy 2 lottery tickets do I double my chance of winning?
Where is the internet divided?