Concept explainers
LINKING concepts... For Individual or Group Explorations
Number Puzzles
Puzzles concerning numbers are as old as numbers themselves. The best number puzzles can be solved without a lot of mathematics, but that does not necessarily make them easy.
a) Think of a number, and add
b) Think of a number between 1 and 10. Think of the product of your number and 9. Think of the sum of the digits in your answer. Think of that number minus 5. Think of the letter in the alphabet that corresponds to the number you are thinking about. Think of a stale that begins with the letter. Think of the second letter in the state. Think of a big animal that begins with that letter. Think of the color of that animal. The color is gray. Explain.
c) Sandy has one quart of grass seed and one quart of sand, each stored in one- gallon containers. Sandy pours a little seed into the sand and shakes well. She then pours the same amount of the mix back into the container of seed so that both containers again contain exactly one quart. Is there more sand in Sandy’s seed or more seed in Sandy’s sand? Explain.
d) In each cell of the second row of the following table put one of the digits 0 through 9. You may use a digit more than once, but each digit in the second row must indicate the number of times that the digit above it appears in the second row.
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
Want to see the full answer?
Check out a sample textbook solutionChapter P Solutions
College Algebra Plus New Mymathlab With Pearson Etext Access Card
- I need diagram with solutionsarrow_forwardT. Determine the least common denominator and the domain for the 2x-3 10 problem: + x²+6x+8 x²+x-12 3 2x 2. Add: + Simplify and 5x+10 x²-2x-8 state the domain. 7 3. Add/Subtract: x+2 1 + x+6 2x+2 4 Simplify and state the domain. x+1 4 4. Subtract: - Simplify 3x-3 x²-3x+2 and state the domain. 1 15 3x-5 5. Add/Subtract: + 2 2x-14 x²-7x Simplify and state the domain.arrow_forwardQ.1) Classify the following statements as a true or false statements: Q a. A simple ring R is simple as a right R-module. b. Every ideal of ZZ is small ideal. very den to is lovaginz c. A nontrivial direct summand of a module cannot be large or small submodule. d. The sum of a finite family of small submodules of a module M is small in M. e. The direct product of a finite family of projective modules is projective f. The sum of a finite family of large submodules of a module M is large in M. g. Zz contains no minimal submodules. h. Qz has no minimal and no maximal submodules. i. Every divisible Z-module is injective. j. Every projective module is a free module. a homomorp cements Q.4) Give an example and explain your claim in each case: a) A module M which has a largest proper submodule, is directly indecomposable. b) A free subset of a module. c) A finite free module. d) A module contains no a direct summand. e) A short split exact sequence of modules.arrow_forward
- Listen ANALYZING RELATIONSHIPS Describe the x-values for which (a) f is increasing or decreasing, (b) f(x) > 0 and (c) f(x) <0. y Af -2 1 2 4x a. The function is increasing when and decreasing whenarrow_forwardBy forming the augmented matrix corresponding to this system of equations and usingGaussian elimination, find the values of t and u that imply the system:(i) is inconsistent.(ii) has infinitely many solutions.(iii) has a unique solutiona=2 b=1arrow_forwardif a=2 and b=1 1) Calculate 49(B-1)2+7B−1AT+7ATB−1+(AT)2 2)Find a matrix C such that (B − 2C)-1=A 3) Find a non-diagonal matrix E ̸= B such that det(AB) = det(AE)arrow_forwardWrite the equation line shown on the graph in slope, intercept form.arrow_forward1.2.15. (!) Let W be a closed walk of length at least 1 that does not contain a cycle. Prove that some edge of W repeats immediately (once in each direction).arrow_forward1.2.18. (!) Let G be the graph whose vertex set is the set of k-tuples with elements in (0, 1), with x adjacent to y if x and y differ in exactly two positions. Determine the number of components of G.arrow_forward1.2.17. (!) Let G,, be the graph whose vertices are the permutations of (1,..., n}, with two permutations a₁, ..., a,, and b₁, ..., b, adjacent if they differ by interchanging a pair of adjacent entries (G3 shown below). Prove that G,, is connected. 132 123 213 312 321 231arrow_forward1.2.19. Let and s be natural numbers. Let G be the simple graph with vertex set Vo... V„−1 such that v; ↔ v; if and only if |ji| Є (r,s). Prove that S has exactly k components, where k is the greatest common divisor of {n, r,s}.arrow_forward1.2.20. (!) Let u be a cut-vertex of a simple graph G. Prove that G - v is connected. עarrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal LittellAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning