1.依次排列的2个整式:
x ,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmi%3Ex%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmn%3E3%3C%2Fmn%3E%3C%2Fmath%3E)
, 对任意相邻的两个整式,都用右边的整式减去左边的整式,所得之差写在两整式之间,可以产生一个新整式串:
x , 3,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmi%3Ex%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmn%3E3%3C%2Fmn%3E%3C%2Fmath%3E)
, 这称为第一次操作:将第一次操作后的整式串按上述方式再做一次操作,可以得到第二次操作后的整式串:以此类推。通过实际操作实验,四个同学分别得出一个结论:①第二次操作后整式串为:
x ,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmn%3E3%3C%2Fmn%3E%3Cmo%3E%E2%88%92%3C%2Fmo%3E%3Cmi%3Ex%3C%2Fmi%3E%3C%2Fmath%3E)
, 3,
x ,
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmi%3Ex%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmn%3E3%3C%2Fmn%3E%3C%2Fmath%3E)
;②第二次操作后,当
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmrow%3E%3Cmo%3E%7C%3C%2Fmo%3E%3Cmrow%3E%3Cmi%3Ex%3C%2Fmi%3E%3C%2Fmrow%3E%3Cmo%3E%7C%3C%2Fmo%3E%3C%2Fmrow%3E%3Cmo%3E%26lt%3B%3C%2Fmo%3E%3Cmn%3E3%3C%2Fmn%3E%3C%2Fmath%3E)
时,所有整式的积为正数;③第四次操作后,整式串中共有17个整式;④第2022次操作后,所有的整式的和为
![](https://math.21cnjy.com/MathMLToImage?mml=%3Cmath+xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F1998%2FMath%2FMathML%22%3E%3Cmn%3E2%3C%2Fmn%3E%3Cmi%3Ex%3C%2Fmi%3E%3Cmo%3E%2B%3C%2Fmo%3E%3Cmn%3E6%3C%2Fmn%3E%3Cmn%3E0%3C%2Fmn%3E%3Cmn%3E6%3C%2Fmn%3E%3Cmn%3E6%3C%2Fmn%3E%3C%2Fmath%3E)
。以上说法中正确的序号有
。