Sunday, 24 March 2019

CHINESE REMAINDER THEOREM

import java.io.*;
import java.lang.Math;

public class Main

    static int t=1;
    int ans=0;
public static void main(String[] args) {
    int a[]={3,4,5};
    int b[]={4,5,4};
    while(true){
        int i=0;
        for( i=0;i<a.length;i++){
            if((t%a[i])!=b[i])
            break;
        }
        if(i==a.length)
        {
            System.out.println("THe MINIMUM number which satisfies condition is:"+t);break;
        }
        else{
            t++;
        }
    }
}
}

No comments:

Post a Comment

FERMATS LITTLE THEOREM

import java.math.*; import java.io.*; import java.util.Scanner; public class Main { public static void main(String[] args) {    Sca...