Scribd
Upload
3 views3 pages

39-40

The document contains a C program that identifies pairs of numbers from an input array whose greatest common divisor (GCD) is either a prime number greater than 3 and odd, or equal to 2 or 3. It includes functions for generating random numbers, calculating GCD, and checking for prime numbers. The program prompts the user for the size of the array and its elements, then outputs the valid pairs and their count.

Uploaded by

hoanglee1148
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
3 views3 pages

39-40

The document contains a C program that identifies pairs of numbers from an input array whose greatest common divisor (GCD) is either a prime number greater than 3 and odd, or equal to 2 or 3. It includes functions for generating random numbers, calculating GCD, and checking for prime numbers. The program prompts the user for the size of the array and its elements, then outputs the valid pairs and their count.

Uploaded by

hoanglee1148
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include <stdio.

h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>
int random(int min,int max)
{
return min+rand()%(max+1-min);
}
int ucln(int a,int b)
{
int r;
if(a>=b)
{
while(b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
else
{
while(a>0)
{
r=b%a;
b=a;
a=r;
}
return b;
}
}
int kiemtranguyento(int n)
{
int t=10,flag=0;
int i,s=0;
int a;
int r=n-1;
while(r%2==0)
{
s++;
r=r/2;
}
for(i=0; i<t; i++)
{
a=random(2,n-2);
int b=0;
while(r>=pow(2,b))
{
b++;
}
int k[b],z=r;
for(int m=0; m<b; m++)
{
k[m]=z%2;
z=z/2;
}
int y=1,a1=a;
if(k[0]==1)
{
y=a;
}
for(int j=1; j<b; j++)
{
a1=a1*a1%n;
if(k[j]==1)
{
y=y*a1%n;
}
}
if(y!=1&&y!=n-1)
{
int j=1;
while(j<=s-1&&y!=n-1)
{
y=y*y%n;
if(y==1)
{
flag++;
break;
}
j++;
}
if(y!=n-1)
{
flag++;
break;
}
}
}
if(flag==0)
{
return 1;
}
else
{
return 0;
}
}
int main()
{
int i,j,n,dem=0;
printf("nhap so phan tu cua mang A: ");
scanf("%d",&n);
int a[n];
for(i=0; i<n; i++)
{
printf("nhap a[%d]: ",i);
scanf("%d",&a[i]);
}
printf("cac cap so la:\n");
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
int r=ucln(a[i],a[j]);
if(r>3&&r%2==1)
{
int b=kiemtranguyento(r);
if(b==1)
{
printf("(%d,%d)\n",a[i],a[j]);
dem++;
}
}
if(r==2||r==3)
{
printf("(%d,%d)\n",a[i],a[j]);
dem++;
}
}
}
printf("So cap thoa man la %d",dem);
return 0;
}

You might also like