The discussion revolves around the topic of divisibility testing for prime numbers and the development of algorithms or programs to determine divisibility. Participants explore various methods and considerations related to implementing such tests, particularly for large integers.
Participants express varying opinions on the complexity and efficiency of different divisibility testing methods. There is no consensus on a specific approach or method, and the discussion remains open-ended regarding the best practices for implementing divisibility tests.
Participants mention the potential complexity of divisibility tests for primes and the efficiency of traditional division methods, but do not resolve the specifics of these methods or their comparative effectiveness.
Originally posted by Moni
We've seen divisibility testing for different numbers...for 2,3,4,5,7,11...
But now I want to know is there any way to find divisbility with any prime number?
Suppose, how can I say 12783461236 is divisible with 97 or not?
Originally posted by Moni
Yes! I know, but I am going to develop a program myself :)
The google results I've got so far are with traditional division method, there is no use of such type of divisibility testing...
I want to develop one with this feature, then it will be faster than others available with stright forward DIVISION !
void div(char *s1,char *s2,char *r,char *q)
{
char op1[SIZE],op2[SIZE],res[SIZE],factor[SIZE],x[SIZE],div[SIZE],z[SIZE];
int i,j,l1,l2,ok;
strcpy(op1,s1);
strcpy(op2,s2);
strcpy(res,"0");
strcpy(q,"0");
l1=strlen(op1);
l2=strlen(op2);
for(i=l1-l2;i>=0;--i)
{
strcpy(x,"1");
strcpy(div,"0");
for(j=1;j<=i;++j)
{
x[j]='0';
}
x[j]=0;
mul(op2,x,factor);
while(1)
{
ok=sub(op1,factor,z);
if(ok==-1)
{
strcpy(q,op1);
break;
}
else
{
strcpy(op1,z);
add(div,x,div);
}
}
add(res,div,res);
}
if(l1<l2) strcpy(q,s1);
strcpy(r,res);
}