题意:一个数n是好的,当 n4 n 4 在 [n2+1,n2+2n] [ n 2 + 1 , n 2 + 2 n ] 之间有因子。
大致思路:
这道题属于比较难的数学题了,有点考验高中数学数列放缩之类的功底了
我们令因子为
n2+a
n
2
+
a
∵n2+a|n4
∵
n
2
+
a
|
n
4
∴n2+a|n4−(n2+a)(n2−a)=a2
∴
n
2
+
a
|
n
4
−
(
n
2
+
a
)
(
n
2
−
a
)
=
a
2
又∵a∈[1,2n]
又
∵
a
∈
[
1
,
2
n
]
∴a2≤4n2<4(n2+a)
∴
a
2
≤
4
n
2
<
4
(
n
2
+
a
)
∴a2=t(n2+a),t=1,2,3
∴
a
2
=
t
(
n
2
+
a
)
,
t
=
1
,
2
,
3
这就是一个pell方程
解之后得
t=1 :无解
t=2 : n0=0,n1=2,nk+2=6nk+1−nk n 0 = 0 , n 1 = 2 , n k + 2 = 6 n k + 1 − n k
t = 3: n0=0,n1=6,nk+2=14nk+1−nk n 0 = 0 , n 1 = 6 , n k + 2 = 14 n k + 1 − n k
由于数字非常大,需要高精度
import java.awt.List;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Vector;
public class template {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BigInteger m = sc.nextBigInteger();
BigInteger a0 = BigInteger.ZERO;
BigInteger a11 = BigInteger.valueOf(2);
BigInteger a12 = BigInteger.valueOf(6);
BigInteger tmp;
while (m.compareTo(a11) > 0) {
tmp = a11;
a11 = a11.multiply(BigInteger.valueOf(6)).subtract(a0);
a0 = tmp;
}
a0 = BigInteger.ZERO;
while (m.compareTo(a12) > 0) {
tmp = a12;
a12 = a12.multiply(BigInteger.valueOf(14)).subtract(a0);
a0 = tmp;
}
if (a11.compareTo(a12) < 0) System.out.println(a11);
else System.out.println(a12);
sc.close();
}
}