User talk:Ohanian

From Wikipedia, the free encyclopedia

Hello and welcome to Wikipedia! Hope you like it here, and stick around.

Here are some tips to help you get started:

Good luck!

Meelar (talk) 08:05, Mar 28, 2005 (UTC)

Contents

[edit] More welcome

Welcome also to Wikipedia:WikiProject Mathematics. This page has good math resources, and a talk page where math-related topics are discussed. If you have not already done so, you can sign in your name at the list of participants.

Thank you for all your work to square root. Oleg Alexandrov 02:52, 15 May 2005 (UTC)

[edit] Mu

A correction: if a theist asks an atheist "Do you believe in the ideas of atheism" and the atheist says "no", the atheist is still an atheist (in the general sense) as long as he doesn't believe in the ideas of theism; if he says "no" he probably means that he's not a specific type of atheist, but he's still a nontheist in general as long as he doesn't believe in theism. Additionally, many atheists do consider explicit atheism a belief of some sort (even though it's also the rejection of a belief), so those ones would be perfectly fine answering "yes". There are better uses of the answer "mu" to questions (or "not"). And, of course, such a joke doesn't belong on the article page, being so non-noteworthy. Though thanks for sharing. -Silence 15:54, 5 October 2005 (UTC)

[edit] Ali Sina

Please see User_talk:Irishpunktom#Ali_Sina, where I explain why it can not be included in the article. The problem is that it is original research and can not be included as such. (In your edit summary you say that it's "evidence". But why is it evidence and according to who, except you and your research?) -- Karl Meier 09:00, 14 October 2005 (UTC)

[edit] Tim Priest

Thanks for submitting your article on Tim Priest, but Wikipedia cannot host copyrighted material, and so your article was deleted. The page you submitted was copied from here. If you would like to create an article on Priest without using the copyrighted content, then you are more than welcome to do so. --bainer (talk) 10:32, 14 December 2005 (UTC)

Thank you ;) Remember in future that all contributions must not violate any copyright. --bainer (talk) 10:37, 14 December 2005 (UTC)

[edit] calculating numerical value for binary logarithmn

could you please answer the questions on the talk page there? you removed a speedy delete notice, and the notice specifically says not to. I don't beleive you've satisfactorily asserted the why it should be kept . . . --He:ah? 07:03, 8 April 2006 (UTC)

Okay, well, uh, could i just request that you get some of the math people here to look at it, like find someone from the wiki-project or something? because it needs some clean-up- categories, an intro paragraph sort of explaining the what the heck it is, stuff like that. Especially a category. And that article is way out of my league when it comes to editing and whatnot . . . So just keep up the good work, try and get some help with turning it into a proper wikipedia article, and happy editing . . . --He:ah? 08:50, 10 April 2006 (UTC)

[edit] Numerical value of a Logarithm

A while back, you posted python code to find the logarithm of any value with any base at Logarithm. Unfortunatly, some of us (like me), don't understand python and aren't willing to learn, so we can't understand it. Could you please write why and how this program works (e.g., its algorithm).

Thank you, Lee S. Svoboda tɑk 19:24, 21 May 2006 (UTC)

Mostly unrelated: If you wanted something to put on your user page, you can put on a python user box

Sure which do you prefer? Pseudocode or C? Here it is in pseudocode

#
# Function in pseudocode
#
function log(float N,float X)
{  epsilon = 0.000000000001
   integer_value=0
   while (X < 1)
   {
      integer_value = integer_value - 1
      X = X * N
   }
   while (X >= N)
   {
      integer_value = integer_value + 1
      X = X / N
   }
   decfrac = 0.0
   partial = 0.5
   X=X*X
   while (partial > epsilon)
   {
      while (X >= N)
      {
         decfrac = decfrac + partial
         X = X / N
      }
      partial = partial / 2
      X=X*X
   }
   return (integer_value + decfrac)
}

Ohanian 01:15, 22 May 2006 (UTC)

[edit] Reference desk etiquette

In the post made by Kate about her hearing angels in dreams, other respondents were trying to suggest she see a psychiatrist in the most gentle and sympathetic manner, and I felt good about being among such company in WP - until I read your cruel response - of course she's ill - and you laugh at her? Adambrowne666 02:57, 26 August 2006 (UTC)

[edit] Request

Is it possible for me to receive HQ version of Cutie Honey cover you took picture of? I was just wondering. It is ok to refuse, and thanks for any input you'll put in. Dooly00000 (talk • contribs • count)

I'm sorry but I don't have the original anymore. Ohanian 12:56, 2 December 2006 (UTC)

[edit] Maths Competition

I'm thinking about starting a maths competition. One which any one can participate and any methods can be used in the competition including astrology, palmistry or numerology.

The objective is to estimate the true probability of obtaining "Head" on a bias coin. The true probability of obtain head with the bias coin can be expected range from 0.1 to 0.9 , in fact the coin toss is simulated by using a table of random numbers.

The procedure of the competition is as follows. The outcome of the coin toss would be annouced and each competitor would display their best estimate using all the knowledge they have obtained.

The full competition would ran for 40 rounds (thus involving 40 coin toss).

The winner would be the participant which has the lowest sum of error square.

A dummy run (of 3 rounds) is as follows: Assume that there are 3 competitors A, B and C.

The judge calls out "Head" and A displays "1.0", B displays "0.6", and C displays "0.5".
The judge calls out "Tail" and A displays "0.0", B displays "0.4", and C displays "0.4".
The judge calls out "Head" and A displays "0.7", B displays "0.7", and C displays "0.5".

The competition has ended and the judge announces the true probability of "Head" for the coin is 0.55 then the scores are calculated.

Coin Toss Actual value A's estimate A's error square B's estimate B's error square C's estimate C's error square
Head 0.55 1.0 0.2025 0.6 0.0025 0.5 0.0025
Tail 0.55 0.0 0.3025 0.4 0.0225 0.4 0.0225
Head 0.55 0.7 0.0225 0.7 0.0225 0.5 0.0025
Total 0.5275 Total 0.0475 Total 0.0275

The judge declares C the winner for having the smallest total of error square.

My question is this. If you want to win the competition, what is the best strategy and method for calculating the probability of "Head" in order to obtain the lowest possible error square score. Ohanian 01:31, 29 April 2007 (UTC)

[edit] 0.999...

Ohanian saids " I have a wonderfully elegant proof that .999... = 1 but this margin is too short for me to write it down, however I shall not be a Fermat person and WILL WRITE IT IN THIS DAMNED MARGIN anyway! "

Let U = \mbox{unity} = 1 \,
Let N = \mbox{nines} =0.999... \,

Proof by contradiction.

Assume that N \ne U. This means that there are only two cases that can follow.

CASE 1 : N > U

N > U\,
\downarrow
\sum _{k=1}^{\infty } \frac{9}{10^k} > 1
\downarrow
\frac{9}{10} + \frac{9}{100} + \frac{9}{1000} + ... > 1\,
\downarrow
Contradiction!!!

CASE 2 : N < U

N < U\,
\downarrow
U + N < U + U
\downarrow
U + N < 2U
\downarrow
(U + N) \cdot (U - N) < 2 U \cdot (U - N)
\downarrow
U^2 - N^2 < 2 U \cdot (1 - \sum _{k=1}^{\infty } \frac{9}{10^k})
\downarrow
U^2 - N^2 < 2 U \cdot (\lim_{k \to \infty} \frac{1}{10^k})
\downarrow
U^2 - N^2 < 2 \cdot \lim_{k \to \infty} \frac{1}{10^k}
\downarrow
U^2 < N^2 + 2 \cdot \lim_{k \to \infty} \frac{1}{10^k}
\downarrow
U^2 < N^2 + 2 \cdot \lim_{k \to \infty} \frac{1}{10^k} < N + 2 \cdot \lim_{k \to \infty} \frac{1}{10^k}
\downarrow
U^2 < N + 2 \cdot \lim_{k \to \infty} \frac{1}{10^k}
\downarrow
U < N + 2 \cdot \lim_{k \to \infty} \frac{1}{10^k}
\downarrow
\frac{U}{2} < \frac{N}{2} + \frac{2}{2} \cdot \lim_{k \to \infty} \frac{1}{10^k}
\downarrow
0.5 < 0.499...995 + 0.000...001
\downarrow
Contradiction!!!

Now since both CASE 1 and CASE 2 results in contradiction, the only conclusion we can come up with is that 0.999... = 1

I rest my case. Ohanian 01:01, 5 May 2007 (UTC)

[edit] Fair use rationale for Image:Cutey honey small.jpg

Thanks for uploading or contributing to Image:Cutey honey small.jpg. I notice the image page specifies that the image is being used under fair use but there is not a suitable explanation or rationale as to why each specific use in Wikipedia constitutes fair use. Please go to the image description page and edit it to include a fair use rationale.

If you have uploaded other fair use media, consider checking that you have specified the fair use rationale on those pages too. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. Ricky81682 (talk) 08:28, 26 October 2007 (UTC)

[edit] Fair use rationale for Image:Champion small.jpg

Thanks for uploading or contributing to Image:Champion small.jpg. I notice the image page specifies that the image is being used under fair use but there is not a suitable explanation or rationale as to why each specific use in Wikipedia constitutes fair use. Please go to the image description page and edit it to include a fair use rationale.

If you have uploaded other fair use media, consider checking that you have specified the fair use rationale on those pages too. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. Ricky81682 (talk) 08:29, 26 October 2007 (UTC)