Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (anonymous):

3. Let \(\Large I_{n}\) be the equidistant partition of \(\Large I=[0,1]\) with \(\Large n \geq 2\) Intervals. Proof: a)\(\Large I_{n}\) is finer than \(\Large I_{m}\) if and only if \(\Large n\) is a multiple of \(\Large m\)

OpenStudy (anonymous):

If m=2 and n =4 then \[ I_m=\{[0,1/2],]1/2,1]\}\\ I_n=\{[0,1/4],]1/4,1/2],]1/2,3/4],]3/4 1]\}\\ \] Generalize this idea.

OpenStudy (anonymous):

ok Mr Elias, i write is like that on my file and then send to mentor, thank you very much, i think this homework contained a little strange questions, thank you very much

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!