Euler’s criterion in java

According to Euler’s criterion a square root of n under modulo p exists if and only if a number num exists such that num%p is equal to n%p.

Program

import java.util.Scanner;

public class EulersCriterion {
   public static void main(String args[]) {
      Scanner sc = new Scanner(System.in);
      System.out.println("Enter n value :");
     
      int n = sc.nextInt();
      System.out.println("Enter p value :");
      int p = sc.nextInt();
      n = n % p;
      int flag = 0;
     
     for (int num = 2; num < p; num++) {
         if ((num * num) % p == n) {
            flag = 1;
         }
      }
      if(flag==1) {
         System.out.println("root of a number under modulo p exists ");
      } else {
          System.out.println("root of a number under modulo p does not exists ");
      }
   }
}

Output

Enter n value :
2
Enter p value :
7
root of a number under modulo p exists

Arjun Thakur

Published on 04-Jun-2018 14:20:09

• Related Questions & Answers
• Euler’s Totient function for all numbers smaller than or equal to n in java
• Euler's Four Square Identity in C++
• Sort an arrays of 0’s, 1’s and 2’s using Java
• Legendre’s Formula in java
• Find yesterday’s, today’s and tomorrow’s date in Python
• How to get Euler's constant value in JavaScript?
• Sort an arrays of 0’s, 1’s and 2’s using C++
• Difference Between Prim’s and Kruskal’s Algorithm
• Construct DFA of alternate 0’s and 1’s
• Fleury’s Algorithm
• kasai’s Algorithm
• Manacher’s Algorithm
• Fletcher’s Checksum
• One’s Complement
• Two’s Complement