Use the opposite-change algorithm to compute 189+342

Q: Find NP 6x- 23- M N 3x+ 2

A: Given, MP = 6x -23  MN = x-5  NP = 3x+2  We have to find NP.

Q: find the gcd (243,715) by using the eucladian algorithm. The find the Bezout coefficients and write…

A:

Q: Use Euclidean Algorithm to find gcd(165, 155).

A:

Q: Find the number of positive integers X smaller than 12849 which have exactly 2022 positive divisors

A: Theory : Total no of divisor of a number, If its prime factorization, given by ∏i=1hpiai Where p is…

Q: e Force Algorithm: IT WEIGHT

A: We use  both algorithm and solve it.

Q: I. Apply the Division Algorithm on the following pairs of integers. 1. a = 35 and b= 14

A: Given Data: a=35 and b=14 Division Algorithm:

Q: Explain how to add the amount of time 3:47 to 8:19 PM using an addition algorithm like 123 +117 240

A: Explained below

Q: GCF of 32,55 using the subtraction algorithm

A:

Q: 19. compute : (16 7) 9 *

A: We have to compute: 16⊗7⊗9

Q: Using Extended Euclidean Algorithm, show that we can write 17 as a linear combination of 119 and 68

A: Extended Euclidean Algorithm- It is a method to find GCD of two integers To write:17 as a linear…

Q: Use the binary exponentiation algorithm to compute the remainder when 385 is divided by 53.

A: Remainder (385 / 53) 385 = 77 * 5 77 / 53 leaves remainder 24 So  24 * 5 = 120  When 120 / 53 leaves…

Q: Find 1- fext=/4+|3*

A: To solve this question we need have some standard formulas of differentiation

Q: Show that x2 + 9 is prime.

A: To show x2 + 9 is prime.

Q: Please find the greatest common divisor (GCD) of each of the following pairs of integers using: The…

A:

Q: 10. Find the sum of the coefficients of (2x– 3)°. c. -6560 d. -5120 а. -5660 b. -6780

A:

Q: Find the prouduct of 6.789 and 89 using the standeard algorithm

A:

Q: what two consective odd integers have a product of 63?

A: Find two odd integers.

Q: Find the g.c.d of the numbers 2,045 and 910 using Euclidian Algorithm.

A: Using Euclidean Algorithm: Dividing 2045 by 910, the remainder is 225. Now dividing 910 by 225, the…

Q: Explain how Euclidean Algorithm is used to check if an integer is a prime number or otherwise.

A:

Q: Use Eucledian algorithm to find the greatest common divisor d of a = b = 845 and integers u, v such…

A:

Q: According to the german algorithm, determine how to do: 4967x35

A: Given,

Q: Express the following using factorials: 16x15x14x13 5x4x3x2x1

A: