Comments on: Vixen 1529 Geoma Ultima 9X63ZCF Binoculars

By: liljevnan

liljevnan — Sat, 03 Apr 2010 10:52:52 +0000

De aca de Maipú Saludos y felicitaciones esta Rebueno viejo, segui asi, el video al principio dije que pija, pero la verdad es que es algo diferente y esta joya .

By: hirschwend matkowski

hirschwend matkowski — Fri, 02 Apr 2010 16:01:43 +0000

1. answer D is correct
since use two similar triangles
(17/12)=(x+7)/x
17x=12x+84
5x=84
x=84/5
2. answer A is correct
x/5=12/15
15x=60
x=4

By: traila

traila — Tue, 23 Mar 2010 02:38:39 +0000

roberto lo trovi ora sul mio blog con un analisi e piccola critica

By: clauer wakowski

clauer wakowski — Sat, 20 Mar 2010 19:32:05 +0000

Easily. He was a monomaniac and convinced that his rule was better, more powerful and more far-reaching than any before him. Most of the Kings felt that way. It's a standard human failing of arrogance.

By: zulidispie amale

zulidispie amale — Wed, 17 Mar 2010 19:32:59 +0000

The answer to #1 is C, because the other side is the hypotenuse. The answer to #2 is B because side EF is opposite the right angle.

By: singel

singel — Sat, 06 Mar 2010 21:40:07 +0000

1712, 346, 1529 tied 1829, 612, 3298 [0 to 0] in Qualifications 7 at Washington DC Regional

By: hallworty mala

hallworty mala — Sun, 28 Feb 2010 10:09:08 +0000

Check out this timeline from the Galileo Project…

The site below has TONS of events..you can search by decade…just keep changing the ends of the URLs. I did the first 3 decades for you…

http://www.decades.com/ByDecade/1550-1559/1.htm

By: tenger rouseridt

tenger rouseridt — Fri, 19 Feb 2010 20:39:34 +0000

lol…….you litle Kidy dont know what UO is??? noob

By: lazo chavesand

lazo chavesand — Mon, 08 Feb 2010 13:56:46 +0000

The Euclideam algorithm states that given a and b are integers greater than 0:

GCD(a, b) = GCD(b, a % b)

Commonly used as a computer programming example for recursive functions.

So it's just number crunching at this point.

% in case you don't know, is modulus. It's the remainder of the two integers if they were divided together.

So:

GCD (123, 277)
GCD (277, 123)
GCD (123, 31)
GCD (31, 30)
GCD (30, 1)
GCD (1, 0)

So the GCD is 1.

123 / 3 = 41. 277 is neither divisible by 3 nor 41.

Now for the other one:

GCD(1529, 14039)
GCD(14039, 1529)
GCD(1529, 278)
GCD(278, 139)
GCD(139, 0)

So the GCD is 139.

1529 / 139 = 11
14039 / 139 = 101

So this is true.

By: long

long — Sat, 06 Feb 2010 18:40:12 +0000

Lmfaooo what???? RT #StalkerSaturday This African Vixen and her patna and dem