A modulus rule that I found out, can anyone help me prove or disprove this?

For any number xx where x>=2x>=2 and any number yy which yy mod x0 x \ne 0

(x+y)2 (x+y)^2 mod xx is equal to 1

I'm not quite sure how this can be useful, or if people have discovered it, but who knows. Please tell me if people have, and I'm coding a program that'll test it up to about a 100 in x and 1000 in y. I'll be back with the results and the github link to the program.

#Remainder #Math #Modulus #Theorems #Whoknowswhatelse

Note by Zaid Baig
6 years, 10 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

The statement is false... let me disprove it...

Assume the statement is true, that is for any number x2x\geqslant 2 and for any number yy and xyx\nmid y which is y≢0(modx)y\not\equiv 0 \pmod{x}. (x+y)2=x2+2xy+y2y21(modx)\begin{aligned} \\ (x+y)^2&=x^2+2xy+y^2 \\&\equiv y^2 \\&\equiv 1 \pmod{x} \\ \end{aligned} Hence y21y^2-1 must be divisable by xx, now we can conclude for any number yy and xyx\nmid y, xy21x\mid y^2-1.

However, since y21=(y+1)(y1)y^2-1=(y+1)(y-1), by Euclid's lemma, we get either xy+1x\mid y+1 is true or xy1x\mid y-1 is true, so the equivalence (x+y)21(modx)(x+y)^2 \equiv 1\pmod{x} cannot hold if xy+1x\mid y+1 and xy1x\mid y-1 are both false.

For example, assume x=5x=5 and y=7y=7, we have satisfied the conditions y≢0(modx)y\not \equiv 0 \pmod{x} and x2x\geqslant2, here, xy+1x\mid y+1 and xy1x\mid y-1 are both false. (x+y)2=(5+7)2=122=1444≢1(mod5)\begin{aligned} \\ (x+y)^2&=(5+7)^2 \\&=12^2 \\&=144 \\&\equiv 4 \\&\not \equiv 1\pmod{5} \\ \end{aligned}

Other pairs of counterexamples {x,y}\{x,y\} are {10,8}\{10,8\}, {6,13}\{6,13\}, {25,9}\{25,9\}... (there are infinity of them!) This statement can be made true if you add one more condition: one of the numbers y+1y+1 or y1y-1 must be divisable by xx.

Therefore, the corrected statement are as follows:

For any number x2x\geqslant2, yy, xyx\nmid y, if either xy+1x\mid y+1 or xy1x\mid y-1 is true, then (x+y)21(modx)(x+y)^2\equiv 1 \pmod{x}

For example, assume x=6x=6, y=5y=5, we have satisfied x2x\geqslant2, xyx\nmid y, xy+1x\mid y+1 (x+y)2=(6+5)2=112=1211(mod6)\begin{aligned} (x+y)^2&=(6+5)^2 \\&=11^2 \\&=121 \\&\equiv 1 \pmod{6} \end{aligned}

Kenneth Tan - 6 years, 10 months ago

Log in to reply

Thanks, I came up with it in the car, so who knows. And I coded it, most of them didn't work. It's basically y if (y+1) or (y-1) mod x equals 1? Thanks

Zaid Baig - 6 years, 10 months ago
×

Problem Loading...

Note Loading...

Set Loading...