subject
Mathematics, 27.07.2019 04:20 musdaher

1) use the euclidean algorithm to show that, for any integer n, gcd(n, n + 1) = 1

ansver
Answers: 1

Another question on Mathematics

question
Mathematics, 21.06.2019 15:30
Gretchen is setting up for a banquet. she has 300 chairs and needs to distribute them evenly among t tables. how many chairs should she put at each table? write your answer as an expression.
Answers: 1
question
Mathematics, 21.06.2019 18:30
The volume of gas a balloon can hold varies directly as the cube of its radius. imagine a balloon with a radius of 3 inches can hold 81 cubic inches of gas. how many cubic inches of gas must be released to reduce the radius down to 2 inches?
Answers: 1
question
Mathematics, 21.06.2019 21:30
Suppose babies born after a gestation period of 32 to 35 weeks have a mean weight of 25002500 grams and a standard deviation of 800800 grams while babies born after a gestation period of 40 weeks have a mean weight of 27002700 grams and a standard deviation of 385385 grams. if a 3232-week gestation period baby weighs 21252125 grams and a 4040-week gestation period baby weighs 23252325 grams, find the corresponding z-scores. which baby weighs lessless relative to the gestation period?
Answers: 1
question
Mathematics, 22.06.2019 01:30
What is 0.368,0.380,0.365,and 0.383 in order from least to greatest
Answers: 1
You know the right answer?
1) use the euclidean algorithm to show that, for any integer n, gcd(n, n + 1) = 1...
Questions
Questions on the website: 13722361