题意:
求解
思路:
因为(a+sqrt(b))和(a-sqrt(b))共轭,所以(a+sqrt(b))^n+(a-sqrt(b))^n为一个整数。
因为(a-1)^2<b<a^2所以0<a-sqrt(b)<1且0<(a-sqrt(b))^n<1,所以Sn = (a+sqrt(b))^n+(a-sqrt(b))^n。
Sn*( (a+sqrt(b))+(a-sqrt(b)) )
= (a+sqrt(b))^(n+1)+(a+sqrt(b))^n*(a-sqrt(b))+(a-sqrt(b))^n*(a+sqrt(b))+(a-sqrt(b))^(n+1)
= (a+sqrt(b))^(n+1)+(a-sqrt(b))^(n+1)+(a*a-b)( (a+sqrt(b))^(n-1)+(a-sqrt(b))^(n-1) )
= Sn+1+(a*a-b)*Sn-1
由上面的等式可以得到:2a*Sn = Sn+1+(a*a-b)*Sn-1 --> Sn+1 = 2*a*Sn+(b-a*a)Sn-1
由不等式可以构造出矩阵:
Sn+1 [ 2*a , b-a*a ] Sn
Sn [ 1 , 0 ] Sn-1
矩阵快速幂计算结果
C++代码:
#include<bits/stdc++.h>
using namespace std;
int a,b,n,m;
struct Matrix
{
int M[2][2];
};
Matrix Multi( Matrix A , Matrix B )
{
Matrix R;
R.M[0][0] = 0; R.M[0][1] = 0;
R.M[1][0] = 0; R.M[1][1] = 0;
for ( int i=0 ; i<2 ; i++ )
for ( int j=0 ; j<2 ; j++ )
for ( int k=0 ; k<2 ; k++ )
R.M[i][j] = ( R.M[i][j]+A.M[i][k]*B.M[k][j]%m )%m;
return R;
}
Matrix Mqpow( Matrix E , int x )
{
Matrix R;
R.M[0][0] = 1; R.M[0][1] = 0;
R.M[1][0] = 0; R.M[1][1] = 1;
while ( x )
{
if ( x&1 ) R = Multi( R , E );
x >>= 1; E = Multi( E , E );
}
return R;
}
int main()
{
for ( ; scanf ( "%d%d%d%d" , &a , &b , &n , &m )==4 ; )
{
if ( n==0 )
printf ( "%d\n" , 1%m );
else if ( n==1 )
printf ( "%d\n" , 2*a%m );
else
{
Matrix E;
E.M[0][0] = 2*a%m;
E.M[0][1] = ((b-a*a%m)%m+m)%m;
E.M[1][0] = 1;
E.M[1][1] = 0;
E = Mqpow( E , n-2 );
printf ( "%d\n" , (E.M[0][0]*2%m*((a*a%m+b%m)%m)%m+E.M[0][1]*2%m*a%m)%m );
}
}
return 0;
}