The PrimeFinder class below contains several static methods which are used to determine information about prime numbers. Prime numbers are positive integers which have exactly two divisors (1 and themselves). public class PrimeFinder
{

/** Returns the number of prime numbers between lower and upper inclusive
* Precondition: 0 < lower <= upper
*/
public static int primesBetween(int lower, int upper)
{
/* to be implemented in part (a) */
}

/** Returns the difference between num and the closest prime number which
* is greater than or equal to num
* Precondition: num is positive
*/
public static int gapToNextPrime(int num)
{
/* to be implemented in part (b) */
}

/** Returns true if the integer n is a prime number
* Precondition: n is positive
*/
private static boolean isPrime(int n)
{
/* implementation not shown */
}

}

Required:
Write the primesBetween method which returns the number of primes between the two parameters inclusive. See below for examples of this method being used.

Jason needs to learn a new web tool. he went through his books to understand more about it. now he wants hands-on experience with using that tool. what would him? jason can use websites where workspace is provided to test the results of your code.

Me with this program in c++ ! computers represent color by combining sub-colors red, green, and blue (rgb). each sub-color's value can range from 0 to 255. thus (255, 0, 0) is bright red. (130, 0, 130) is a medium purple. (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (in other word, equal amounts of red, green, blue yield gray).given values for red, green, and blue, remove the gray part. ex: if the input is 130 50 130, the output is: 80 0 80. thus, find the smallest value, and then subtract it from all three values, thus removing the gray.

The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk,thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\