Answered step by step
Verified Expert Solution
Question
1 Approved Answer
PRIME NUMBERS (java) boolean prime (int n): it returns true if n is prime boolean twin-prime(int n): it returns true if n > 3 is
PRIME NUMBERS (java)
boolean prime (int n): it returns true if n is prime
boolean twin-prime(int n): it returns true if n > 3 is prime and either n-2 or n+2 is also prime. Examples of twin primes: 5,7 ; 11,13; 17,19; 29,31
boolean m-prime(int n): it returns true if n is prime and it is of type 2(^m)-1. Examples of m (Mersennes) primes: 3, 7, 31, 127
Test your methods within a class and check that they work properly. Use the method prime(int n) in the implementation of the other 2 methods.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started