索引
- (解数)定理1:设 m 1 , m 2 , ⋯ , m k ∈ Z > 0 { {m}_{1}},{ {m}_{2}},\cdots ,{ {m}_{k}}\in { {\mathbb{Z}}_{>0}} m1,m2,⋯,mk∈Z>0两两互素, m = ∏ i = 1 k m i m=\prod\limits_{i=1}^{k}{ { {m}_{i}}} m=i=1∏kmi, f ( x ) f\left( x \right) f(x)是整系数多项式,则
-
- 1-i): f ( x ) ≡ 0 m o d m 有 解 ⇔ 方 程 组 f ( x ) ≡ 0 m o d m i ( 1 ≤ i ≤ k ) 有 解 f\left( x \right)\equiv 0\text{ }\bmod m有解\Leftrightarrow 方程组f\left( x \right)\equiv 0\text{ }\bmod { {m}_{i}}\left( 1\le i\le k \right)有解 f(x)≡0 modm有解⇔方程组f(x)≡0 modmi(1≤i≤k)有解
- 1-ii):设 f ( x ) ≡ 0 m o d m f\left( x \right)\equiv 0\text{ }\bmod m f(x)≡0 modm有 T T T个 m o d m \bmod m modm的解,而 ∀ 1 ≤ i ≤ k \forall 1\le i\le k ∀1≤i≤k, f ( x ) ≡ 0 m o d m i f\left( x \right)\equiv 0\text{ }\bmod { {m}_{i}} f(x)≡0 modmi有 T i { {T}_{i}} Ti个 m o d m i \bmod { {m}_{i}} modmi的解,则有 T = ∏ i = 1 k T i T=\prod\limits_{i=1}^{k}{ { {T}_{i}}} T=i=1∏kTi
- 例题
- (解法)定理2(Hensel引理):设 f ( x ) f\left( x \right) f(x)是整系数多项式, k ∈ Z > 1 k\in { {\mathbb{Z}}_{>1}} k∈Z>1, p p p是素数,且 f ( x ) ≡ 0 m o d p k − 1 f\left( x \right)\equiv 0\text{ }\bmod { {p}^{k-1}} f(x)≡0 modpk−1有解 x ≡ r m o d p k − 1 x\equiv r\text{ }\bmod { {p}^{k-1}} x≡r modpk−1,则
-
- 2-i): f ( x ) ≡ 0 m o d p k 有解 ⇔ f ( r ) p k − 1 + t f ′ ( r ) ≡ 0 m o d p 有 解 f\left( x \right)\equiv 0\text{ }\bmod { {p}^{k}}\text{ 有解}\Leftrightarrow \text{ }\frac{f\left( r \right)}{ { {p}^{k-1}}}+tf'\left( r \right)\equiv 0\text{ }\bmod p有解 f(x)≡0 modpk 有解⇔ pk−1f(r)+tf′(r)≡0 modp有解
- 2-ii): f ′ ( r ) ≡ 0 m o d p ⇒ ∃ ! t ∈ { 0 , 1 , ⋯ , p − 1 } , f ( r + t p k − 1 ) ≡ 0 m o d p k f'\left( r \right)\cancel{\equiv }0\text{ }\bmod p\text{ }\Rightarrow \text{ }\exists !t\in \left\{ 0,1,\cdots ,p-1 \right\},\text{ }f\left( r+t{ {p}^{k-1}} \right)\equiv 0\text{ }\bmod { {p}^{k}} f′(r)≡ 0 modp ⇒ ∃!t∈{ 0,1,⋯,p−1}, f(r+tpk−1)≡0 modpk
- 2-iii): f ′ ( r ) ≡ 0 m o d p & f ( r ) ≡ 0 m o d p k ⇒ ∀ t ∈ { 0 , 1 , ⋯ , p − 1 } , f ( r + t p k − 1 ) ≡ 0 m o d p k f'\left( r \right)\equiv 0\text{ }\bmod p\text{ }\And \text{ }f\left( r \right)\equiv 0\text{ }\bmod { {p}^{k}}\text{ }\Rightarrow \text{ }\forall t\in \left\{ 0,1,\cdots ,p-1 \right\},\text{ }f\left( r+t{ {p}^{k-1}} \right)\equiv 0\text{ }\bmod { {p}^{k}} f′(r)≡0 modp & f(r)≡0 modpk ⇒ ∀t∈{ 0,1,⋯,p−1}, f(r+tpk−1)≡0 modpk
- 2-iv): f ′ ( r ) ≡ 0 m o d p & f ( r ) ≡ 0 m o d p k ⇒ ∀ t ∈ { 0 , 1 , ⋯ , p − 1 } , f ( r + t p k − 1 ) ≡ 0 m o d p k f'\left( r \right)\equiv 0\text{ }\bmod p\text{ }\And \text{ }f\left( r \right)\cancel{\equiv }0\text{ }\bmod { {p}^{k}}\text{ }\Rightarrow \text{ }\forall t\in \left\{ 0,1,\cdots ,p-1 \right\},\text{ }f\left( r+t{ {p}^{k-1}} \right)\cancel{\equiv }0\text{ }\bmod { {p}^{k}} f′(r)≡0 modp & f(r)≡ 0 modpk ⇒ ∀t∈{ 0,1,⋯,p−1}, f(r+tpk−1)≡ 0 modpk
- 推论:设 f ( x ) f\left( x \right) f(x)是整系数多项式, k ∈ Z > 1 k\in { {\mathbb{Z}}_{>1}} k∈Z>1。设有 x 1 ∈ Z { {x}_{1}}\in \mathbb{Z} x1∈Z满足 f ( x 1 ) ≡ 0 m o d p & f ′ ( x 1 ) ≡ 0 m o d p f\left( { {x}_{1}} \right)\equiv 0\text{ }\bmod p\text{ }\And \text{ }f'\left( { {x}_{1}} \right)\cancel{\equiv }0\text{ }\bmod p f(x1)≡0 modp & f′(x1)≡ 0 modp,则 f ( x ) ≡ 0 m o d p k f\left( x \right)\equiv 0\text{ }\bmod { {p}^{k}} f(x)≡0 modpk有解 x k m o d p k { {x}_{k}}\text{ }\bmod { {p}^{k}} xk modpk且满足 x k ≡ x 1 m o d p { {x}_{k}}\equiv { {x}_{1}}\text{ }\bmod p xk≡x1 modp。
(解数)定理1:设 m 1 , m 2 , ⋯ , m k ∈ Z > 0 { {m}_{1}},{ {m}_{2}},\cdots ,{ {m}_{k}}\in { {\mathbb{Z}}_{>0}} m1,m2,⋯,mk∈Z>0两两互素, m = ∏ i = 1 k m i m=\prod\limits_{i=1}^{k}{ { {m}_{i}}} m=i=1∏kmi, f ( x ) f\left( x \right) f(x)是整系数多项式,则
1-i): f ( x ) ≡ 0 m o d m 有 解 ⇔ 方 程 组 f ( x ) ≡ 0 m o d m i ( 1 ≤ i ≤ k ) 有 解 f\left( x \right)\equiv 0\text{ }\bmod m有解\Leftrightarrow 方程组f\left( x \right)\equiv 0\text{ }\bmod { {m}_{i}}\left( 1\le i\le k \right)有解 f(x)≡0 modm有解⇔方程组f(x)≡0 modmi(1≤i≤k)有解
证明
- ( ⇒ ) \left( \Rightarrow \right) (⇒)
若 ∃ x 0 , f ( x 0 ) ≡ 0 m o d m \exists { {x}_{0}},\text{ }f\left( { {x}_{0}} \right)\equiv 0\text{ }\bmod m ∃x0, f(x0)≡0 modm,由于 ∀ 1 ≤ i ≤ k , m i ∣ m \forall 1\le i\le k,\text{ }\left. { {m}_{i}} \right|m ∀1≤i≤k, mi∣m,因此有
f ( x 0 ) ≡ 0 m o d m i , ∀ 1 ≤ i ≤ k f\left( { {x}_{0}} \right)\equiv 0\text{ }\bmod { {m}_{i}},\text{ }\forall 1\le i\le k f(x0)≡0 modmi, ∀1≤i≤k - ( ⇐ ) \left( \Leftarrow \right) (⇐)
若 ∃ x 0 , ∀ 1 ≤ i ≤ k , f ( x 0 ) ≡ 0 m o d m i \exists { {x}_{0}},\text{ }\forall 1\le i\le k,\text{ }f\left( { {x}_{0}} \right)\equiv 0\text{ }\bmod { {m}_{i}} ∃x0, ∀1≤i≤k, f(x0)≡0 modmi,则有
f ( x 0 ) ≡ 0 m o d l c m ( m 1 , ⋯ , m k ) f\left( { {x}_{0}} \right)\equiv 0\text{ }\bmod \text{ }lcm\left( { {m}_{1}},\cdots ,{ {m}_{k}} \right) f(x0)≡0 mod lcm(m1,⋯,mk)
由于 m 1 , ⋯ , m k { {m}_{1}},\cdots ,{ {m}_{k}} m1,⋯,mk两两互素,因此有
l c m ( m 1 , ⋯ , m k ) = m lcm\left( { {m}_{1}},\cdots ,{ {m}_{k}} \right)=m lcm(m1,⋯,mk)=m
即有
f ( x 0 ) ≡ 0 m o d m f\left( { {x}_{0}} \right)\equiv 0\text{ }\bmod m f(x0)≡0 modm
1-ii):设 f ( x ) ≡ 0 m o d m f\left( x \right)\equiv 0\text{ }\bmod m f(x)≡0 modm有 T T T个 m o d m \bmod m modm的解,而 ∀ 1 ≤ i ≤ k \forall 1\le i\le k ∀1≤i≤k, f ( x ) ≡ 0 m o d m i f\left( x \right)\equiv 0\text{ }\bmod { {m}_{i}} f(x)≡0 modmi有 T i { {T}_{i}} Ti个 m o d m i \bmod { {m}_{i}} modmi的解,则有 T = ∏ i = 1 k T i T=\prod\limits_{i=1}^{k}{ { {T}_{i}}} T=i=1∏kTi
证明
对于一个同余方程
f ( x ) ≡ 0 m o d m f\left( x \right)\equiv 0\text{ }\bmod m f(x)≡0 modm
将 m m m进行素因子分解得到
m = p 1 e 1 p 2 e 2 ⋯ p k e k m={
{p}_{1}}^{
{
{e}_{1}}}{
{p}_{2}}^{
{
{e}_{2}}}\cdots {
{p}_{k}}^{
{
{e}_{k}}} m=p1e1p2e2⋯pkek
则 p 1 e 1 , p 2 e 2 , ⋯ , p k e k {
{p}_{1}}^{
{
{e}_{1}}},{
{p}_{2}}^{
{
{e}_{2}}},\cdots ,{
{p}_{k}}^{
{
{e}_{k}}} p1e1,p2e2,⋯,pkek两两互素。由定理1-i),问题等价于求解方程组
f ( x ) ≡ 0 m o d p i e i , i = 1 , 2 , ⋯ , k f\left( x \right)\equiv 0\text{ }\bmod {
{p}_{i}}^{
{
{e}_{i}}},\text{ }i=1,2,\cdots ,k f(x)≡0 modpiei, i=1,2,⋯,k
设 f ( x ) ≡ 0 m o d p i e i f\left( x \right)\equiv 0\text{ }\bmod {
{p}_{i}}^{
{
{e}_{i}}} f(x)≡0 modpiei的解集为
S i = { x ≡ b i j i m o d m i , j i = 1 , 2 , ⋯ , T i } {
{S}_{i}}=\left\{ x\equiv b_{i}^{
{
{j}_{i}}}\text{ }\bmod {
{m}_{i}},{
{j}_{i}}=1,2,\cdots ,{
{T}_{i}} \right\} Si={
x≡biji modmi,ji=1,2,⋯,Ti}
其中 j i {
{j}_{i}} ji是作为左上标而非指数。
则问题又等价于求解 ∏ i = 1 k T i \prod\limits_{i=1}^{k}{
{
{T}_{i}}} i=1∏kTi个方程组
{ x ≡ b 1 j 1 m o d m 1 , j 1 ∈ { 1 , 2 , ⋯ , T 1 } x ≡ b 2 j 2 m o d m 2 , j 2 ∈ { 1 , 2 , ⋯ , T 2 } ⋮ x ≡ b k j k m o d m k , j k ∈ { 1 , 2 , ⋯ , T k } \left\{ \begin{aligned} & x\equiv b_{1}^{
{
{j}_{1}}}\text{ }\bmod {
{m}_{1}},\text{ }{
{j}_{1}}\in \left\{ 1,2,\cdots ,{
{T}_{1}} \right\} \\ & x\equiv b_{2}^{
{
{j}_{2}}}\text{ }\bmod {
{m}_{2}},{
{j}_{2}}\in \left\{ 1,2,\cdots ,{
{T}_{2}} \right\}\\ & \vdots \\ & x\equiv b_{k}^{
{
{j}_{k}}}\text{ }\bmod {
{m}_{k}},\text{ }{
{j}_{k}}\in \left\{ 1,2,\cdots ,{
{T}_{k}} \right\} \\ \end{aligned} \right. ⎩⎪⎪⎪⎪⎪⎨⎪⎪⎪⎪⎪⎧x≡b1j1 modm1, j1∈{
1,2,⋯,T1}x≡b2j2 modm2,j2∈{
1,2,⋯,T2}⋮x≡bkjk modmk, jk∈{
1,2,⋯,Tk}
令 m = m i M i , ∀ i m={
{m}_{i}}{
{M}_{i}},\text{ }\forall i m=miMi, ∀i,并解 M i M i ′ ≡ 1 m o d m i {
{M}_{i}}{
{M}_{i}}'\equiv 1\text{ }\bmod {
{m}_{i}} MiMi′≡1 modmi得 M i ′ {
{M}_{i}}' Mi′。由孙子定理,最终得到原同余式 f ( x ) ≡ 0 m o d m f\left( x \right)\equiv 0\text{ }\bmod m f(x)≡0 modm的一切解为
x ≡ ∑ i = 1 k M i M i ′ b i j i , ∀ i , ∀ j i ∈ { 1 , 2 , ⋯ , T i } x\equiv \sum\limits_{i=1}^{k}{
{
{M}_{i}}{
{M}_{i}}'b_{i}^{
{
{j}_{i}}}},\text{ }\forall i,\text{ }\forall {
{j}_{i}}\in \left\{ 1,2,\cdots ,{
{T}_{i}} \right\} x≡i=1∑kMiMi′biji, ∀i, ∀ji∈{
1,2,⋯,Ti}
又由博文《孙子定理与首一一元一次同余式组(模数两两互素的情况)》中的第二个定理,若 ∃ ξ i ′ , ξ i ′ ′ ∈ { b i 1 , b i 2 , ⋯ , b i T i } & ξ i ′ ≠ ξ i ′ ′ \exists {
{\xi }_{i}}',{
{\xi }_{i}}''\in \left\{ b_{i}^{1},b_{i}^{2},\cdots ,b_{i}^{
{
{T}_{i}}} \right\}\text{ }\And \text{ }{
{\xi }_{i}}'\ne {
{\xi }_{i}}'' ∃ξi′,ξi′′∈{
bi1,bi2,⋯,biTi} & ξi′=ξi′′,则有
∑ i = 1 k M i M i ′ ξ i ′ ≡ ∑ i = 1 k M i M i ′ ξ i ′ ′ m o d m \sum\limits_{i=1}^{k}{
{
{M}_{i}}{
{M}_{i}}'{
{\xi }_{i}}'}\cancel{\equiv }\sum\limits_{i=1}^{k}{
{
{M}_{i}}{
{M}_{i}}'{
{\xi }_{i}}''}\text{ }\bmod m i=1∑kMiMi′ξi′≡
i=1∑kMiMi′ξi′′ modm
因此方程 f ( x ) ≡ 0 m o d m f\left( x \right)\equiv 0\text{ }\bmod m f(x)≡0 modm的 m o d m \bmod m modm解个数 T T T满足
T = ∏ i = 1 k T i T=\prod\limits_{i=1}^{k}{
{
{T}_{i}}} T=i=1∏kTi
例题
-
使用穷举法求解高次同余式
f ( x ) ≡ x 4 + 2 x 3 + 8 x + 9 ≡ 0 m o d 35 f\left( x \right)\equiv { {x}^{4}}+2{ {x}^{3}}+8x+9\equiv 0\text{ }\bmod 35 f(x)≡x4+2x3+8x+9≡0 mod35
解
直接使用穷举法代入 x = 0 , ± 1 , ± 2 , ⋯ , ± 17 x=0,\text{ }\pm 1,\text{ }\pm 2,\text{ }\cdots ,\text{ }\pm 17 x=0, ±1, ±2, ⋯, ±17计算,且模数 35