You are not logged in.
DRASTIC ?
What means that?
Which Image?
If it's some kind of a graph of a function, then it should be Mathematica.
I've posted Maple images only 1 ro 2 times.
for nothing.
Some links:
Mathematica Wikipedia (I like this description):
http://en.wikipedia.org/wiki/Mathematica
Maple (currently the bigger competitior):
http://en.wikipedia.org/wiki/Maple_comp … bra_system
A list:
http://en.wikipedia.org/wiki/List_of_co … ra_systems
Nope.
It would be cool if it was.
I have it as a kind of present. It helps me much for some problems.
But there exist many free math programs - I've had a link somewhere - and some of them are even better than mathematica in some cases.
It can be solved. But one of you variables(or maybe more) will be "floating" - that means, that it can be every element of some domain, and the other variables will depend of it.
Or more general:
well for c program you can just use simple looping concept
like
sum=0;
for(i=n;i>=0;i--)
{
sum=sum+pow(x,i);
}
isn't it simple?
is that helped you or you did it in another way?
Yep. But maths helps better, because we know:
double sum(double x, int n){
return (pow(x,n+1)-1)/(x-1)
}
(and more efficient, too)
how can it be sure as s^2t itself is multiple of 7, i think atleast it should be s^4t.
No I haven't.
this doesn't depend of n. Using Pingenhole proncipe, my sum ends with b+1 balls, because it's thoughtless to go further.
I used something like this - I'm cuonting all the possible combinatins with k balls and computing the probability to make a combination of k balls, multyplying them, and summazing for all k form 2 balls to b+1 balls. This gives me the aritmetic mean of the wheighted elements in the list, so the expected number of balls. It's tricky to understand, that the probability to get a combination with mare balls is less than the probability to get a combination with less balls.
And, as you can see from the picture above, the formula works!
yep. What kind if relation are you looking for?
Nope. We're sure only for 7/s^t.
So 7^2/(s^t)^2 = s^2t, option 1
I don't like this kind of question.
They make me feel the author could have posted them just to "test" us.
Sorry for the ten posts.
Now - a little break
Now, I cannot find closed form for this sum. Mathematica gave me:
That I call cool!
GOOD QUESTION!
I'll post pictures soon.
[EDIT] Plot posted.
I founded it at least!
I had to leave my original function, because the omega function became so complicated.
I used another approach, which is hard to explain, and now I have a formula, which agrees with the experimental results:
First, I defined a function, S:
Back to work.
For better understanding of the Omega function, I'll try to find its values for small number of bins using brute-force
I like it this way:
This gives a polynomial of degree n, so your program should have complexity:
It basically means that if √2 is a rational, than there exist integers a,b, (a,b)=1, such that a^2=2b^2, so 2/a^2, but 2 is prime, so 4/a^2. But then 2/b^2, so 2/b, and we ,have 2/a and 2/b ,so (a,b)>=2, which is contradiction.
More clever than Krassi? This may be dangerous.
Edit: Congratulations on post 1600, Krassi!
Thank you, zhyllioly!
In my opinion the intuition and the knowledge are the most important.
If you don't have intuition, it will be hard to develop alone.
If you don't have knowledges, you'll waste your time end intuition on subjects, already discovered, instead of learning them.
Let
Or, it just isn't a question:
a power r<1
a power (r*s)>0compare
option A : s and option B: 0
which is greater .
It doesn't end with question mark