Latest GRE Aptitude Question SOLUTION: The Euclidean algorithm is used to find the greatest common divisor (gcd) of two positive integers a and b . input(a) input(b) while b>0 begin r := a mod b a := b b := r end gcd

Follow Quotesrain

GRE Question Papers:

GRE Select Another Category Number System Select Another Topic

Exam

GRE Question Topics

General Ability (3)

General Knowledge(3)

Logical Reasoning (12)

Numerical Ability (407)

Programming (6)

Functions(6)

Verbal Ability (46)

Advertisements

Previous Question: Suppose that two binary operations, denoted by + and * are defined on a nonempty set S, and that the following conditions are satisfied for all x, y, and z in S: (1) x+y and x * y are in S (2) x+(y+z) = (x+y)+z and x*(y*z) = (x*y)*z (3) x+y = y+x Also, for each x in S and for each positive integer n, the elements nx and n x are defined recursively as x^n are defined recursively as follos: 1x = x^1 = x and If kx = x^k have been defined, then (k+1)x = kx + x and x^(k+1) = x^k * x. Which of the following must be true? I. (x*y)^n = x^n * y^n for all x and y in S and for each positive integers n. II. n(x+y) = nx ny for all x and y in S and for each positive integer n. III. x^m * x^n = x^(m+n) for each x in S and for all positive integers m and n. (A) I only (B) II only (C) III only (D) II and III only (E) I, II, and III Next Question: The minimal distance between any point on the sphere (x-2)^2 + (y-1)^2 + (z-3)^2 = 1 and any point on the sphere (x+3)^2 + (y-2)^2 + (z-4)^2 = 4 is (A) 0 (B) 4 (C) Sqrt(27) (D) 2(Sqrt2 + 1) (E)3(Sqrt3 – 1)

(#M40151760) GRE Numerical Ability question Greatest common divisor (gcd) Keep an EYE

The Euclidean algorithm is used to find the greatest common divisor (gcd) of two positive integers a and b .
input(a)
input(b)
while b>0
begin
r := a mod b
a := b
b := r
end
gcd := a
output(gcd)
When the algorithm is used to find the greatest common divisor of a = 273 and b = 110, which of the
following is the sequence of computed values for r ?
(A) 2, 26, 1, 0
(B) 2, 53, 1, 0
(C) 53, 2, 1, 0
(D) 53, 4, 1, 0
(E) 53, 5, 1, 0: Asked In GRE Aashu (9 years ago); Unsolved; Is this Puzzle helpful? (0) (0) Submit Your Solution Number System

Advertisements

Read Solution (0) :

Please Login to Read Solution.

Previous Question: Suppose that two binary operations, denoted by + and * are defined on a nonempty set S, and that the following conditions are satisfied for all x, y, and z in S: (1) x+y and x * y are in S (2) x+(y+z) = (x+y)+z and x*(y*z) = (x*y)*z (3) x+y = y+x Also, for each x in S and for each positive integer n, the elements nx and n x are defined recursively as x^n are defined recursively as follos: 1x = x^1 = x and If kx = x^k have been defined, then (k+1)x = kx + x and x^(k+1) = x^k * x. Which of the following must be true? I. (x*y)^n = x^n * y^n for all x and y in S and for each positive integers n. II. n(x+y) = nx ny for all x and y in S and for each positive integer n. III. x^m * x^n = x^(m+n) for each x in S and for all positive integers m and n. (A) I only (B) II only (C) III only (D) II and III only (E) I, II, and III Next Question: The minimal distance between any point on the sphere (x-2)^2 + (y-1)^2 + (z-3)^2 = 1 and any point on the sphere (x+3)^2 + (y-2)^2 + (z-4)^2 = 4 is (A) 0 (B) 4 (C) Sqrt(27) (D) 2(Sqrt2 + 1) (E)3(Sqrt3 – 1)

Login
Register

Sponsored Links

Advertisements

Challenger of the Day

no image

Dimple

India

Punjab

Time: 00:01:33

Points

19

Maths Quotes

Don't learn Mathematics just to prove that you are not a mentaly simple person but learn it to prove that you are intelligent

Linda

"IF YOU DON'T KNOW MATHS , IT MEAN YOU ARE FAR AWAY FROM LIFE."

Ayush

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

2510K+Registerd user
1757K+Engineers
753K+MBA Asprirant
3K+Enginnering College
250+Company Exam
150K+Interview Questions

All rights are reserved to @m4maths.com