Timeline for Show that sets are equal
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 24, 2018 at 8:20 | history | edited | zibadawa timmy | CC BY-SA 3.0 |
added 109 characters in body
|
| Mar 24, 2018 at 8:17 | comment | added | zibadawa timmy | Let us continue this discussion in chat. | |
| Mar 24, 2018 at 8:14 | comment | added | DavitS | @zibadawatimmy For $n=0\ mod\ p$ in $F_9$ there are no such sets, I checked with computer. | |
| Mar 24, 2018 at 8:08 | comment | added | zibadawa timmy | @RandomUser Still false. Now you don't disallow $n\equiv 0\bmod p$, and then I can just use 3-element sets. | |
| Mar 24, 2018 at 8:05 | comment | added | DavitS | @zeb this should be true if $n\neq 2^k\ mod\ p$. I forgot to mention that in my initial question. my bad ( | |
| Mar 24, 2018 at 8:03 | comment | added | zibadawa timmy | @zeb No, that's also false in general. You can find disjoint $S,T$ for $n=4$ in $\mathbb{F}_{27}$ (though you can't in the field of 9 elements, so maybe as long as $n$ is not too small this is true). | |
| Mar 24, 2018 at 8:03 | comment | added | DavitS | @zibadawatimmy sorry, this is kind of funny, there was a typo. | |
| Mar 24, 2018 at 7:59 | comment | added | zibadawa timmy | @RandomUser You have an alarming inability to compute congruences. This uses the field of 9 elements. Which has characteristic 3. What is $4\mod 3$? | |
| Mar 24, 2018 at 7:57 | comment | added | zeb | In your counterexample, your sets share an element. It's almost plausible it's true for disjoint sets $X$ and $Y$? | |
| Mar 24, 2018 at 7:55 | comment | added | zibadawa timmy | @RandomUser That doesn't affect my counterexample in the slightest. Characteristic here is 3, $n$ is 4. | |
| Mar 24, 2018 at 7:50 | comment | added | DavitS | sorry, I forgot to mention in the question, $n\neq 0\ mod\ char(F)$. Will edit$ | |
| Mar 24, 2018 at 7:42 | history | answered | zibadawa timmy | CC BY-SA 3.0 |