User talk:Sashafklein
Strangely, I dont see a welcome message here.. So here goes:
Welcome! (We can't say that loudly enough!)
Here are a few links you might find helpful:
- Be Bold!
- Don't let grumpy users scare you off
- Meet other new users
- Learn from others
- Play nicely with others
- Contribute, Contribute, Contribute!
- Tell us about you
You can sign your name on talk pages and votes by typing ~~~~; our software automatically converts it to your username and the date.
If you have any questions or problems, no matter what they are, leave me a message on [[User talk:{{{1}}}|my talk page]]. Or, please come to the New contributors' help page, where experienced Wikipedians can answer any queries you have! Or, you can just type {{helpme}}
on your user page, and someone will show up shortly to answer your questions.
We're so glad you're here! -- Lost 17:57, 26 July 2006 (UTC)
Re: Just a Question
[edit]Hi Sashafklein!
Sorry for the late response, I've been a little busy. Nikon is not really my forte (I'm a canon man!), but as a general guide I would advise to buy as good a lens as you can afford. Personally I would prefer buying one really good lens rather than three mediocre ones. That's just a personal taste, but if you want to become a more serious photographer I would advise you to do the same. Often your lens is the bottleneck of your camera. Poor lens and you can be shooting with the 1Ds MkII and get crummy photos. Also stay away from wide to extreme tele like 28-300mm. Unless they are expensive chances are they will be pretty crummy. I also strongly recommend a visit to Fredmiranda - you can get good reviews and advice there. Bokeh wise, if you are using a DSLR, you'll get good results from most lenses. For really good bokeh, get a lens which has a max aperture of f/2.8 or higher. Again you will get what you pay for.
Thanks a lot for the comments on my photos, stuff like that is what makes me keep going! Good luck and I hope to see you around with your new camera/len(s)! --Fir0002 12:52, 3 August 2006 (UTC)
TI-83 Riemann sum
[edit]Good day, Sashafklein. I'm in my school's library right now, and the bell's going to ring is 5 seconds, which means that I can't delineate, but there is a way to get a Riemann sum on a TI-83. I'll get back to you if you haven't figured it out yet. —The preceding unsigned comment was added by Gracenotes (talk • contribs) 18:19, 5 December 2006 (UTC).
NOTE: if you just want what to enter into your calculator, and not the derivation, skip to the last paragraph.
Hm, there goes the autosign bot again. (Gracenotes cowers in chagrin.) Well, I'm sorry that your teacher makes you use upper and lower Riemann sums instead of left and right, as you noted here. Just so you know, I believe that the AP Exam requires that you use left and right.
So, according to your post, you want to easily calculate the upper or lower Riemann sum on an interval for a given function. Your function name is , the interval is on , and you have a subinterval of . You have an enterable function for and real numbers for A, B, and ?
Here are a couple of basic functions you'll need: the function, which can be found by pressing [2nd] [STAT] (at LIST), under the OPS submenu at number 5. yields a list of numbers on screen. The first number is , the second is , the third is , and so on, so long as . ( is a whole number here. It just so happens to be .) From now on I'll assume that there are n equal subintervals, each with width
The function helps you tremendously. It takes any list, and sums up the contents. (Do you see where I'm going with this :) ?) For example, if you create list L1 (by going to [STAT] [Edit...]), you can sum up the contents by asking the calculator . The function is located at [2nd] [STAT] (at LIST), under the MATH submenu at number 5.
To calculate a left hand Reimann sum, type in
This will create a list , which is the Reinmann sum for f(x) on that interval. Then it sums it up. I'm sure that you can figure out how to do right hand and mid, from that. The trapezoid rule requires a bit more complication, but I have faith in you. :)
I need to show you two last functions before I answer your question. You know how the calculate the minimum or maximum value of a function, right? Enter a function into Y1, go to F4 ([2nd] [Trace]), click on 3 or 4, wait for the function to graph, enter your endpoints, and you get the max or min value. You can do this without graphing the function, with the functions fMin() and fMax(). Both are in the MATH menu. To get the X value which yields the maximum function value on a function on the interval from A to B, type . For the minimum value, use fMin instead. To actually get the the minimum function value, for example, type
The upper Reinmann sum: So to sum together the maximum values of on the interval <math[A,B]</math>, with equal subintervals of width , type
For the lower sum, use
That's all. No program required. The smaller gets, the more accurate, and the more time it'll take for your calc to do it. To begin with, even a simple calculation takes a LONG time. But better than doing it by hand, I suppose.
Example: calculate upper limit on sine function from 0 to pi with subinterval of pi/4? Try
I got 2.681512524. For the minimum I got 1.110731688. If yours is different, I may have done something wrong, or you didn't enter it right. Good luck, and happy calculating! (Thank goodness for the Fundamental Theorem of Calculus, though.)
And upper/lower sums are equivalent to left/right when the function has either a completely positive or completely negative derivative on the interval.
If you got this message, please respond to let me know you did. Thanks, and please contribute to Wikipedia!
Gracenotes T § 21:55, 5 December 2006 (UTC)
- Actually, the commands that I gave you only apply if the beginning of the subinterval is less than B. This may not be a desired result, you'd also want the end of the subinterval to be less than B. So the following will work for mathematical purposes:
- Or
- If you really don't care, I don't mind. :) At least I learned something. --Gracenotes T § 17:40, 6 December 2006 (UTC)
Image copyright problem with Image:Black_and_Tans.ogg
[edit]Thanks for uploading Image:Black_and_Tans.ogg. The image has been identified as not specifying the copyright status of the image, which is required by Wikipedia's policy on images. If you don't indicate the copyright status of the image on the image's description page, using an appropriate copyright tag, it may be deleted some time in the next seven days. If you have uploaded other images, please verify that you have provided copyright information for them as well.
For more information on using images, see the following pages:
This is an automated notice by OrphanBot. For assistance on the image use policy, see Wikipedia:Media copyright questions. 06:59, 13 December 2006 (UTC)
Merry Christmas!
[edit]
- Merry Christmas and Happy Holidays Sashafklein! | AndonicO Talk | Sign Here 01:04, 15 December 2006 (UTC)
Ref desk question: Israel in American Politics
[edit]I've removed this question of yours from the Humanities reference desk, while it's a great question to ask, the reference desk is probably not well equiped to answer it. You can still read all the responses to your question by following this link[1] to the page history, and you can comment on the question's removal here or at my talk page.—eric 02:16, 5 January 2007 (UTC)
Notification of automated file description generation
[edit]Your upload of File:Chinoise.jpg or contribution to its description is noted, and thanks (even if belatedly) for your contribution. In order to help make better use of the media, an attempt has been made by an automated process to identify and add certain information to the media's description page.
This notification is placed on your talk page because a bot has identified you either as the uploader of the file, or as a contributor to its metadata. It would be appreciated if you could carefully review the information the bot added. To opt out of these notifications, please follow the instructions here. Thanks! Message delivered by Theo's Little Bot (opt-out) 14:30, 28 April 2014 (UTC)