text stringlengths 71 10k |
|---|
t then use calculus trickily to get something usable by summing up integrals. In order to do this, we need two subsidiary functions. First, recall the notation ⌊x⌋ for the greatest integer less than x. Secondly: 19This is an expansion of the terse approach taken in [E.4.6, Theorems 4.3 and 4.4]. 2e44e46e48e41e50.20.40.... |
, header_row = True , frame = True )) ) @interact def _(k =100) : p1 = 0 p3 = 0 for i in prime_range (k): if i %4==1: p1 += 1 if i %4==3: p3 += 1 pretty_print ( html (" Up ␣ to ␣ $k =% s$ ,␣ there ␣ are " %k )) pretty_print ( html (r"%s␣ primes ␣ $p \ equiv ␣ 1\ text {␣( mod ␣ }4) $␣ and ␣"% p1 )) pretty_print ( html (... |
of factoring and expanding is used, and a much more recent article by Xianzu Lin [E.7.7] is similarly elementary; see also [E.2.16, Theorem 5.3.4]. One can even prove Dirichlet’s theorem without Dirichlet’s methods for any b such that b2 1(mod a), but doing so involves some high-level details about polynomial factoriz... |
ER 22. MORE ON PRIME NUMBERS 398 • Although one would expect for 1/4 of all pairs separated by two to both be odd, n + 2 has the same parity as n so we should expect 1/2 the pairs to both be odd. • The chances that n and n + 2 are both not divisible by three is 1/3. • The chances that n and n + 2 are both not divisible... |
troduce an interesting function. Letting p be running just over primes, we let D(N ) = ( ∏ pN ) 1 1 p and then expand the expression as a sum of unit fractions. As an example, D(3) = (1 1/2)(1 1/3 ) . Before starting this chapter, try expanding D (as above, without adding the fractions) for bigger and bigger values of ... |
_(n =10) : H = [[ ' $i$ ' ,r ' $(N\ star ␣\ mu )(i)$ ' ]] T = [(i , DirichletProduct (N , moebius , i) ) for i in [1.. n ]] pretty_print ( html ( table (H+T , header_row = True , frame = True ))) Maybe this is a surprise! But this makes sense, if you remember Example 23.2.4 just previously about N = ϕ ⋆ u. Let’s confi... |
m and b; d j n. Then, as everything is multiplicative, f 1(x)f (y) = f 1(a)f 1(b)f (c)f (d). Since by the previous lemma f (1) = 1, we can subtract the summation from both sides of the equation whose left-hand side is zero at the beginning of this lemma’s proof, yielding f 1(mn) = ∑ f 1(a)f 1(b)f (c)f (d). (ac)(bd)=(m)... |
compare ␣ to ␣"+ str2 )) There is no reason this wouldn’t continue to work for many prime factors. Because every integer is uniquely represented as a product of prime powers (Fundamental Theorem of Arithmetic), this implies that we might multiply out CHAPTER 24. INFINITE SUMS AND PRODUCTS 421 the left-hand side of an ... |
irichlet series for ϕ; it converges for s > 2. Proof. From Fact 23.3.2, we recall that ϕ ⋆ u = N . Also, we know from earlier in this chapter that is absolutely convergent for s > 1. Then the Dirichlet series of ϕ is absolutely convergent as well, as 0 < 1∑ n=1 ϕ(n) ns 1∑ n=1 n ns = 1∑ n=1 1 ns1 which converges by the ... |
g divisible by 2, while if n is prime, it has almost no chance of being even.) In such a case the probabilities are independent, so that (even in this infinitary case) ∏ (1 p2) = 1/ p p ∏ 1 1 p2 = 1/(2) = 6 2 . We may note (as in the more extended discussion in [E.2.1, Chapter 9.4]) by using Fact 24.4.2 that this is al... |
bsets of the positive integers like P = f primes g such that the sum of the reciprocals of the set diverges, but the set has zero density in the integers. 5. Use Sage or other computational tools to conjecture the rate of growth of the function f (x) = ∑ px 1 p where p is of course prime. Hint: Typically one needs lumb... |
ased. And this is where (s) becomes important, because of the Euler product formula: 1∑ n=1 1 ns = ∏ p 1 1 ps Somehow does encode everything we want to know about prime numbers. And Riemann’s paper, “On the Number of Primes Less Than a Given Magnitude2”, is the place where this magic really does happen. (The paper is a... |
) n=1 J(x1/n) n = J(x) 1 2 p J( x) 1 3 p J( 3 x) 1 5 p J( 5 x)+ p J( 6 1 6 x)+ . Remark 25.4.4 This is the usual argument, but note that f (x/n) = 1 x1/n is really a function of x and n, not just x/n. The inversion can be justified somewhat differently via a footnote in Edwards’ discussion of this matter in [E.4.4], bu... |
action. Figure 25.7.2 (x), Li(x), and something better than Li This graphic shows just how good it can get. Again, notice the waviness, which allows it to approximate (x) not just once per “step” of the function, but along the steps. Try it out interactively below (where we make it somewhat less accurate for the sake ... |
g tuples Types matter Checking equality List comprehensions Getting interactive Sage help Printing it out Making comments Colorful options Reminder to try things out Euler phi in Sage More complex list comprehension Reminder for colormaps Filtering list comprehensions How Sage does primitive roots Reminder on equality ... |
1 Figure 17.6.4 Geometric interpretation of power in Eisenstein criterion Visualizing the proof of quadratic reciprocity Chapter 18 An Introduction to Functions Figure 18.1.3 Figure 18.2.7 Plotting ϕ Visualizing sums of squares as area Chapter 19 Counting and Summing Divisors Figure 19.4.12 Mersenne and amicable number... |
ammack/BookOfProof/ 19giam.southernct.edu/GIAM/ 20www.wiley.com/WileyCDA/WileyTitle/productCd-EHEP000280.html 21www.gregorybard.com/Sage.html 22www.packtpub.com/hardware-and-creative/sage-beginners-guide APPENDIX E. REFERENCES AND FURTHER RESOURCES 474 This guide is not free, but is comprehensive (for the time it was w... |
rch-Swinnerton-Dyer conjecture. [25] Lasse Rempe-Gillen and Rebecca Waldecker, Primality Testing for Be- ginners, American Mathematical Society, (2014), (Website51) Although it does cover a lot of basic number theory, the unusual main focus is making the proof of Agrawal, Kayal, and Saxena that deciding whether a numbe... |
of linear algebra and familiarity with complex numbers (and circuitry!). Yes, Shor’s algorithm and QFT is outlined at this level, rather remarkably. 71bookstore.ams.org/sstp-2 72jhupbooks.press.jhu.edu/content/how-guard-art-gallery-and-other-discrete-mathematical-adventures 73www.maa.org/publications/books/excursions-... |
numbers, see numbers, divisor, 4 counting CRT, see Chinese remainder theorem cryptography, 155, see also encryption method Advanced Encryption Standard, 182 asymmetric key, 161 cipher, 155 decode, 156 decryption, 158 digital signature, 175 elliptic curve, 169 encode, 156 encryption, 158 key exchange, 167 ‘man in the mi... |
00 races, 387 relatively, see coprime repunit, 83 safe, 178, 309 prime counting function (x), 367 explicit formula, see Riemann explicit formula for (x) Landau (Big Oh) computation, 377 not useful formula, 368 prime number theorem, 375 elementary proof, 375 prime_divisors, 80 prime_pi, 368 prime_range, 72 primes arithm... |
Y \ Z from {1, 2, · · · n} \ ZVandermonde’s convolution) Suppose we have a men and b women, and we need to choose a committee of r people. The right hand side is the total number of choices. The left hand side breaks the choices up according to the number of men vs women. Example. A greengrocer stocks n kinds of fruit.... |
Sets Example. All numbers are interesting. Suppose that there are uninteresting numbers. Then there exists a smallest uninteresting number. Then the property of being the smallest uninteresting number is itself interesting. Contradiction. Example. Consider a total order on N × N by “lexicographic” or “dictionary” order... |
then a is a unit. So ax ≡ ay iff x ≡ y. Then a, 2a, 3a, · · · (p − 1)a are distinct mod p. So they are congruent to 1, 2, · · · p − 1 in some order. Hence a · 2a · · · 3a · · · (p − 1)p − 1). So ap−1(p − 1)! ≡ (p − 1)!. So ap−1 ≡ 1 (mod p). Neither Wilson nor Fermat’s theorem hold if the modulus is non-prime. However, ... |
l numbers. Also, it is not clear how we can show this satisfies the axioms above. To actually do this properly, we will need to approach this in a slightly different way, and the details are better left for the IID Logic and Set Theory course. Construction of integers Definition (Integers). Z is obtained from N by allowin... |
ded as q → {x ∈ q : x ≤ Q}, {x ∈ Q : x > q}, instead of q → {x ∈ q : x < Q}, {x ∈ Q : x ≥ q}, We can then construct the set R from Q by letting R be the set of all Dedekind cuts. The supremum of any bounded set of real numbers is obtained by taking the union of (the left sides) of the Dedekind cuts. The definition of th... |
ler, 10φ(q) ≡ 1 (mod q), i.e. 10φ(q) − 1 = kq for some k. Then q = n + b 2c5dq b q = kb kq = kb 999 · · · 9 = kb 1 10φ(q) + 1 102φ(q) + · · · . Since kb < kq < 10φ(q), write kb = d1d2 · · · dφ(q). So b and x is periodic. q = 0.d1d2 · · · dφ(q)d1d2 · · · Example. x = 0.01101010001010 · · · , where 1s appear in prime pos... |
is countable. So F = k≥0 Fk, the set of all finite subsets of N is countable. Example. Recall P(X) = {Y : Y ⊆ X}. Now suppose P(N) is countable. Let S1, S2, S3, · · · be the list of all subsets of N. Let S = {n : n ∈ Sn}. But then S is not in the list. Contradiction. So P(N) is uncountable. Example. Let Σ be the set of... |
II Number Fields Notice we can multiply fractional ideals using the same definition as for integral ideals. Proposition. Every non-zero fractional ideal is invertible. The inverse of q is {x ∈ L : xq ⊆ OL}. This is good. Note that if q = 1 n a and r = 1 m b, and a, b OL are integral ideals, then qr = 1 mn ab = OL if and... |
x+p and (x+p)+p are equal. So this is well-defined. To prove our claim, we have to show injectivity and surjectivity. To show injectivity, since α ⊆ a, we have a | a, i.e. there is an ideal c ⊆ OL such that ac = α. If x ∈ OL is in the kernel of the map, then αx ∈ ap. So So xac ⊆ ap. xc ⊆ p. As p is prime, either c ⊆ p o... |
ime, hence 2 is inert. – If d ≡ 2, 3 (mod 4), then OL = Z[ d], and x2−d is the minimal polynomial. Taking mod 2, we get x2 or x2 + 1 = (x + 1)2. In both cases, 2 ramifies. √ Note how important p |OL/Z[α]| is. If we used Z[ √ d] when d ≡ 1 (mod 4), we would have gotten the wrong answer. Recall DL = 4d d ≡ 2, 3 d d ≡ 1 (m... |
, q | 1 + d. Thus we know pq | 1 + there is another factor of 3 to account for. In fact, we have d. We have N (pq) = 2 · 3 = 6. So √ 1 + d = pq2, which we can show by either thinking hard or expanding it out. So we must have [p] = [q]−2 in clL. So we have clL = [q]. Also, [q]−2 = [p] = 1 in clL, as if it did, then p is... |
You might have seen this in IIC Number Theory, where we proved it directly by continued fractions. We will provide a totally unconstructive proof here, since this is more easily generalized to arbitrary number fields. This is actually just half of Dirichlet’s theorem. The remaining part is to show that they are all powe... |
nd s = 1. So r + s − 1 = 0. So O× finite group. So RL = 1. L = µL is a Lemma. (i) If d = −1, then Z[i]× = {±1, ±i} = Z/4Z. (ii) If d = −3, then let ω = 1 {1, ω, · · · , ω5} ∼= Z/6Z. 2 (1 + √ d), and we have ω6 = 1. So Z[ω]× = (iii) For any other d < 0, we have O× L = {±1}. 54 7 Dirichlet’s unit theorem II Number Fields ... |
, Dirichlet series* II Number Fields Proof. By our lemma on convergence of Dirichlet series, we have to show that N i=1 χ(i) = O(1), i.e. it is bounded. Recall from Representation Theory that distinct irreducible characters of a finite group G are orthogonal, i.e. 1 |G| g∈G χ1(g)χ2(g) = 1 χ1 = χ2 0 otherwise . We apply ... |
, 24 ideal class group, 26 inert prime, 32 integral, 5 integral basis, 14 integral ideal, 22 invertible fractional ideal, 22 Kronecker–Weber theorem, 67 Langlands programme, 67 lattice, 43 minimal polynomial, 8 Minkowski bound, 40, 46 Minkowski’s lemma, 38 Minkowski’s theorem, 44 multiplication of ideals, 17 norm, 10 o... |
efine (x − θ)k + is a new function defined by (x − θ)k + = (x − θ)k x ≥ θ x < θ. 0 Then if λ is a linear functional that annihilates Pk[x], then we have λ(f ) = λ 1 k! b a (x − θ)k +f (k+1)(θ) dθ for all f ∈ C k+1[a, b]. For our linear functionals, we can simplify by taking the λ inside the integral sign and obtain b 1 k... |
s order 1. Notice that this is one less than the power of the local truncation error, since when we look at the global error, we drop a power, and only have en ∼ h. Let’s try to get a little bit beyond Euler’s method. Definition (θ-method). For θ ∈ [0, 1], the θ-method is yn+1 = yn + h θf (tn, yn) + (1 − θ)f (tn+1, yn+1... |
rical Analysis Note that in general, {k}ν =1 have to be solved for, since they are defined in terms of one another. However, for certain choices of parameters, we can make this an explicit method. This makes it easier to compute, but we would have lost some accuracy and flexibility. Unlike all the other methods we’ve see... |
erscripts, and have y(tn+1) − yAB y(tn+1) − yTR n+1 cABh3y(tn) n+1 cTRh3y(tn) y(tn+1) − yTR We can now eliminate some terms to obtain −cTR cAB − cTR In this case, the constant we have is 1 6 . So we can estimate the local truncation error for the trapezoidal rule, without knowing the value of y. We can then use this to... |
erse of A if it is non-singular. In particular, solving Axj = ej gives the jth column of A−1. Note that we are solving the system for the same A for each j. So we only have to perform the LU factorization once, and then solve n different equations. So in total we need O(n3) operations. However, we still have the problem... |
zers are solutions to (AT A)x = AT b. The matrix A being full rank means y = 0 ∈ Rn implies Ay = 0 ∈ Rm. Hence AT A ∈ Rn×n is positive definite (and in particular non-singular), since xT AT Ax = (Ax)T (Ax) = Ax2 > 0 for x = 0. So we can invert AT A and find a unique solution x. Now to find the minimizing x∗, we need to so... |
· · · , am)t, γ = m j=k a2 j , we find that Now we have Hua = (a1, · · · , ak−1, ±γ, 0, · · · , 0)T . Hk · · · H1A = , 0 k and Hk did not alter the first k − 1 rows and columns of Hk−1 · · · H1A. There is one thing we have to decide on — which sign to pick. As mentioned, these do not matter in pure mathematics, but with... |
200y==()0,0()3fxx=x()3fxx=()3fxx=(),−(),−()0,0()3fxx=30x=300x==0x=300y==()0,0−−−−−−−−xy−−−−−−−−xy 1.2 Graphs of Functions CA1-27 6. The Reciprocal Function: −2 −1 0 1 2 −1 undefined 1 Figure 1.2. 6 Reciprocal Function Domain: Range: Intercepts: none For the reciprocal function, , we ... |
asing on the interval , increasing once more on the interval , constant on the interval , and finally increasing once again on the interval . It is extremely important to notice that the behavior (increasing, decreasing, or constant) occurs on an interval on the x-axis. When we say that the function is increasing on , ... |
from the local extrema? 3. Compute the following function values for (a) (d) (b) (e) 4. Compute the following function values for (a) (d) (b) (e) (c) (f) (c) (f) In Exercises 5 – 16, sketch the graph of the given piecewise-defined function. 5. 7. 9. 11. 13. 6. 8. 10. 12. 14. ()25if39if335if3xxfxxxxx+−=−−−+(... |
s and reflections, do not change the shape of the original graph, only its position and orientation in the plane. Non-rigid transformations, which include scalings, change the shape of the graph. Both types of transformations may affect the domain and/or range of the function. Adding to, subtracting from, or multiplyin... |
ntal Shift Suppose is a function and is a constant. To graph , shift the graph of horizontally by adding to the x-coordinates of the points on the graph of . If is positive, the graph will shift to the right. If is negative, the graph will shift to the left. A horizontal shift is a rigid transformation that only affect... |
his results in a vertical scaling. If , this results in a vertical scaling and a reflection across the x-axis. 4. Add to the y-coordinates of the graph obtained in step 3. This results in a vertical shift. If is positive, the graph will shift up. If is negative, the graph will shift down. Example 1.3.11. Below is a com... |
tic expressions. • Combine functions through addition, subtraction, multiplication, and division. • Determine the domain of a function resulting from an arithmetic operation. • Find the difference quotient of a function. • Create a new function through composition of functions. • Find the domain of a composite function... |
nitionsince23substitute23forin2323223349fxxxxfxxffxffxfxxx=++=+==+=++=+ ()()ggx()()ggx CA1-90 Getting Started with Functions 6. We find an expression for by rewriting the function as 22 to get In the previous example, we found that while . In general, when we compose two functions, the order matters. Another observatio... |
ises 55 – 69, use the following table of function values to compute the indicated value, if it exists. −3 −2 −1 4 −2 2 0 0 −4 0 1 0 1 3 −3 2 4 1 3 −1 2 55. 58. 61. 64. 67. 56. 59. 62. 65. 68. 57. 60. 63. 66. 69. In Exercises 70 – 81, use the given pair of functions to find the following values, if they exist. (b) (e) (... |
following statements are equivalent. • • is invertible. is one-to-one. • The graph of passes the horizontal line test. We put this result to work in the next example. Example 1.5.2. Determine if the following functions are one-to-one in two ways: (a) analytically using Definition 1.13 and (b) graphically using the hori... |
ons CA1-117 Figure 1.5. 15 We now use our algorithm to find .28 We have . 2. We graph using transformations of the toolkit function . 28 Here, we use the Quadratic Formula to solve for y. We note that you can (and should!) also consider solving for y by completing the square. ()yjx=()1jx−()()()()()2222 from interchange... |
the discriminant of the quadratic equation is the quantity . By thinking about the consequences of taking the square root of the discriminant, along with the position of the discriminant in the Quadratic Formula, we have the following. Determining the Number of Real Solutions to a Quadratic Equation Let , , and be rea... |
xis of symmetry, and any x- or y-intercepts. Solution. We begin by noting that and so the parabola will open upwards. Next, we identify the x-coordinate of the vertex. Substituting into , we find the second coordinate of the vertex. From the vertex of , we see that the axis of symmetry is . To find the x-intercpts, we ... |
maximize profit. Be sure that your answer is reasonable in the context of the problem. ● Find the maximum profit. ● Find and interpret the zeros of . 33. The profit, in dollars, made by selling “I’d rather be a Sasquatch” t-shirts is , . 34. The profit, in dollars, made by selling bottles of 100% all-natural certified... |
the constant term is 0. 3. We start by rewriting so that it resembles the form given in Definition 2.4. f()121210nnnnfxaxaxaxaxa−−=+++++0na1nfnfnnaxfnaf0a()0fxa=00af()524325fxxxx=−+−()312gxxx=−()45xhx−=()()()()321232pxxxx=−−+()524325fxxxx=−+−54x5−()312gxxx=−x3x−x1−h 2.2 Graphs of Polynomials CA2-25 Since the highest... |
, as . The following table shows values of and values of for various input values of . ()=nfxax()nfxax=0an()yfx=0ax→−()fx→−x→()fx→0ax→−()fx→x→()fx→−0a0a()121210nnnnfxaxaxaxaxa−−=+++++0nnnyax=()345fxxx=−+f34xx→34x()fxx 2.2 Graphs of Polynomials CA2-33 As , the table shows us that . Our next example show... |
t? ()395fxxx=−+()4,3−−()0,1()2,3()31002fxxx=−+0.01x=0.1x=()32536fxxxx=−++1x=4x=LengthGirth130 inches+LengthGirth108 inches+x4xLengthGirth130 inches+=xVxP()325354525Pxxxx=−+−−010.07x()yPx= 2.2 Graphs of Polynomials CA2-41 43. While developing their newest game, Sasquatch Attack!, the makers of the PortaBoy revised t... |
ing powers of as . Second, since synthetic division is designed only for factors ()()()()pxdxqxrx=+()()325213xxx−+−()()382xx++()()325213xxx−+−()33−−=x 3| 5 2 0 1 15 39 117 5 13 3918 1−()251339qxxx=++()118rx=()()322521351339118xxxxx−+=−+++38x+2x+()22−=−2xx 2−−−−()224qxxx=−+()0rx=()()328224xxxx+=+−+axb+1a2481223xxx... |
ple 2.4.4. Find the real solutions to the equation . Solution. Finding the real solutions to is the same as finding the real solutions to . In other words, we are looking for the real zeros of . The constant term, , has factors and while has factors and . We find that the potential rational zeros are , , , and . Using ... |
? We have many examples of polynomials with no real zeros. Can there be polynomials with no zeros whatsoever? The answer to that last question is ‘No’, as long as the degree of the polynomial is at least one. The theorem that provides this answer is the Fundamental Theorem of Algebra. While the proof of the Fundamental... |
al and then completely factor it to linear and irreducible quadratic factors. 29. 31. 33. 30. 32. 34. In Exercises 35 – 50, find all zeros of the polynomial. 35. 37. 39. 40. 41. 42. 44. 46. 48. 49. 50. 36. 38. (Hint: is one of the zeros.) (Hint: is one of the zeros.) (Hint: is one of the zeros.) 43. 45. 47. (Hint: is o... |
ext view our solution graphically, while noting that a graphical solution is only an estimate. The solution of is all x-values where the graph of is either below the graph of or intersects it. Alternatively, we can look for the x-values where the graph of lies below the x-axis, , or intersects it. 19 We have to choose ... |
Determine the domain of a rational function. • Find the x- and y-intercepts for a rational function. • Identify vertical and horizontal asymptotes. • Graph irreducible rational functions with constant or first degree numerators and denominators of degree one. In this chapter, we study rational functions – functions tha... |
e denominator. If the degree of the numerator is greater than the degree of the denominator, the graph will not have a horizontal asymptote.7 We would like to develop a way of finding horizontal asymptotes without forming tables, as we did above. To develop a general rule, we use the fact that a polynomial’s end behavi... |
ter than one and numerators having the same or a lesser degree. In this section, we continue graphing rational functions by focusing on functions that have a denominator of degree greater than one. We limit our functions to those with a numerator that has the same degree, or a smaller degree, than the denominator. We f... |
test our graph by calculating points such as and . Using intuition to save calculation time when graphing is helpful, although in some cases plotting at least one additional point can prove useful. We end this section with an example in which we determine an equation of a rational function from its graph. Example 3.2.... |
by dividing by . Unlike the shortcut we have been using to find horizontal asymptotes, there is no recourse in finding slant asymptotes but to use long or synthetic division. We will demonstrate this in the first problem of the following example. Example 3.3.3. Identify the slant asymptote of the graph of the following... |
xfxxxx−−=−+()()()()()223323231xxrxxx−+=−+()211fxx=+()21xgxx=+()221xhxx=+()321xrxx=+ CA3-42 Rational Functions 3.4 Solving Rational Equations and Inequalities Learning Objectives • Solve rational equations. • Solve rational inequalities graphically. • Solve rational inequalities algebraically. In this section, we solve ... |
he zeros in the numerator and denominator of has multiplicity one. Thus, will change sign across each of these values, so we could determine all of the signs by finding the sign in only one interval. For the sign diagram, we place the x-values on the real number line, indicating the corresponding function values as zer... |
is a real number. If we cannot find the exact value of an exponential term, we can estimate it. For example, is just a bit more than 3 since . Using a calculator we get . What if the exponent is not a rational number, for example ? We will not formally define irrational exponents. However, since 2x23xpxxp()xfxb=bx3222... |
2x=23x=()82log43=()2212338824===3log854381=logbyyb3log814=4381=0yblogxbyxby==logbyx=xby=logbyx=xby= 4.1 Introduction to Exponential and Logarithmic Functions CA4-11 Example 4.1.5. Convert the following from logarithmic form to exponential form, or vice versa. 1. Solution. 2. 1. Converting from logarithmic form to exp... |
pain which is around 140 decibels? 75. The pH of a solution is a measure of its acidity or alkalinity. Specifically, where is the hydrogen ion concentration in moles per liter. A solution with a pH less than 7 is an acid, one with a pH greater than 7 is a base (alkaline) and a pH of 7 is regarded as neutral. (a) The h... |
235 100logxyz CA4-28 Solution. 1. We expand as follows. Exponential and Logarithmic Functions We find that , when expanded, is equivalent to . 2. In expanding , we begin by writing the cube root as the exponent . Finally, we have the expanded expression . Example 4.2.11. Use the properties of logarithms to write the fo... |
173log25x=−0.582x−273105x−=732log5x−=2log10x−2x−23100xxee+−=()22xxee=xue=()222xxeeu==()()2231003100250xxeeuuuu+−=+−=−+=2u=5u=−2xe=5xe=−50− invelnlrsen2ln proe2prtyxex==ln2x= 4.3 Exponential Equations and Functions CA4-37 Graphing Exponential Functions Exponential functions were first introduced and define... |
lutions: and . Check for : Left Side Right Side Left Side Check for : Left Side is not defined Right Side which is also not defined So is not a solution. The only solution is . ()ln1xfxx=+01xx+()1xrxx=+r1x=−0x=r()(),10,−−()22loglog11xx+−=()()2ln31ln2xxx−−=−()()2ln31ln2xxx−−=−loglogbbuvuv==()()()()222ln31ln231... |
.5. ()Ptt()()lnln1.060.02Ptt=+t()()()()()ln1.060.02ln1.060.020.02lnln1.060.021.06tttPttPtePteePte+=+===2018197048t=−=()()0.0248481.062.768Pe= 4.4 Logarithmic Equations and Functions CA4-53 4.4 Exercises 1. What type(s) of transformation(s), if any, affect the domain of a logarithmic function? 2. What type(s) of transf... |
ed becoming larger as , the number of compounding periods, increases. In fact, as , We see that the largest amount we can achieve through increasing the number of compounding periods is . Here, we say that interest is compounded continuously, and use the following formula. Continuously Compounded Interest Formula If a ... |
e amount A in the account as a function of the term of the investment t in years; (b) how much is in the account after 5 years, 10 years, 30 years and 35 years, rounding your answers to the nearest cent; (c) how long it will take the initial investment to double, rounding your answer to the nearest year. 3. $500 is inv... |
s as a function of time t in billions of years. Research this and other radiometric techniques and discuss the margins of error for various methods with your classmates. 31. Use the equation to show that where h is the half-life of the radioactive isotope. ()0.0512013.167tPte−=+()Pt()0P() 0ktAtAe=() 0ktAtAe=() 0ktAtAe=... |
Midpoint Formula: The midpoint M of the line segment connecting the points and is . 1x−xh−1h=23y+yk−23k=−()2,1,3hk=−2259r=53r=()()22310xy−++=()()22311xy−++=−()1,3−()2,4(),hk()0101,,221234,2217,22xxyyhk++=−++==()00,Pxy()11,Qxy0101,22xxyyM++=−−xy134r (),hk 2 5 ()1,3− ()2,4 CA5-10 Hooke... |
.3. We see that , so . Since , the focus will be to the right of the vertex and the parabola will open to the right. The distance from the vertex to the focus is , which means the focus is 3 units to the right of the vertex. If we start at the vertex, , and move 3 units to the right, we arrive at the focus, . The direc... |
If the equation does not represent a parabola, explain how the equation violates the definition of a parabola. 5. 7. 6. 8. In Exercises 9 – 16, find the vertex, the focus, and the directrix of the parabola. Graph the parabola. Include the endpoints of the latus rectum in your sketch. 9. 11. 13. 15. 10. 12. 14. 16. In E... |
d 3 units up and down from the center to arrive at points on the ellipse, as seen below on the left. Figure 5.4. 7 Figure 5.4. 8 Since we moved farther in the x-direction than in the y-direction, the major axis is the x-axis and the minor axis is the y-axis. The vertices are the points of intersection of the ellipse wi... |
ipse in terms of its foci. 2. What can be said about the symmetry of the graph of an ellipse with center at the origin and foci along the y-axis? In Exercises 3 – 8, write the equation in standard form if it represents an ellipse. If the equation does not represent an ellipse, explain how the equation violates the defi... |
2ybxa→x→ CA5-50 Hooked on Conics Now, as since as . Notice that the points and are on the asymptotes and , respectively. This justifies our earlier usage of as the points where the conjugate axis intersects the guide rectangle. The equation above is for a hyperbola whose center is the origin, and which opens to the l... |
layout of a hyperbolic cooling tower is shown below. The tower stands 179.6 meters tall. The diameter of the top is 72 meters. At their closest, the sides of the tower are 60 meters apart. Find the equation of the hyperbola that models the sides of the cooling tower. Assume that the center of the hyperbola is the origi... |
you of both the graphical meaning of a solution and the two basic analytic processes for finding solutions (substitution and elimination.) We build on these analytic processes to solve systems of nonlinear equations. In addition, it will be helpful to think about the graphs of equations in the nonlinear xyxy CA6-2 Sys... |
to one of the original equations. Here, we choose . 222244936xyxy+=+=222244936xyxy+=−=2x224xy=−()2222222493644936164936520xyyyyyy+=−+=−+==24y= 2y=y224xy+= CA6-8 Systems of Equations and Matrices The potential solutions are the ordered pairs and . We check each ordered pair algebraically; to be a solution it ... |
yxy+=−=222216111916xyyx+=−=22162xyxy+=−=2222144xyxy−=+=2222244xyxy+=+=()22222144xyxy−+=+=22251xyyx+=−=()222225310xyxy+=+−=32810yxyxx=+=−31055xxyxy−+=−=− 6.2 Systems of Linear Equations and Applications CA6-17 6.2 Systems of Linear Equations and Applications Learning Objective... |
on passing through the points , , and . Solution. Recall that a quadratic function has the form where . Our goal is to find , , and so that the three given points are on the graph of If is on the graph, then or . Since the point is also on the graph of then which gives us the equation . Lastly, the point being on the g... |
admits an equivalent system, seems silly. Our perspective will change as we begin solving systems using this methodology. The first example is a system we originally solved in Section 6.2: As we attempt to write this system in triangular form, we will mimic our moves in a matrix representation of the system. A matrix ... |
s. The following matrices are in row echelon form. Use Definition 6.4 to determine which of these matrices is/are also in reduced row echelon form. The only matrix that is not in reduced row echelon form is the second matrix. The second column of this matrix has a leading 1 in the second row, and a nonzero entry of 2 i... |
of matrix addition; just as the number 0 is the additive identity for real numbers, the matrix comprised of all 0’s does the same job for matrices. AB+AB234107A=−−145381B−=−−()()()()()231421341741534513140781087186AB−+−++=−+−−=+−−+−=−−−+−+−ABBA+=+ABABC()()ABC... |
may encode this system into the augmented matrix Recall that the entries to the left of the vertical line come from the coefficients of the variables in the system, while those on the right consist of the associated constants. For that reason, we may form the coefficient matrix , the variable matrix , and the constant... |
ution. Beginning with the matrix , we proceed with row operations, in an attempt to rewrite the matrix in reduced row echelon form. n×nAnAIA1nIA−A1223A−=−2AI2AI→12102301−−2R122RR−+→12100121−−1R212RR+→10320121−−13221A−−=−A3612A=2AI 6.5 Systems of Linear Equations: Matrix I... |
with the absolute value, but is useful in providing a quick, easy, method for denoting the determinant of a matrix. Finding the Determinant of a 2×2 Matrix While the definition will show up a bit later, to help us get started right away finding determinants, we introduce the following formula for finding determinants o... |
dbccd−==− aecfafceyabadbccd−==−0adbc−0abadbccd=−axbye+=cxdyf+=axbye+=cxdyf+=abAcd=0abadbccd=−=1x2x121223452xxxx−=+=−2351A−=12xXx=42B−= 1AA1xBA2x 2A 12143A−=− 25224A=−()det17A=() 1det2A=−() 2det24A=−()() 11det2det17AxA==−()() 22det24det17AxA==−224,1717−− CA6-76 Systems of E... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.