let F= { 0=a1, a2,a3,a4.....an} be a finite field. show that(adsbygoogle = window.adsbygoogle || []).push({});

(1+a2)(1+a3).........(1+an) = 0.

when n is odd, it's simple since 1 belongs to F. then odd number of elements are left( they're distinct from 0 and 1). at least one of them, say x,must have itself as its inverse. x^2 = 1 implies x=-1 ( since x != 1)...so the result is true.

for n even and the case where none of them are inverses of themselves, can somebody suggest a solution???

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Finite fields

Loading...

Similar Threads for Finite fields | Date |
---|---|

I Existence and Uniqeness of Finite Fields ... | Jun 5, 2017 |

Finite field structure | Sep 5, 2015 |

Finite field with hard discrete log for both groups | Sep 1, 2015 |

When is an element of a finitely generated field extension algebraic? | Jan 28, 2012 |

Irreducible Polynomials over Finite Fields | Jun 15, 2011 |

**Physics Forums - The Fusion of Science and Community**