Suppose $R$ is a finite ring (commutative ring with $1$) of characteristic $3$ and suppose that for every unit $u \in R\:,\ 1+u\ $ is also a unit or $0$. We need to show that $R$ is a field. Is this true if ${\rm char}(R) > 3$?
Here is what I attempted to do. $\:$ First of all, $\:$ I noticed that the statement is not true if $\ R\ $ is infinite ($ \mathbb F_3[x]$ is an example of an infinite ring which is not a field but it satisfies all the required properties). Now, in a finite ring, a non-zero element is either a unit or a $\:0\:$ divisor, so I tried to show that $R$ has no $\:0\:$ divisors. Clearly, $R$ has no nonzero nilpotent elements (if $x$ is nilpotent, then $1+x$ is a unit, but then $1+(1+x)$ and $1+(2+x)$ is either a unit or $\:0\:.\:$ Hence $x$ is either a unit or $\:0\:,\:$ and since $x$ is nilpotent, it can't be a unit, so we must have $x = 0$). But this does not solve the problem, since $R$ could have elements that are $\:0\:$ divisors but not nilpotent (for example, $\ (1,0)\ $ is a $\:0\:$ divisor in $\ \mathbb Z/3\:\mathbb Z \times \mathbb Z/3\:\mathbb Z\ $ but it is not nilpotent).
Another observation I made is that the set of units, together with $\:0\:$ forms a group under addition, so that $J = R^{*}$, together with $\:0\:$ is a subring of $R$. hence we may view $R$ as a $J$-module (and since $J$ is clearly a field, $R$ is a $J$-vector space).
Another thing I tried is to show that $R$ has no proper nontrivial ideals. Viewing $R$ and $J$ as abelian groups, I noticed that a non-trivial ideal of $R$ can contain at most one element from each coset of $J$ in $R$, because if an ideal contains two distinct elements from the same coset of $J$ in $R$, this ideal would have to contain their difference, hence it'd have to contain a unit, hence it would not be a proper ideal. But again, I don't see how this observation leads to a solution.
As for the last part, I suspect that this statement will remain true if ${\rm char}(R) > 3$. Since $1$ is a unit, it follows that $1,2,3,\ldots$ are all either units or $0$, which can only happen if ${\rm char}(R) = p$, a prime number (and then I suspect that $R$ will have to be a finite field), but again I do not see how to prove (or disprove) this.
By the way, this is not a homework problem. I am studying algebra on my own, and after thinking about it for a few days and making the observations I listed above, I still don't see how to finish the proof. I would appreciate your suggestions. Thank you in advance.
The map $f: x\rightarrow {x^3}$ is a homomorphism from $R$ to $R$. The kernel of $f$ is $\{0\}$ because $x^3=0$ implies $(x-1)^3=-1$, which means that $x-1$ is a unit, hence $x$ is a unit or zero, hence that $x=0$. So $f$ is 1-1, and, since $R$ is finite, it is thus an automorphism of $R$.
Then there must be an $n>0$ such that $f^n$ is the identity, that is: $x^{3^n}=x$ for all $x\in{R}$
Assume $r$ is not a unit, and let $s=r^{3^n-1}+1$. A quick computation shows that $s^2=1$, so $s$ must be a unit. But that means that $s+2$ must be a unit or zero, and $s+2$ is a power of $r$, a non-unit, so $r^{3^n-1}=0$ and $r=r^{3^n} = 0$.
The same argument works for arbitrary prime $p$. First you prove that $x \rightarrow x^p$ is an ring automorphism, find n such that $r^{p^n}=r$, and then using $s=r^{p^n-1} +1$, prove that $s^{p-1}=1$. A little harder to prove, requiring to know that
$${{p-1}\choose{i}} \equiv (-1)^i \pmod{p}$$
[That doesn't work when $p=2$, of course, and the theorem is not true for p=2. In that case, you can take the ring $\{0,1,x,x+1\}$ with the rule $x^2=x$.]