#can someone explain this to me algebraically???
21 messages · Page 1 of 1 (latest)
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules. If there is a conflict amongst multiple helpers feel free to ping “Helper Mod”
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
I get that they plugged in the numbers. But I dont understand the results.
they evaluated the function and checked when they got 0
and obviously reduced mod 6 since we're in Z/6Z
$1^2+2(1)+4=7\equiv 1\mod 6$
Omegabet_
So for 2 its 12 mod 6? And theres no remainder thats why its 0?
yes, 6|12
you just do the computation in Z, then project back down to Z/6Z
since that's how the operations are defined
$[a]+[b]:=[a+b]$ for any equivalence classes of mod 6 (likewise for the product)
Omegabet_
Thank you so much!
@wet canyon has given 1 rep to @dire vessel
for modular arithmetic, a circle might be more suitable than a number line
I don't really agree. For these problems, it's much easier to visualize the polynomial over Z/6Z by considering its image over Z and marking every point in 6Z with a dot or something
But this isn't really important.
Sorta like this
+close