Hãy nhập câu hỏi của bạn vào đây, nếu là tài khoản VIP, bạn sẽ được ưu tiên trả lời.
\(1,\text{Nếu p;q cùng lẻ thì:}7pq^2+p\text{ chẵn};q^3+43p^3+1\text{ lẻ}\Rightarrow\text{có ít nhất 1 số chẵn}\)
\(+,p=2\Rightarrow14q^2+2=q^3+345\Leftrightarrow14q^2=q^3+343\)
\(\Leftrightarrow q^2\left(14-q\right)=343\text{ đến đây thì :))}\)
\(+,q=2\Rightarrow29p=9+43p^3\Leftrightarrow29p-43p^3=9\text{loại}\)
\(+,p=q=2\Rightarrow7.8+2=8+43.8+1\left(\text{loại}\right)\)
Nhận thấy A = 3n + 4n +1 chia hết cho 2 với mọi n tự nhiên, để A chia hết cho 10 ta cần A chia hết cho 5 là đủ.
Nhận xét: 34 \(\equiv\)1 (mod 5), ta sẽ xét các trường hợp: n = 4k, n = 4k+1, n = 4k+2, n = 4k+3 với k là số tự nhiên.
TH1: n = 4k.
A = 34k + 4.(4k) + 1 = 81k + 16k +1 \(\equiv\)1 + k + 1 \(\equiv\)2+k (mod 5)
Để A chia hết cho 5 thì k phải có dạng 5h + 3, với h là số tự nhiên. Vậy n = 4.(5h+3) = 20h +12 thì A chia hết cho 10.
Tương tự với các trường hợp sau bạn giải tiếp nhé!
iiiiiiiiiiiiiiiiiiiiirrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrgggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggffffffffffffffffffffff
2.
Để $10^n-1\vdots 121$ thì trước tiên $10^n-1\vdots 11$ hay $10^n-1\equiv 0\pmod 11$
Mà: $10^n-1\equiv (-1)^n-1\pmod 11$ nên $n$ chẵn.
Đặt $n=2k$ với $k$ tự nhiên.
Ta có:
$10^n-1=10^{2k}-1=100^k-1$
$=99(100^{k-1}+100^{k-2}+...+1)$
Để $10^n-1$ chia hết cho $121=11^2$ thì:
$100^{k-1}+100^{k-2}+...+1\equiv 0\pmod 11$
Mà:
$100^{k-1}+100^{k-2}+...+1\equiv 1+1+...+1\equiv k\pmod 11$
Do đó: $k\equiv 0\pmod 11$
Hay $k=11t$ với $t$ tự nhiên
Vậy $n=22t$ với $t$ là số tự nhiên.
1.
$10^n-1=(10-1)(10^{n-1}+10^{n-2}+...+10+1)$
$=9(10^{n-1}+10^{n-2}+...+10+1)$
Để $10^n-1$ chia hết cho $81$ thì $10^{n-1}+10^{n-2}+...+10+1\equiv 0\pmod 9$
Mà:
$10^{n-1}+10^{n-2}+...+10+1\equiv 1+1+...+1\equiv n\pmod 9$
Do đó, để $10^n-1$ chia hết cho $81$ thì $n\equiv 0\pmod 9$ hay $n\vdots 9$