JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers The algorithm: given two numbers, n1 and n2: Divide n1 by n2 and let r be the remainder. If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.) Set n1 to the value of n2, set n2 to the value of r, and go back to step 1. Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad. Catch this problem as it happens and make the user enter another value until they enter an acceptable one. Give an appropriate error message if this happens.

JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers The algorithm: given two numbers, n1 and n2: Divide n1 by n2 and let r be the remainder. If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.) Set n1 to the value of n2, set n2 to the value of r, and go back to step 1. Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad. Catch this problem as it happens and make the user enter another value until they enter an acceptable one. Give an appropriate error message if this happens.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

Use java Only. Introduction: The equation of a straight line is written as y = mx + b where m is the slope of the line and b is the value of y when x = 0. If there are two coordinate points of the line are given, then it is very easy to compute the line equation. Also you can find the distance between two points. Problem: Write a program to compute lines equation for a set of lines. The number of lines is read from the user. Each line is computed by generating two points randomly using Point2D API. In addition, distance between two points is computed. The program should display a table which include all information about each line. See sample runs below. Take into consideration: 1. Number of generated lines should be greater than zero. 2. Two point objects are constructed only once. Then just update the location of two points for each line using Point2D API methods. 3. x and y values of each point are generated randomly to be less than 100 and greater than 0. 4. Compute the distance…
In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
ISP-Java Write a program whose input is two integers, and whose output is the first integer and subsequent increments of 10 as long as the value is less than or equal to the second integer. For coding simplicity, output a space after every integer, including the last. Ex: If the input is: -15 30 the output is: -15 -5 5 15 25 Ex: If the second integer is less than the first as in: 20 5 the output is: Second integer can't be less than the first.
Using Java Let |p|2 denote the size of p in bits. Your task is to generate a safe prime q, where q = 2p + 1, and p is also prime. However, the size of |p|2 = φ, where φ is obtained from the input. You are to write a program that asks for the size of φ, and then use the Lehman’s test to find a prime number p, and then use the Lehman’s test again to find the prime number q. The program is to output p, |p|2, q, |q|2
JAVA: Write a program that reads an integer and prints how many digits the number has, by checking whether the number is ≥ 10, ≥ 100, and so on. (Assume that all integers are less than ten billion.) If the number is negative, first multiply it with –1.
Write 3 codes that calculate the greatest common divisor of two integers using mathematical methods. For each code, write the algorithms for them. ** in java language**
Language: C Pascal’s triangle is a triangular array, useful for calculating the binomial coefficients, n k , that are used in expanding binomials raised to powers, combinatorics and probability theory. 0 0 1 0 1 1 2 0 2 1 2 2 3 0 3 1 3 2 3 3 4 0 4 1 4 2 4 3 4 4 Evaluating the values of the binomial coefficients, you get the following pattern, 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 The number of the entries in each row is increased by one, as we move down. Each number in the triangle, is constructed by adding the number above it and to the left, with the number above it and to the right. The blank entries as treated as 0. Using the recursion, implement the function that computes the Pascal’s triangle. Pr
Java Program Problem 4: Magic Square Test A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. See all rows’, columns’ and diagonal’s sum is same. Write a main method where first you need to input n. Then input n*n integers and form a 2D matrix. Print “YES” if the matrix is magic square and print “NO” Otherwise. Sample input: 3 2 7 6 9 5 1 4 3 8 Output: YES
Java Program Problem 4: Magic Square Test A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. See all rows’, columns’ and diagonal’s sum is same. Write a main method where first you need to input n. Then input n*n integers and form a 2D matrix. Print “YES” if the matrix is magic square and print “NO” Otherwise. Sample input: 3 2 7 6 9 5 1 4 3 8
JAVA CODE PLS Rectangle by CodeChum Admin A rectangle can be formed given two points, the top left point and the bottom right point. Assuming that the top left corner of the console is point (0,0), the bottom right corner of the console is point (MAX, MAX) and given two points (all "x" and "y" coordinates are positive), you should be able to draw the rectangle in the correct location, determine if it is a square or a rectangle, and compute for its area, perimeter and center point. To be able to do this, you should create a class for a point (that has an x-coordinate and a y-coordinate). Also, create another class called Rectangle. The Rectangle should have 2 points, the top left and the bottom right. You should also implement the following methods for the Rectangle: display() - draws the rectangle on the console based on the sample area() - computes and returns the area of a given rectangle perimeter() - computes and returns the perimeter of a given rectangle centerPoint() -…
Problem 4: Magic Square Test A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. See all rows’, columns’ and diagonal’s sum is same. Write a main method where first you need to input n. Then input n*n integers and form a 2D matrix. Print “YES” if the matrix is magic square and print “NO” Otherwise. Sample input: 3 2 7 6 9 5 1 4 3 8 Output: YES
Determine whether a string is a palindrome A palindrome is a string of characters that reads the same from right to left as it does from left to right, regardless of punctuation and spaces. Some famous English palindromes include the following “Madam, I’m Adam”, and “Never odd or even”. Of course, a simpler example would be the world “radar”.The specifications for this assignment are: Write and test a non-recursive solution in Java that determines whether a string is a palindrome •Your program should consist of at least two methods: (1) the main method (2) the method which performs the task of determining whether the specified string is a palindrome. You should name this method isPalindrome. You should name the class that contains your “main” method and the isPalindrome method FindPalindrome. •You must use a Stack and a Queue in your solution:Make sure to Write your own Stack and Queue based on the Vector in the Java API and use those in your solution. You should name those classes…