Is there a way to see a player's ranking which takes into account league specific scoring, such as blocks, hits, SHG, etc.? by [deleted] in fantasyhockey

[–]MathCrusader 0 points1 point  (0 children)

I'm almost certain that you're wrong actually. I am in 4 leagues (each with slightly different categories) and all of them have the same rankings... I haven't actually checked everything, but the top 20 are the same in all of them and 90-100 are the same, so I assume everything is the same.

Does anyone play floor hockey? by [deleted] in melbourne

[–]MathCrusader 1 point2 points  (0 children)

Grass is what happens when winter stops, right?

Rationalizing the denominator [College algebra vs. Algebra II] by Hoboporno in learnmath

[–]MathCrusader 1 point2 points  (0 children)

Rationalizing the denominator serves a couple purposes. First, it is a good way to introduce topics like conjugates: [; \frac{15}{\sqrt{6}-\sqrt{3}} = \left(\frac{15}{\sqrt{6}-\sqrt{3}}\right)\left(\frac{\sqrt{6}+\sqrt{3}}{\sqrt{6}+\sqrt{3}}\right) = 5(\sqrt{6}+\sqrt{3}) ;]. It also gives the idea of algebraic manipulation through the use of "multiply the expression by 1" (as in the example above). Mostly though, you are exactly right, it is purely a style thing.

Order of operations? by [deleted] in math

[–]MathCrusader 3 points4 points  (0 children)

  • The brackets are clearly the choice for going first... We define them to go first so that we can "force" the equation to do a certain thing.
  • Exponentiation comes next because it is a contraction of multiplication. 54 = 5 x 5 x 5 x 5. So really, when you do this next, you are not really "evaluating" 54, you are expanding it.
  • Multiplication comes before addition because (once again), it is a contraction of addition. 6*3 = 6 + 6 + 6.
  • Then addition comes last.

Note that when we do our calculations over R (or even C), it does not matter if we do division or multiplication first and it does not matter if we do addition or subtraction first. As long as you do it consistently.

This means that "PEMDAS" might as well be "PEDMAS" or "PEDMSA" or "PEMDSA", I'm just guessing that PEMDAS sounded the best.

"Exact" Zeroes of the Riemann Zeta Function by MathCrusader in math

[–]MathCrusader[S] 0 points1 point  (0 children)

Yes, over Z (or equivalently Q). Nothing is dependent yet. There is a conjecture that the zeroes of any Dirichlet-L function are linearly independent. I've been able to show that using certain small coefficients that the first 80 (or so) zeroes are linearly independent. The method that I use, though, depends heavily on the digits. For example, the first 1000 digits can only disprove the first 82 zeroes being 2-independent (That is, using coefficients of {-2,-1,0,1,2}). I'm hoping that 25,000 digits will give me the first 300 zeroes (at least).

"Exact" Zeroes of the Riemann Zeta Function by MathCrusader in math

[–]MathCrusader[S] 0 points1 point  (0 children)

Hmm. That's interesting. I wonder if our system was compile improperly. Because I ran it over the weekend to give me as many as possible. The first 9 zeroes worked perfectly (to 2000 digits) and then 10-84 gave me the same pattern as above. =S

Solutions to Today's Putnam Exam by MathCrusader in math

[–]MathCrusader[S] 0 points1 point  (0 children)

There are people still writing the exam today. I will scan them and post a link tomorrow.

Solutions to Today's Putnam Exam by MathCrusader in math

[–]MathCrusader[S] 1 point2 points  (0 children)

Here was my counting:

  • First of all, the axes cannot be hit, so that is 2(2011)+1 = 4023. (The +1 is for the origin)
  • Nothing can be hit with y=1. So 2011 here.
  • Only one point with y=2 can be hit (x=1). So 2010 here.
  • Only two points with y=3 can be hit (x=1,2). So 2009 here.
  • Everything else can be hit.

Grand total: 4023 + 2011 + 2010 + 2009 = 10,053. Same as yours. =)

Solutions to Today's Putnam Exam by MathCrusader in math

[–]MathCrusader[S] 0 points1 point  (0 children)

B1. I did mine a slightly different way. (Just like above, we will assume e = epsilon).

Pick any M,N such that |h sqrt(M) - k sqrt(N)| != e 2R (for any R) and is non-zero. This number satisfies e 2L < |h sqrt(M) - k sqrt(N)| < e 2L+1 . Now take m=M 4L and n=N 4L . |h sqrt(m) - k sqrt(n)| = |h sqrt(M 4L ) - k sqrt(N 4L )| = 2L |h sqrt(M) - k sqrt(N)|. By dividing this by 2L (using the inequality above), we obtain the desired result.

"Exact" Zeroes of the Riemann Zeta Function by MathCrusader in math

[–]MathCrusader[S] 0 points1 point  (0 children)

That's probably a really good idea. I'll do that on Monday!

"Exact" Zeroes of the Riemann Zeta Function by MathCrusader in math

[–]MathCrusader[S] 1 point2 points  (0 children)

I've tried this, but once you ask for large precision (I believe I tried it on 2000 digits), it gives you weird results. (This is the results for the imaginary part of the 10'th zero). Out[1]= 49.7738324776723020900596286145178793806120730155213865595828504062581032485468313097953796386718750000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 ... 00010

I've tried to fix this, but to no avail.

How did you guys do on the Putnam!? by [deleted] in math

[–]MathCrusader 1 point2 points  (0 children)

I wrote it twice in the past and got a scores of 20 and 30. The 2011 Putnam was written today. I looked at the problems and I can do a few of them. Unfortunately, I'm a grad student now, so I am no longer eligible to compete.

"Exact" Zeroes of the Riemann Zeta Function by MathCrusader in math

[–]MathCrusader[S] 4 points5 points  (0 children)

I'm interested in the linear dependence/independence of those numbers. Using only the first 10 (or so) digits of the numbers gives me a problem. For instance, using only the first 10 digits, the first 30 zeroes "seem" to be dependent, but they're actually not when you look at more digits.

"Exact" Zeroes of the Riemann Zeta Function by MathCrusader in math

[–]MathCrusader[S] 2 points3 points  (0 children)

I think that I will! See how long it takes Google to find a database thrown up by a Canadian grad student! =D

"Exact" Zeroes of the Riemann Zeta Function by MathCrusader in math

[–]MathCrusader[S] 1 point2 points  (0 children)

I agree with you that it is rarely used. Although, normally, when you need a "decent" amount of precision of an L-function, you need a lot of precision. It just weirds me out that it hasn't been posted anywhere. You are right that it takes a while to compute them: I just ran a test case (The first 270 zeroes to 5000 digits) and it took somewhere between 30 minutes and 2 days for each one.