Exam 5: Number Theory
Exam 1: The Art of Problem Solving190 Questions
Exam 2: The Basic Concepts of Set Theory316 Questions
Exam 3: Introduction to Logic315 Questions
Exam 4: Numeration Systems245 Questions
Exam 5: Number Theory171 Questions
Exam 6: The Real Numbers and Their Representations401 Questions
Exam 7: The Basic Concepts of Algebra273 Questions
Exam 8: Graphs, Functions, and Systems of Equations and Inequalities136 Questions
Exam 9: Geometry182 Questions
Exam 10: Counting Methods213 Questions
Exam 11: Probability140 Questions
Exam 12: Statistics152 Questions
Exam 13: Personal Financial Management260 Questions
Exam 14: Trigonometry Formerly234 Questions
Exam 15: Graph Theory110 Questions
Exam 16: Voting and Apportionment99 Questions
Select questions type
Use the formula indicated to determine the prime number generated for the given value of n.
-
(Multiple Choice)
4.7/5
(33)
Use the formula indicated to determine the prime number generated for the given value of n.
-
(Multiple Choice)
4.8/5
(43)
Solve the problem.
-Given that the following statement is true, explain how you would use this fact to find two distinct factors of the Mersenne number . Then calculate those two factors.
"If is a prime factor of , then is a factor of the Mersenne number ."
(Essay)
4.8/5
(34)
Determine whether the statement is true or false.
-The greatest common factor of a group of natural numbers is the largest natural number that is a factor of all the numbers in a group.
(True/False)
4.8/5
(35)
Find the least common multiple of the numbers in the group.
-135, 28, 150
(Multiple Choice)
4.9/5
(41)
Determine whether the statement is true or false.
-A Pythagorean triple can be obtained as follows:
Choose any four successive terms of the Fibonacci sequence. Multiply the first and fourth. Double the product of the second and third. Add the squares of the second and third. The three numbers obtained will always form a Pythagorean triple.
(True/False)
4.8/5
(33)
Solve the problem.
-Escott used the formula to generate prime numbers for whole numbers . The formula fails to produce a prime for .
Evaluate Escott's formula for and determine whether this is a prime number. If it is not a prime number, give its prime factors.
(Short Answer)
5.0/5
(39)
Answer the question.
-A brick layer is hired to build three walls of equal length. He has three lengths of brick, 9 inches, 27 inches, and 21 inches. He plans to build one wall out of each type. What is the shortest length of
Wall possible?
(Multiple Choice)
4.8/5
(40)
Answer the question.
-Bob's frog travels 7 inches per jump, Kim's frog travels 9 inches and Jack's frog travels 13 inches. If the three frogs start off side-by-side, what is the smallest distance they must all travel before they
Are side-by-side again?
(Multiple Choice)
4.8/5
(41)
Give the prime factorization of the number. Use exponents when possible.
-28
(Multiple Choice)
4.8/5
(42)
Solve the problem.
-Fermat conjectured that the formula would always produce a prime for any whole number . The sixth Fermat number is . Evaluate this number. In seeking possible prime factors of this Fermat number, what is the largest potential prime factor that one would have to try?
(Essay)
4.9/5
(38)
Determine all values for the digit x that make the first number divisible by the second number. If none exist, so state.
-533x is divisible by 11.
(Short Answer)
4.7/5
(45)
Any composite number in the range 2 to must be a multiple of some prime number less than or equal to .
(True/False)
5.0/5
(40)
Solve the problem relating to the Fibonacci sequence.
-If a 13-inch wide rectangle is to approach the golden ratio, what should its length be?
(Multiple Choice)
4.9/5
(43)
Determine all values for the digit x that make the first number divisible by the second number. If none exist, so state.
-417,30x is divisible by 8 but not 16.
(Essay)
4.9/5
(47)
Use the Lucas sequence to answer the question.
-What is the 30th term of the Lucas sequence?
(Multiple Choice)
4.8/5
(35)
Showing 101 - 120 of 171
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)