Question

[Thư]

Chứng minh \(A=7^1+7^2+7^3+....+7^{4k}\)(với k là số tự nhiên) chia hết cho 400

GIÚP MIK VỚI

Answer 1

[Yuri Sweet[𝕿𝖊𝖆𝖒 𝕹𝖊𝖕𝖆𝖑]]

Ta có : \(A=7+7^2+7^3+...+7^{4k}\)

\(=\left(7+7^2+7^3+7^4\right)+...+\left(7^{4k-3}+7^{4k-2}+7^{4k-1}+7^{4k}\right)\)

\(=\left(7+7^2+7^3+7^4\right)+...+7^{4k-4}\left(7+7^2+7^3+7^4\right)\)

\(=\left(7+7^2+7^3+7^4\right)\left(1+...+7^{4k-4}\right)\)

\(=2800\left(1+...+7^{4k-4}\right)\)

\(=350.8\left(1+...+7^{4k-4}\right)⋮8\)

\(\Rightarrow A⋮8\left(1\right)\)

Ta lại có : \(A=7+7^2+7^3+...+7^{4k}\)

\(\Rightarrow7A=7^2+7^3+7^4+...+7^{4k+1}\)

\(\Rightarrow7A-A=\left(7^2+7^3+7^4+...+7^{4k+1}\right)-\left(7+7^2+7^3+....+7^{4k}\right)\)

hay \(6A=7^{4k+1}-7=7\left(7^{4k}-1\right)\)

Vì \(7\equiv2\left(mod5\right)\)\(\Rightarrow7^{4k}\equiv2^{4k}=16^k\left(mod5\right)\)

mà \(16\equiv1\left(mod5\right)\)\(\Rightarrow16^k\equiv1^k=1\left(mod5\right)\)

\(\Rightarrow7^{4k}\equiv1\left(mod5\right)\)

\(\Rightarrow7^{4k}-1⋮5\left(\cdot\right)\)

\(\Rightarrow7\left(7^{4k}-1\right)⋮5\)

\(\Rightarrow6A⋮5\)

Nhưng \(\left(6;5\right)=1\)

\(\Rightarrow A⋮5\left(2\right)\)

Ta lại có tiếp : \(7\equiv1\left(mod2\right)\)

\(\Rightarrow7^{4k}\equiv1^{4k}=1\left(mod2\right)\)

\(\Rightarrow7^{4k}-1⋮2\left(\cdot\cdot\right)\)

Từ \(\left(\cdot\right)\), \(\left(\cdot\cdot\right)\) và \(\left(2;5\right)=1\): \(\Rightarrow7^{4k}-1⋮10\)

\(\Rightarrow7\left(7^{4k}-1\right)⋮10\)

\(\Rightarrow6A⋮10\)

Nhưng \(\left(6;10\right)=1\)

\(\Rightarrow A⋮10\left(3\right)\)

Từ \(\left(1\right),\left(2\right),\left(3\right)\)và \(\left(5;8;10\right)=1\)

\(\Rightarrow A⋮400\left(đpcm\right)\)