You are not logged in.
I think you make a word misguidance, Ricky. Bounded below zero seems to imply that the bound is some number negative. Should it be bounded above zero?
Also you should prove that 0 is the maximum of all bounds possible including -1,-0.5 and so on.
With this proof added, you can say that the series convergent to 0.
To Mikau's question, intermediate position not possible, for any of your position like 0.000001 is just a good candidate of ∈, hence sufficient large Ns will garantee it is always going away from it.
I have another proof on decreasing distance to show it. but since it's invented by myself and not a textbook I've ever seen have adopteditI would like to see Ricky's proof first to know if main stream maths has already got a solution.
___________________________________
It's my mistake to use a blablabla without specification.
My ... actually mean the moving series. like {0.9, 0.99, 0.999...} type.
I don't accept "all" number digits is 9 concept because this "all" involves reached infinity.
Induction proof is just like a zip. you set the mover right at the begining, and the mover slip one by one(two by two), you should anticipate that anywhere will be covered and closed finally.
No, england is rubbish and it has been for the last 40 years...
I heard the most pitfall of an England player now is that they cannot long pass the ball to his partner with precision. Or else they would be very mighty.
I still believe the German player Klose knee attacked the Agentina goal keeper to bring him down.
Italian players played so well at the last penalties for they are technical instead of physical.
What did Materrazzi say?????
Hey you guys are discussing something too difficult here!
Though I read it too.
Mathsisfun is good at fun maths and perhaps he is the best person you can consult to.
Fourier series are so difficult.
By the way, do you know what are cosh(x) and sinh(x) used for, Zhylliolom ?
Franklin's answer is correct. But I guess heldensheld1 you should pick up a geometry book and check some theorems before simple calculation
for Q2, just apply relative distance and relative speed( rad) concepts. Of course you need to figure out the original speeds of two needles first.
for Q4, set the amount of remaining questions to be x.
try hard! Good luck!
Great I can understand #3, and #4 both.
If you need to get a result in emergency.
try this
x(rad)=180°x/Pi
You are welcome
above 1 stdev above mean?
you should check out the equavalent probabilty distribution of a normal curve after 1.
∫N(0,1)dx from 1 to+∞
or 1-CDF(1) (1-Phi(1))
gross answer is 5%
Since probability within one sigma is 90%. And shorter than 138 share the same half with the taller than 162 ones.
Probably it's not the language barrier, Ricky.
If a Real or Reached Infinity does not exist or is not valid.
0.999...!=1
and any sum of series is invalid, like the form of
1+1/2+1/4+1/8+...=2
Or "=" here is not in usual sense and it's an "imaginary" equating.
Simply put, to mikau, do not use an independent, non-variable infinity or infinitesimal at first and that will save you from lots of faults.
Never mind, I'm eager to do some homework, as long as they are not so boring. Because I practiced too little and I need a bit more experience.
They are complex primary school questions, or Mathematic Olympic questions.
Heldensheld, do you know the concept of "Catching Problems" or x? Question 2 and 4 are just this type.
I mean the Real Infinity concept can only be "used" after Approaching method. Without approaching, equating approaching with being can cause fault.
As we discussed earlier, Ricky, the being is the part inferring approaching to be being after the approaching proof, always.
As I always claim, using the concept of Real Infinity is using guessing instead of logic, and self-defeating.
45-36=9 he is 9 points above mean.
9/6=1.5 he is 1.5 times of stdev above mean.
And this should always holds, regardless of the value of mean or stdev.
Why?
Suppose you can add all scores with 2 points, his will remain 9 points ahead.
Suppose you can multiply all scores by 2, his will be 18 points above mean, still 1.5 times of stdev.
Suppose he does as well as in the former test, he will still get a score 1.5 times of stdev above mean. This time, mean=100, stdev=15, he will get 122 or 123.
Great! A foot ball!
He isn't delagating his homework. He's trying to challenge our IQ.
Here is my answer, Heldensheld.
1) N+17=N+2+15 3 divides N+17
2N-1=2(N+17)-35 if the N+17 is not divisible by 7, so is the right side of the equition, so is the left side. The counter and averse statement is also true that if the left side is divisible by 7, so is N+17. 7divides 2N-1, hence it also divides N+17, therefore altogether N+17 is divisible by 3*7
2) 30/(11/12)=12.72727...min
3) 2.4
4) if he get the 9 questions he answered correct definately, 30 questions
About the error I guess your book uses a limit proof. A limit proof itself implies locally being virturely the same- the numerator ( the error) is little enough to match the little denominator (x displacement), before both getting zero. So your book may give after the proof an example evaluating f(a+0.m) by macluarin series of f starting from a.
Here macluarin series play(s) a more accurate role than the derivative approach to approximate the value of a function near some point. And this role is regardless of convergence or divergence.
A more powerful application of macluarin series is to evaluate some function at any point, at any distance from the original point or critical point. For example to calculate Sin(10) from knowing taylor series of it. But this application requires the series to be convergent. Or simply put the taylor series from 0 at 10 should not goes to infinity when more and more terms are added. Our calculators use this application. And they may deal with tangents by equating them with sines devided by cosines, to avoid divergence of tan(x) taylor .
Yes the taylor of sine is very interesting, and you give a nice proof of how many times it would turn. Nice proof! I haven't investigated it though I saw the same miracle on a software.
just find "mode" button and press it.
#5 right
(x+y)[sup]n[/sup]= [sub]n[/sub]C[sub]0[/sub]x[sup]n[/sup] +[sub]n[/sub]C[sub]1[/sub]x[sup]n-1[/sup]y +...+[sub]n[/sub]C[sub]n[/sub]y[sup]n[/sup]
let x=1 and y=1
2[sup]n[/sup]= the sum you want
Good Job, Mikau!
Well I guess we really have something in common. I self-studied calculus too. As I'm a helic believing proving instead of just trusting as you, I read many books and spent a good sum of time on that subject.
The proof on my book was complex, but I find something core- that is the polynomial should share from 0th derivative (the function value), then 1st derivative, ...,until nth derivative at the critical point with the function that it approximates.
This rule gives out 0!, 1!, 2!...n! coefficient.
On how well it approximates the function, I've no idea. And I'm very doubtful because Taylor Polynomials do not always converge.
2520 is found on an Ancient Egyptian temple. Archaeologists infer that Ancient Egyptians were so good at math!
for 2520 can divide 1 to 10 and is the smallest natural number who could do this.
Luckily S[sub]1[/sub]=0 and S[sub]2[/sub]=1 satisfy this formula too.
for example
0,1,1,2,3,5,8,13,21,34
S[sub]10[/sub]=34 here
and using the formula approximation
(1.618[sup]9[/sup]+0.618[sup]9[/sup])/√5=33.99
for n a large number
S[sub]n[/sub]≈Golden Ratio[sup]n-1[/sup] /√5,
This could explain why
S[sub]n[/sub]/S[sub]n-1[/sub]≈Golden Ratio
On fibonacci series: to get a general formula for S[sub]n[/sub]
since the coefficient for S[sub]n-1[/sub] and S[sub]n-2[/sub] are 1, l and k should satisfy:
we get l and k are
. Which is bigger? We can only leave this question here.On the other hand,
,since
and so on,The "bigger" question does not matter here, so we get the final formula: