Problem Description
Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative integer k(k<10000),to find the minimal nonegative integer a,make the arbitrary integer x ,65|f(x)if
no exists that a,then print "no".
no exists that a,then print "no".
Input
The input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.
Output
The output contains a string "no",if you can't find a,or you should output a line contains the a.More details in the Sample Output.
Sample Input
11 100 9999
Sample Output
22 no 43
/*
f(x)=5*x^13+13*x^5+k*a*x=x(5*x^12+13*x^4+k*a),
这个函数的形式直接就是费马小定理的形式从百科抄来的,
需要深究请查百科费马小定理费马小定理是数论中的一个重要定理,其
内容为: 假如p是质数,且(a,p)=1,那么 a^(p-1) ≡1(mod p)
假如p是质数,且a,p互质,那么 a的(p-1)次方除以p的余数恒等于1对f(x)=x(5*x^12+13*x^4+k*a)
用此定理分析:
(1)如果x是65的倍数,那么已经符合65整除f(x)
(2)如果x是5的倍数,只要5*x^12+13*x^4+k*a被13整除即可,去掉13的倍数13*x^4,也即5*x^12+k*a被13整除,由费马小定理,5与13互质,13是质数,所以x^(13-1)模13余1,所以5*x^12模13余5,要使5*x^12+k*a被13整除,k*a必须模13余8(k*a≡8(mod 13)
(3)如果x是13的倍数,类似(2),需要13*x^4+k*a被5整除,由费马小定理类似得到x^4模5余1,所以13*x^4模5余3,k*a必须模5余2(k*a≡8(mod 13))(4)如果x不含5和13这两个因子,则需要5*x^12+13*x^4+k*a被65整除了,等价于既要被5整除,又要被13整除,就相当于以上(2)(3)两种情况的条件要同时满足,所以有k*a≡2(mod 5) 并且 k*a≡8(mod 13)
*/
#include<stdio.h>
int main()
{
int k,a,flag;
while(~scanf("%d",&k))
{
flag=0;
for(a=1;a<=65;++a)
{
if((k*a)%13==8&&(k*a)%5==2)
{
printf("%d\n",a);
flag=1;
break;
}
}
if(!flag) printf("no\n");
}
return 0;
}
//数学归纳法也可以