Find out if either: 21000 + 277 21000 + 291 21000 + 297  is prime . They do not have any prime factors less than 109.  You can use Modular Exponentiation, but you may not use commands of the form “IsPrime[n]” or “NextPrime[n].”

Q: In cryptography, it is important to use prime numbers. Write a function is_prime that has a…

A: Program description: num is the user input integer variable used to check whether the number is…

Q: # RQ1 def mult_inverse(x, y): """Returns True if the product of x and y is one. >>> mult_inverse(-1,…

A: StartRead the values of x and y.Calculate the product of x and y and store it in a variable, let's…

Q: 2. BLACKJACK: Sample two cards from a "deck of cards" (ace, 2-10, jack, queen, king). Find the total…

A: Algorithm: Set the seed for the random number generator. Create an array of strings representing…

Q: op = rand.nextInt(2) == 0 ? '+' : '-'; I want to add two more operators to this, but can't get it to…

A: Given, op = rand.nextInt(2)==0 ? "+" : "-"; NOTE: The function rand.nextInt(n) generates random…

Q: %matplotlib inline import numpy as np from matplotlib import pyplot as plt import math

A: Step 1:(solution 1.1) xn+1​=2xn​+xn​a​​a=17 , let…

Q: get_nth_word_from_string(s, n): This function takes a string s and a non-negative integer n as…

A: def get_nth_word_from_string(s, n):      # function to get the nth word from string     index = 0…

Q: Using the code posted below add code so it can plays multiple rounds of hangman using simple codes.…

A: This code has small issues for printing the round number. I have edited the code and attached the…

Q: solve in java Integer arrays groceryItemPrices and stockRecords are read from input, containing the…

A: The objective of the question is to count the number of grocery items that meet two conditions: the…

Q: Given a list of integers, you want to know whether it is possible to divide the integers into two…

A: Since no programming language is mentioned, I am using python. Algorithm: Start Implement a method…

Q: I wrote the following code, but it's not giving me the correct result. Can you help me identify…

A: The logic in the code seems correct, but there is one potential issue. If the input array is empty,…

Q: import math EPSILON = 1.0e-14 def square_root(number): approximation = 1 previous = 0 iterations = 0…

A: Here, I've established a while loop that will run indefinitely if the response is positive. I have…

Q: in java  Revers an Array of n integers Reversing an Array 1. Describe the definition of recursive…

A: Step-1: StartStep-2: Declare an array and initialize with {4, 3, 6, 2, 7, 8, 9, 5}Step-3: Declare a…

Q: Practice these steps again and then solve the set of loop problems. These problems are more…

A: Here, we have used for loop and if-else statements to implement the required functions. For loop is…

Q: For this problem you will accept a single BigInteger value. This number can potentially get VERY…

A: The complete JAVA code is given below with output screenshot

Q: One remarkably simple formula for calculating the value of p is the so-called Madhava-Leibniz…

A: The question asks to evaluate statements about the run-time performance of a given recursive…

Q: Count consecutlve summers def count_consecutive_summers(n):

A: Python code: def count_consecutive_summers(n):    #set counter to 0    count = 0    #for loop from 0…

Q: Generate 5000 random numbers in the range of [-16 to +16] both values are inclusive. Find and print…

A: Using nextInt() we can generate number from 0-32 and then decrease 16 from it

Counting sort

The counting sort algorithm sorts an array’s contents by counting the repetition of each element that occurs in the array. A counting sort algorithm is a stable algorithm that works the best when the range of elements in the array is small, say for example from 0 to 9. The count which is the number of repetitions of an element in the array is mapped to an index of an auxiliary array, which is then saved in an auxiliary array. The counting sort algorithm has a stable time complexity of the order of O(size of array + size of auxiliary array). Let’s discuss the algorithm in detail as follows.