Is there a solution to x=x+1 (x is not a complex) maybe x is an infinite sum of 1 ? Why not ? Can you prove it ?

mod 1 implies at least 2 elements
You want mod 0

I challenge you to define mod in such a way that n mod 0 = 0.

subtract x from both sides
0 = 1
nobel prize when

obviously for [math]\mathbb{Z}_1[/math] as said its sole element is a solution.

You also get 2 solutions with the extended reals and infinitely many with ordinal numbers

already did
The only thing I'd change is that where he uses the symbol '1', I'd use the symbol '0' instead.

Here are a few tricks you can use that I've learned from this thread:

>Define 1 as 0
>Define x as your mom
>Define = as my dick

and there you go

How are odd numbers congruent to 1 mod 1?

In the most basic sense where we define the congruence relation by remainder after division, we have that any integer mod 1 is 0 since 1 always divides into that number.

Mod 2 is the one that associates to odds 1 and to evens 0.

x, where x is defined as the answer to the question.

Another cheap solution is with boolean algebra

x=0
now where's my nobel?