Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#151 Re: Help Me ! » Matrix powers.. » 2007-01-23 16:12:59

Dross wrote:

You can only have integer powers for a matrix...

This is slightly off topic from Neela's exact question, but there are ways to calculate square roots, logarithms, sines, etc. of matrices, based on how these operations act on the real numbers.

The easiest way to do this is when the matrix we wish to operate on is diagonalizable. Consider a matrix A such that A is diagonalizable, so that A = PDP[sup]-1[/sup] for appropriate matrices P and D (which I will assume you know how to determine from linear algebra... if not, feel free to ask how). We wish to find the square root of the matrix A, that is, a matrix A[sup]1/2[/sup] such that A[sup]1/2[/sup]A[sup]1/2[/sup] = A. Let D[sup]1/2[/sup] be the diagonal matrix consisting of the square roots of the eigenvalues of A. We claim that A[sup]1/2[/sup] = PD[sup]1/2[/sup]P[sup]-1[/sup]. To check that A[sup]1/2[/sup] has the desired property A[sup]1/2[/sup]A[sup]1/2[/sup] = A, we take A[sup]1/2[/sup]A[sup]1/2[/sup] = PD[sup]1/2[/sup]P[sup]-1[/sup]PD[sup]1/2[/sup]P[sup]-1[/sup] = PD[sup]1/2[/sup]D[sup]1/2[/sup]P[sup]-1[/sup] = PDP[sup]-1[/sup] = A (we have used the fact that P[sup]-1[/sup]P = I, XI = IX = X for any matrix X, and D[sup]1/2[/sup]D[sup]1/2[/sup] = diag(d[sub]i[/sub][sup]1/2[/sup]d[sub]i[/sub][sup]1/2[/sup]) = diag(d[sub]i[/sub], D). Then A[sup]1/2[/sup] = PD[sup]1/2[/sup]P[sup]-1[/sup] has the desired property, and we conclude A[sup]1/2[/sup] is the matrix version of a square root. Similarly, if A is diagonalizable, we have ln A = P ln D P[sup]-1[/sup], where ln D = diag(ln d[sub]i[/sub]).

If A is not diagonalizable, then one finds the Jordan canonical form of A and takes the square root/logarithm/sine/etc. of the Jordan blocks. This can be done for every square matrix, since every square matrix over the field C has a Jordan canonical form. We may write an r x r Jordan block J(λ) as λ(I + N(r)), where N(r) is the r x r matrix with 1's on the superdiagonal and 0's elsewhere. To calculate the square root/logarithm/sine/etc. of this block, we use a series expansion. Here is the logarithm for example:

Now you may argue that this series does not necessarily converge. However, N(r) is a nilpotent matrix of index r (this is easily verified by the reader wink), so that (N(r))[sup]mr[/sup] = 0 for integers m. We are then left with a finite number of terms.

Anyway, I just wanted to show a little interesting side of matrices. Chances are you probably will never use it; I have only seen such a concept on a Putnam exam, where it was asked whether the sine of a certain form of a matrix ever exists. It's fun to know about this though.

#152 Re: Euler Avenue » prove when a is a real number if a > 0 then 1/a > 0. » 2007-01-15 14:26:06

...however I do understand now; for any x ∈ R, x² > 0. You simply have x = 1/a. Your proof is fine.

#153 Re: Euler Avenue » prove when a is a real number if a > 0 then 1/a > 0. » 2007-01-15 14:23:09

Ricky wrote:

...Thus, a/a^2 > 0...

Are you really allowed to say that here though? It seems to me that all this does is assume 1/a² > 0, which is the same concept as assuming 1/a > 0. It looks like you are using the statement we need to prove to prove the statement, if you know what i mean... kind of like defining a word and using the word in your definition.

#154 Re: Euler Avenue » prove when a is a real number if a > 0 then 1/a > 0. » 2007-01-15 14:18:33

Consider this...

Since 1/a is the multiplicative inverse of a, it holds that a × 1/a = 1. Since a > 0, we have a positive number times the "unknown" status of 1/a equalling the positive number one. But a positive number must be multiplied by another positive number for the product to also be positive, so it must be that 1/a > 0.

#155 Re: Euler Avenue » About this forum » 2007-01-14 16:09:30

I was just wondering exactly what chatalot was whating about.

#156 Re: Euler Avenue » About this forum » 2007-01-13 23:05:58

chatalot wrote:
Zhylliolom wrote:

I would say pretty much anything beyond high school level.

What! eekfainteek

What what?

#157 Re: Euler Avenue » Inequalities » 2006-12-25 05:54:17

My phraseology may not be the best here, but you get the idea. The proof is easy indeed, I could do it in my head (which is my excuse for not having it as polished as possible here).

It is obvious that for any given natural numbers m and n, either

or

is true, since √2 is irrational and therefore cannot be equal to a rational number, and thus the result follows from trichotomy.

Now consider the inequality

where the ? denotes the unknown direction of the inequality. Since m and n are natural numbers, their sum is nonzero and positive, and thus we may multiply each side my m + n without reversing the inequality:

Once again, n is a natural number and thus is nonzero and positive, so we may divide each side by n and maintain the direction of the inequality:

Now subtract m/n and √2 from each side to obtain

which gives (after dividing through by 1 - √2, flipping the inequality, rationalizing, then flipping again so that we now have the original direction (these steps are left to the reader as an exercise))

which gives the direction of the inequality as the opposite of the "initial condition" m/n ¿ √2, where ¿ denotes the original (and opposite) inequality direction, so that if m/n < √2 then (m + 2n)/(m + n) > √2 or if m/n > √2 then (m + 2n)/(m + n) < √2.

Thus, either

or

is true for natural numbers m and n.

#158 Re: Jokes » The Mathematician, the Physicist, and the Engineer » 2006-12-13 13:26:10

I had an entertaining mechanics professor who could often refer to objects in a problem as spherical horses. For some reason it cracked me up. There's something special about a spherical horse drowning in glycerol while we do some fluid mechanics problems.

#159 Re: This is Cool » FLT DEMONSTRATION By Anthony.R.Brown » 2006-12-13 13:10:48

mathsyperson wrote:

To Zhylliolom, what's the difference between regular and irregular primes? I've never heard of them before, but they sound interesting. Also, why would proving FLT for all primes mean that's proved for all n? Proving it for n=3 and n=5 doesn't mean that it's proved for n=15, does it? Or does it?

A regular prime p does not divide the class number of the p[sup]th[/sup] cyclotomic field. That's a pretty rugged definition, so we can give another meaning of a regular prime: a prime p is a regular prime if and only if it does not divide the numerator of the first p - 3 Bernoulli numbers (I wrote about such numbers in my zeta function thread long ago; recall that the Bernoulli numbers are the coefficients generated in the sequence

or also given by the contour integral

The first few Bernoulli numbers are 1, -1/2, 16/, -1/30...). It is conjectured that the regular primes are rather dense in the set of primes. Anyway, it would be interesting to find a proof of the Bernoulli requirement for regularity of a prime, I may work on that later. Proving the density of the regular primes among the primes would be a feat as well (the conjectured proportion is e[sup]-1/2[/sup], if you are interested. I find density relations among sets of numbers pretty interesting myself).

Proving Fermat's Last Theorem for all primes will indeed prove it for all n. From the Fundamental Theorem of Arithmetic, we know that any number other than 1 has a (unique) prime factorization. So for some arbitrary n, we can find a prime p such that m*p = n for some integer m. Then

becomes

or

So as you can see, we could substitute

and we would once again have a form of Fermat's Last Theorem:

Then essentially it is only necessary to solve the problem for prime values of n.

#160 Re: Help Me ! » solve for x » 2006-12-13 12:38:56

log(2x + 1) ≠ log 2x + log 1.

You can simplify the right hand side using the following rules of logarithms:

b log a = log a[sup]b[/sup].
log a - log b = log(a/b).

Then when you have an expression on the right hand side that is in terms of a single logarithm, you can cancel out the logarithms:

log a = log b  =>  a = b.

So you will end up with 2x + 1 = something. I will leave it up to you to work out the details! Good luck.

#161 Re: This is Cool » FLT DEMONSTRATION By Anthony.R.Brown » 2006-12-13 08:42:02

You are correct that this is a demonstration. However, nothing has been proven; you have only shown a particular pattern in the cube numbers. Also, you have only considered the case n = 3 (which was already proven hundreds of years ago, and indeed the theorem is proved for n = 4 and all regular primes if we don't consider Wiles' approach. Then we only need to find a proof for all n that are irregular primes), which will not cover all possible n. Also, Fermat claimed to have a proof, not a mere demonstration.

#162 Re: This is Cool » The best result in all of mathematics » 2006-12-08 08:38:23

I must say

is my favorite as well, it is just so beautiful, displaying 5 of the most important numbers in mathematics, addition, multiplication, exponentiation, and equivalence. Also it is quite simple, which is a main factor in it being well-known.

Other results I am particularly fond of are

and

(of course taking the second expression too literally will give rise to dispute; it is actually an asymptotic relation)

Also the fact that

which shows that i[sup]i[/sup] is in fact a real number, is quite astonishing.

I enjoy infinite sums as well, but usually none stick out significantly from the rest. Here is Zhylliolom's identity for φ (please submit this one, don't forget to mention me wink):

(actually, I need to rederive my identity to make sure it is actually correct here, so wait on that!)

#163 Re: This is Cool » Nullity? » 2006-12-07 16:41:02

Yes, what upset me most was not his treatment of my faithful wife mathematics, but how he rushed to teach it to impressionable youngsters, who may have just had their lives ruined.

#164 Re: This is Cool » Nullity? » 2006-12-07 15:35:02

Hey guys look

Then

Therefore

It really works!!!!!!11!1!1cos² x + sin² x!1!!1!!1!


*most horrific disemboweling of a theory ever witnessed by mankind removed for the sake of the young ones on the forum*

Just read one of his papers and shake your head, I think it'll be enough for you.

http://www.bookofparagon.com/Mathematic … ineVII.pdf

shamedownswearrolleyes

#165 Re: Help Me ! » Right or Wrong » 2006-12-02 15:28:14

Did you write it as

If you did, that means "p OR not r". To say "p AND not r" in symbols you want to flip your "v" over:

#166 Re: Help Me ! » Help to start » 2006-12-02 15:22:00

Since the sample size is 11, you have to have 11 scores in your list. Since the minimum is 61, one of the scores in the list must be 61 and no other score may be lower than 61. Since the maximum is 100, one of the scores in the list must be 100, and no other score may be higher than 100. The mean score is the sum of all scores divided by the sample size. Then if we multiply the mean by the sample size we will know what the sum of the scores is. This value is 81*11 = 891.

We know that 61 and 100 must be in the list, as determined above. Then from the determined relation, we have a + b + c + d + e + f + g + h + i + j + k = 891 (where the letters a through k represent different test scores in the list). So we can say that j = 61 and k = 100 and subtract these values from each side to get a + b + c + d + e + f + g + h + i = 730. So now we have to find out a set of 9 remaining test scores such that the sum of the test scores is 730, when listed from least to greatest the 5th test score is 91 (since the median is 91), and the scores aren't less than 61 or greater than 100. From that last sentence we now know that one of these scores is 91, so we can say that i = 91 and subtract it from each side to get a + b + c + d + e + f + g + h = 639. Now we must be careful. Since the median was 91, four of these remaining scores must be less than 91 and four of them must be greater than 91. Any set of scores satisfying this and a + b + c + d + e + f + g + h = 639 will work then. These values may be found by "guessing": let the last four scores be 95 (which is greater than 91 so we can choose this). Then subtract these four 95's from each side to get a + b + c + d = 259. Now we must find four scores greater than 61 but less than 91 that sum up to 259. If 3 of these scores are 65 and one is 64, then we have 65 + 65 + 65 + 64 = 259, so these values work.

Then one list of test scores that would result in the statistics given is 61, 64, 65, 65, 65, 91, 95, 95, 95, 95, 100. Hopefully you could follow my reasoning somewhat. Also note that this isn't the only possible list, you can easily find others.

#167 Re: Help Me ! » limit question » 2006-12-02 14:58:53

If f is continuous at a value a in its domain, then indeed we have that

However, the case we are considering is different. In the limit

let us consider the limit at a point x = a, so that

We can make the substitution h = x - a so that we have

(Note how we now have x approaching a, which makes sense because h = x - a approaches 0 as x approaches a.)

Then let us define the function

so that

Now, can we just say that

The answer is no. Why is this? We can see why if we note that g is not continuous at x = a, since

which is undefined. (To see why, assume 0/0 equals some number c. Then multiply each side by zero to get 0 = 0 * c. But this property holds for every number, so c = 0/0 cannot be defined.)

This would certaintly be a trouble then, since for ANY f(x), g(a) is undefined, and yet if we expand the limit and simplify, we can get an answer (for example with f(x) = x², the limit is 2x). Hopefully you can understand then why we cannot directly substitute h = 0 into the limit, since there does not exist continuity at h = 0.

#168 Euler Avenue » 67th Annual William Lowell Putnam Competition » 2006-12-02 11:51:27

Zhylliolom
Replies: 4

Did anyone else take the Putnam exam today? I suppose I will await for a confirmation before I waste my breath talking about it, so let's wait and see if anyone did.

NOTE: We will not talk about individual problems until Sunday evening at the earliest, to be "safe".

#169 Re: Help Me ! » show that » 2006-11-30 13:29:05

And also a word of advice: It looks like in your attempt at the identity I solved for you that you were working with both sides of the equation (multiplying each side by sin θ, for example). Usually, you're best off to stick with one side of the identity (in most cases the uglier looking side) and try to make it look like the other side.

#170 Re: Help Me ! » show that » 2006-11-30 13:26:08

There's another "rule" that you don't have up there that helps solve this one: sec² θ - tan² θ = 1. Watch how it solves the problem:


#171 Re: Help Me ! » more than one way ... » 2006-11-27 20:52:20

For an arbitrarily complicated function (so that we may not be able to analytically find exact roots), a 'calculus way' to find the (approximate, in most cases) roots of the function is Newton's method. From an initial guess at the root x[sub]1[/sub], we may take successive approximations of the form x[sub]n+1[/sub] = x[sub]n[/sub] - f(x[sub]n[/sub])/f'(x[sub]n[/sub]). If the root is r, then

#172 Re: Help Me ! » more than one way ... » 2006-11-27 19:40:01

The calculus method should provide some insight into the problem. Define the function f(x) := 3[sup]x[/sup] - 2[sup]x+1[/sup] - 1. The zeros of this function will correspond to solutions to your problem. By your inspection already, we know that x = 2 is a zero. Now our goal is to see if any other zeros exist. First, find the extrema of the function. Taking the derivative, we have f'(x) = 3[sup]x[/sup]ln 3 - 2[sup]x[/sup]2 ln 2. Setting the derivative equal to zero, we find that at the extreme values 3[sup]x[/sup]ln 3 = 2[sup]x[/sup]2 ln 2. Take the natural logarithm of both sides and solve for x to get x = (ln(2 ln 2) - ln(ln 3))/(ln 3 - ln 2) ≈ 0.5736. So there is only one extreme value for this function, and it is a minimum (I leave it to you to test that it is indeed a minimum). Now investigate the end behavior of the function: will it ever cross the x-axis again? There are no other maximums or minimums, so we know that f(x) can't jump above the x-axis and then under it (or vice-versa). So let us look at what happens to the function as x approaches -∞ and also when x approaches +∞.

What does this tell us? We know that f(x) is negative around values such that x < 2. The minimum of f, ~f(0.5736) was also a negative value. Then as x gets increasingly smaller f(x) approaches -1; this tells us that f(x) will never cross the x-axis as x -> -∞. Why is this? If f(x) went above the x-axis for some very negative value of x, then it would need to once again go below it so that as x -> -∞ f(x) -> -1. But this would require f(x) to have a maximum somewhere, which it does not. Likewise, we know that f(x) is positive around values such that x > 2. The limit tells us that f(x) will just get bigger and bigger in that direction. So for a zero to exist past 2, f(x) would need to dive below the x-axis and then rise back up towards ∞ in the limit, which would create a maximum and a minimum. But once again, we know that f(x) only has one minimum and this minimum has already been determined. From this evidence, we may conclude that f(x) has only one zero, at x = 2, and thus the equation 3[sup]n[/sup] = 2[sup]n+1[/sup] + 1 only has the solution n = 2.

#173 Re: Help Me ! » 1/pi » 2006-11-21 11:12:12

I like to pronounce it Γ-²(½).

#174 Re: Puzzles and Games » How Low Can You Go? » 2006-11-08 09:56:39

Interesting and reasonable, All_Is_Number.

My friend, who is an internet legend, claimed to get 0.999, but the server conveniently was "having trouble," as you guys mentioned sometimes happened, and thus his score wasn't recorded. I've seen him type many times and he is insanely fast, but the alphabet in one second seems pretty extraordinary.

#175 Re: Help Me ! » Is this true?? » 2006-11-06 08:21:33

If a = b, then a - b = 0, and division by zero is not valid here.

Board footer

Powered by FluxBB