LL CSET 110 - Number Theory MC | Attempts: 145

Reviewed by Editorial Team

The ProProfs editorial team is comprised of experienced subject matter experts. They've collectively created over 10,000 quizzes and lessons, serving over 100 million users. Our team includes in-house content moderators and subject matter experts, as well as a global network of rigorously trained contributors. All adhere to our comprehensive editorial guidelines, ensuring the delivery of high-quality content.

Learn about Our Editorial Process

| By Justin Gillette

Justin Gillette

Community Contributor

Quizzes Created: 2 | Total Attempts: 331

| Attempts: 145

Quiz Flashcard Lesson

Questions

Feedback

During the Quiz End of Quiz

Difficulty

Sequential Easy First Hard First

Share on Facebook Share on Twitter Share on Whatsapp Share on Pinterest Share on Email Copy to Clipboard Embed on your website

1/15 Questions

5,078 = 150(33)+128 is the first step in finding the greatest common divisor of two numbers. Which of the following is the next step in the Euclidian Algorithm?
- 150=33(4)+18
- 128=33(3)+29
- 150=128(1)+22
- 5,078=128(39)+86

About This Quiz

This quiz titled 'LL CSET 110 - Number Theory MC' tests knowledge on the Euclidean Algorithm, number simplification, and properties of numbers formed from primes.

Questions and Answers

2.

The Euclidian Algorithm is performed to find the greatest common divisor of 1,622 and 136. Which of the following is a step in this Euclidian Algorithm?
- 136 = 11(12)+4
- 126=15(8)+6
- 126=12(10)+6
- 64=8(8)+0
Correct Answer

A. 126=12(10)+6
3.

$If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b? - ProProfs$

If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b?
- 76
- 81
- 100
- 300
Correct Answer

A. 100
4.

If a and b share a greatest common divisor of c, what is the least common multiple of a and b?
- Abc
- Ab
Correct Answer

A.
5.

$If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b? - ProProfs$

If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b?
- 98
- 109
- 126
- 327
Correct Answer

A. 109
6.

Let P represent the set of all numbers of the form where x, y, and z are prime numbers less than 20. How many elements are contained in set P ?
- 56
- 512
- 729
- 6561
Correct Answer

A. 512
7.

How many factors does have if x, y, and z are integers?
- Xyz
- X+y+z
- (x+1)(y+1)(z+1)
- 105
Correct Answer

A. (x+1)(y+1)(z+1)
8.

The greatest common divisor of . How many factors of X are there?
- 12
- 16
- 24
- 36
Correct Answer

A. 12
9.

What is the greatest common divisor of 4986, 5022, 5058, and 5490?
- 6
- 9
- 12
- 18
Correct Answer

A. 18
10.

Find the least common multiple of 12, 18, 24, and 30.
- 240
- 360
- 720
- 2160
Correct Answer

A. 360
11.

Find the least common multiple of 18, 27, 36, 48, 81.
- 1260
- 1440
- 1620
- 4860
Correct Answer

A. 1620
12.

How many integers between 1 and 1000, inclusive, are a multiple of either 3 or 7?
- 381
- 428
- 430
- 475
Correct Answer

A. 428

Explanation

Err...Answer really IS 428. 333+142-47=428. Yay, mental arithmetic!

Rate this question:
13.

How many integers between 1 and 1000, inclusive, are a multiple of either 5 or 9?
- 288
- 289
- 311
- 312
Correct Answer

A. 289
14.

To prove that , the first step in a proof by mathematical induction is which of the following?
- is also true.
Correct Answer

A.
15.

has a positive integer exponents and is between 4000 and 5000, which of the following could be x+y+z?
- 6
- 9
- 11
- 15
Correct Answer

A. 9

Quiz Review Timeline (Updated): Dec 23, 2024 +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

Current Version
Dec 23, 2024

Quiz Edited by
ProProfs Editorial Team
Apr 08, 2014

Quiz Created by
Justin Gillette

Ll CSET 110 - Number Theory Mc

5,078 = 150(33)+128 is the first step in finding the greatest common divisor of two numbers. Which of the following is the next step in the Euclidian Algorithm?

The Euclidian Algorithm is performed to find the greatest common divisor of 1,622 and 136. Which of the following is a step in this Euclidian Algorithm?

If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b?

If a and b share a greatest common divisor of c, what is the least common multiple of a and b?

If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b?

Let P represent the set of all numbers of the form where x, y, and z are prime numbers less than 20. How many elements are contained in set P ?

How many factors does have if x, y, and z are integers?

The greatest common divisor of . How many factors of X are there?

What is the greatest common divisor of 4986, 5022, 5058, and 5490?

Find the least common multiple of 12, 18, 24, and 30.

Find the least common multiple of 18, 27, 36, 48, 81.

How many integers between 1 and 1000, inclusive, are a multiple of either 3 or 7?

How many integers between 1 and 1000, inclusive, are a multiple of either 5 or 9?

To prove that , the first step in a proof by mathematical induction is which of the following?

has a positive integer exponents and is between 4000 and 5000, which of the following could be x+y+z?