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);
}
Divisibility testing for prime numbers is a method used to determine if a given number is a prime number. It involves checking if the number can be divided by any number other than 1 and itself without leaving a remainder.
Divisibility testing is important in mathematics because it helps us identify prime numbers, which are the building blocks of all numbers. It also helps us in finding factors and multiples of numbers, which are important concepts in various mathematical operations.
The steps involved in divisibility testing for prime numbers are as follows: 1. Start with the number to be tested.2. Start dividing the number by 2. 3. If the number is divisible by 2, continue dividing by 2 until you get a remainder. 4. If the remainder is 0, the number is not a prime number. 5. If the remainder is not 0, move on to the next prime number (3, 5, 7, etc.) and repeat the process until you get a remainder. 6. If the remainder is 0 for any of these prime numbers, then the number is not a prime number. 7. If the remainder is not 0 for any of these prime numbers, then the number is a prime number.
Divisibility testing is a method used to determine if a given number is a prime number, while the Sieve of Eratosthenes is a method used to find all prime numbers up to a given number. Divisibility testing involves dividing a number by specific prime numbers, while the Sieve of Eratosthenes involves creating a list of all numbers and crossing out multiples of prime numbers to identify prime numbers.
Divisibility testing is used in cryptography, which involves encoding and decoding secret messages. It is also used in computing, specifically in algorithms that involve finding prime numbers. Additionally, divisibility testing is used in fields such as finance, statistics, and data analysis. It is also used in everyday tasks like checking if a number is divisible by 2 to determine if it is even or odd.