Clanlu Clanlu
  • 请到 [后台->外观->菜单] 中设置菜单
  • 登录
现在登录。
  • 请到 [后台->外观->菜单] 中设置菜单

Use the Binomial Theorem to compute the order of an element in the integers mod a prime power

Math 2年 前

Solution to Abstract Algebra by Dummit & Foote 3rd edition Chapter 2.3 Exercise 2.3.21
Let $p$ be an odd prime and $n$ a positive integer. Use the Binomial Theorem to show that $(1+p)^{p^{n-1}} = 1\ \mathsf{mod}\ p^n$ but that $(1+p)^{p^{n-2}} \neq 1\ \mathsf{mod}\ p^n$. Deduce that $1+p$ is an element of order $p^{n-1}$ in $(\mathbb{Z}/(p^n))^\times$.


Solution: TBA.

#Binomial Theorem#Order#Prime Power#Residue Group
0
Math
O(∩_∩)O哈哈~
猜你喜欢
  • Use induction to show binomial theorem
  • The set of prime ideals of a commutative ring contains inclusion-minimal elements
  • Use Zorn’s Lemma to construct an ideal which maximally does not contain a given finitely generated ideal
  • Not every ideal is prime
  • Characterization of maximal ideals in the ring of all continuous real-valued functions
07 9月, 2020
Examine a given action of the additive real numbers on the Cartesian plane
精选标签
  • Subgroup 40
  • Order 37
  • Counterexample 36
Copyright © 2022 Clanlu. Designed by nicetheme.