学习添括号法则后,小明所在的学习小组为了加强对法则的理解,编了一个小游戏,游戏规则如下:把多项式
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmi%3Ea%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmi%3Eb%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Em%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3En%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ee%3C%2Fmi%3E%3C%2Fmath%3E)
看做
a ,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmi%3Eb%3C%2Fmi%3E%3C%2Fmath%3E)
,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Em%3C%2Fmi%3E%3C%2Fmath%3E)
,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3En%3C%2Fmi%3E%3C%2Fmath%3E)
,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ee%3C%2Fmi%3E%3C%2Fmath%3E)
五项的和,这五项可以依序循环站位,例如:当
a站在第2位时,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ee%3C%2Fmi%3E%3C%2Fmath%3E)
站在第一位,变为多项式
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ee%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmi%3Ea%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmi%3Eb%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Em%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3En%3C%2Fmi%3E%3C%2Fmath%3E)
. 在任意相邻两个或三个字母左右添括号,再在符号不变的情况下,交换括号前后两字母的位置,则称此操作为“交换操作”,例如:在
b ,
m两相邻字母之间先添括号得到
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmi%3Ea%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmrow%3E%3Cmo%3E%28%3C%2Fmo%3E%3Cmrow%3E%3Cmi%3Eb%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Em%3C%2Fmi%3E%3C%2Fmrow%3E%3Cmo%3E%29%3C%2Fmo%3E%3C%2Fmrow%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3En%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ee%3C%2Fmi%3E%3C%2Fmath%3E)
, 再交换
a ,
n的位置得到
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmi%3En%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmrow%3E%3Cmo%3E%28%3C%2Fmo%3E%3Cmrow%3E%3Cmi%3Eb%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Em%3C%2Fmi%3E%3C%2Fmrow%3E%3Cmo%3E%29%3C%2Fmo%3E%3C%2Fmrow%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ea%3C%2Fmi%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ee%3C%2Fmi%3E%3C%2Fmath%3E)
, 下列说法:
①存在一种“交换操作”后的式子与原多项式一样;
②若每次操作只在相邻两个字母变换,则这样的变换共有5种不同的结果;
③存在两个变换后多项式的差只含两个字母。
其中正确的个数是( )
- A、0
- B、1
- C、2
- D、3