I wanted to model a particular game and determine the probability for each team to win. I have no idea how to do the determination of probability part, but here's the game broken down:
There are 3 types of players, T's, D's and I's.
The amount of each type of player is as follows:
1/8 D...
Okay I understand better now. Sorry to put you through that and thanks for the clean up of my original argument (like pi - 1 rather than m).
As I explained before, any percent reduction 1/j where 0< j <pi hurts the cause of having the product of all the primes inverse being as small as...
I do not make the claim: at most 100 numbers should be left. I make the claim that you are removing at most 1/3 of the numbers remaining after removing numbers divisible by 2.
In the case where you are not removing the maximum allowed numbers from the list of unfactorable numbers (say for...
I'm not exactly sure how to say this but I'll try my best.
When pi is appended to the list of primes, it is not possible to remove the same number from the list of remaining unfactorable numbers multiple times. For example when 6 is removed from the list of remaining unfactorable numbers by...
So I thought up a "proof" for infinite primes. I'm assuming I did something wrong, but I don't know what, it would be nice if someone could tell me what I did wrong.
Suppose there are a finite number of primes of quantity n which are listed from smallest to largest in the list: p1, p2, ... ...
Thanks a lot for explaining that, there's something I don't understand though:
The integral equation evaluated at ##x=0## forces ##c=0##.
Why is c=0 forced? Why isn't it c=1?
Sn = ∑ni = 1 (Sn - i)-1
S0 = 1
I want to know how to find the general equation for Sn (An example of what I mean by "general equation" would be
Sn = ∑ni = 1i = n(n+1)/2).
Here's S0 though S5:
S0 = 1
S1 = 1
S2 = 1 + 1
S3 = 1 + 1 + 1/2
S4= 1 + 1 + 1/2 + 2/5
S5 = 1 + 1 + 1/2 + 2/5 +...
Hello! I want to know more ways to show the non-existence of the elementary function N(x).
Here's how N(x) is defined:
g(x) : Any elementary function.
N'(g(x)) = \frac{g(x)}{e^{N(g(x))}}
I've only thought of a single way to show this impossibility and it doesn't really develop my...
Something else that could possibly be used is:
\displaystyle\sum_{k=0}^{\lfloor log(n) \rfloor} \lfloor \frac{n}{10^k} \rfloor = \displaystyle\sum_{k=0}^{\lfloor log(n) \rfloor} \frac{n}{10^k} - \displaystyle\sum_{k=0}^{\lfloor log(n) \rfloor} \frac{n}{10^k} mod 1
Where mod represents...