\(2,\\ n=0\Leftrightarrow A=1\left(loại\right)\\ n=1\Leftrightarrow A=3\left(nhận\right)\\ n>1\Leftrightarrow A=n^{2012}-n^2+n^{2002}-n+n^2+n+1\\ \Leftrightarrow A=n^2\left[\left(n^3\right)^{670}-1\right]+n\left[\left(n^3\right)^{667}-1\right]+\left(n^2+n+1\right)\)

Ta có \(\left(n^3\right)^{670}-1⋮\left(n^3-1\right)=\left(n-1\right)\left(n^2+n+1\right)⋮\left(n^2+n+1\right)\)

Tương tự \(\left(n^3\right)^{667}⋮\left(n^2+n+1\right)\)

\(\Leftrightarrow A⋮\left(n^2+n+1\right);A>1\)

Vậy A là hợp số với \(n>1\)

Vậy \(n=1\)

\(3,\)

Đặt \(A=n^4+n^3+1\)

\(n=1\Leftrightarrow A=3\left(loại\right)\\ n\ge2\Leftrightarrow\left(2n^2+n-1\right)^2\le4A\le\left(2n^2+n\right)^2\\ \Leftrightarrow4A=\left(2n^2+n\right)^2\\ \Leftrightarrow4n^2+4n^3+4=4n^2+4n^3+n^2\\ \Leftrightarrow n^2=4\Leftrightarrow n=2\)

Vậy \(n=2\)

#include <bits/stdc++.h>

using namespace std;
long long a[1000006];
long long n;
int main()
{
    for(int i=1;i<=1000006;i++){
        a[i]=i*i;
    }
    cin>>n;
    for(int i=1;i<=n;i++){
        if(a[i]%n==0){cout<<a[i]/n;break;}
    }
    return 0;
}

pịa

\(n^2+3n=k^2\)

\(\Leftrightarrow4n^2+12n=4k^2\)

\(\Leftrightarrow\left(2n+3\right)^2-9=\left(2k\right)^2\)

\(\Leftrightarrow\left(2n+3\right)^2-\left(2k\right)^2=9\)

\(\Leftrightarrow\left(2n-2k+3\right)\left(2n+2k+3\right)=9\)

Phương trình ước số cơ bản