1

Can anyone help me explain why if $x$ is an integer, then $(x^3+1)\bmod 3 = (x+1)^3 \bmod 3$? I know there are 3 cases. $x=0\bmod3,\ x=1\bmod3,$ and $x=2\bmod3$ totally new to this form of mathematics, could anyone help me setup the proof?

Bill Dubuque
  • 272,048
tonix
  • 79
  • 2
    Consider expanding $(x+1)^3$. – Andrew T. Mar 02 '15 at 06:31
  • 2
    You could use the cases approach mentioned in the post. Or else you could note that $(x+1)^3=x^3+3x^2+3x+1$, so $(x+1)^3$ has the same remainder on division by $3$ as $x^3+1$. – André Nicolas Mar 02 '15 at 06:33
  • @BRIC-Fan: I don't quite get your edit. Are you seeing the equations as congruences or binary mods (=remainder operations)? Right now it is a mixture. For example you use equality signs even though your TeX (using pmod) suggests that a congruence was intended. At least in the first equation where binary mod (\bmod) should be used. I do speak (loudly) against ever using binary mod myself, so this is kinda kettle calling pot, but..? Ok, the original post wasn't entirely clear either :-) – Jyrki Lahtonen Mar 02 '15 at 07:14
  • @JyrkiLahtonen: I see it as a congruence or mod and not really an equation. But it can be viewed as both. Please correct if I am wrong as I am quite a new-b with mathjax. – DeepSea Mar 02 '15 at 07:17
  • aeon1: Judging from the title of your question you may be using mod as a remainder operation. However, your syntax is not consistent thoughout the post, and at some points it looks like you might intend a congruence instead. Please study this Wikipedia page that explains the differences, and explain in your own words how you see it. The reason I'm asking is that your interpretation has an impact on how to the equations/congruences should best be typeset. It is also IMO beneficial to you to be aware of the differences! – Jyrki Lahtonen Mar 02 '15 at 08:15
  • (cont'd) The two ways of using mod are closely related, but the syntax is quite different. As is the semantics: binary mod is an arithmetic operation on two numbers that gives a third number as an output. a congruence could be viewed as having three arguments (the last one usually fixed throughout the question) and outputs a boolean value (true/false) in a sense. – Jyrki Lahtonen Mar 02 '15 at 08:18
  • @tonix I highly recommend that you learn the difference between mod as a binary operator vs. ternary congruence, e.g. see here and here. – Bill Dubuque Mar 02 '15 at 16:32

3 Answers3

1

If you're allowed to use it, by Fermat's Little Theorem $n^3\equiv n\pmod3$. Using this gives

$$x^3+1\equiv(x+1)^3\equiv x+1\pmod 3$$

Mike
  • 13,318
0

hint: $3x^2 = 0\pmod 3, 3x = 0 \pmod 3$

DeepSea
  • 77,651
0

$(x+1)^3 -(x^3+1) = 3(x+x^2)$.

copper.hat
  • 172,524