text:
User talk:Rawan~enwikibooks

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 20:11, 30 November 2007 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Rawan. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Rawan~enwikibooks that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:40, 17 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 05:24, 19 April 2015 (UTC)

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: User talk:Rawan~enwikibooks


text:
MediaWiki:Deletereason-dropdown

 * Speedy deletion candidates
 * Requested by only significant contributors or authors blanked page
 * Requested by user in user space
 * Spam, vandalism, or nonsense
 * Test page. Please use the sandbox for experimenting with Wikibooks.
 * Abandoned material with intent and no development after 7 days
 * Talk page with no corresponding content page
 * Empty category
 * Orphaned, broken or unnecessary redirect
 * Other speedy deletion reasons
 * Please request undeletion instead of reposting deleted material
 * Inclusion criteria
 * Original works of fiction and literature are outside project scope
 * Original research belongs at Wikiversity
 * Non-linguistic books on Wikibooks English must be in the English language
 * Dictionaries and thesauruses belong at Wiktionary
 * Encyclopedic articles belong at Wikipedia
 * Source texts belong at Wikisource
 * News articles belong at Wikinews
 * Travel guides belong at Wikivoyage
 * Use a blog, forum, or personal website to share your personal opinions and thoughts instead
 * Wikibooks is not your personal web host or web space provider
 * Policy related
 * Consensus by community per requests for deletion
 * Use of copyrighted work without permission. Please read Terms of Use
 * Biased interpretation of the facts. Books must maintain a neutral point of view
 * Attack page

title: MediaWiki:Deletereason-dropdown


text:
User:Breakmode

Some thoughts

 * 1) Axiom Sets
 * 2) *Right now, there are no axioms listed in the book. Before we can provide any proofs, we have to have axioms somewhere that we can refer to.
 * 3) *The current table of contents is vague about where the axioms are going to go. I assume that we aren't forcing ourselves to define everything from within set theory? That we're going to start the other sections off with higher-level axioms?
 * 4) *When looking at any given theorem, the reader should be able to tell what axioms it follows from. For an example of this not happening, look at the Geometry page, which tentatively puts four different axiom sets all on the same chapter page/level. The page The Book of Mathematical Proofs/Geometry/Parallel Lines is placed in the box for Euclidean Geometry, but the page name does not reflect that. In addition, the other geometries will want pages about their parallel lines as well, causing naming conflicts.
 * 5) *As the axioms you start with determine what theorems you can prove, they are our most basic means of categorization. I suggest that the first level of the book's hierarchy, what we give links to in the table of contents, be groupings by Axiom Set instead of by Field of Mathematics, as is currently the case.
 * 6) **An alternate method would drop the Axiom Sets down a level: Geometry/Euclidean Geometry/Parallel Lines. I don't like this method as much because it makes the names longer, it doesn't provide any information that isn't redundant, and boundaries between fields can be hard to describe while the axioms must be exactly stated.
 * 7) **The table of contents' links to each Axiom Set can still be organized by branch: /TableOfContentsDemo
 * 8) Page Naming
 * 9) *I'd like to suggest we do number our theorems, and that each theorem, no matter how small, is given its own page named with its number. (Axiom Set/Theorem 1, Axiom Set/Theorem 2, Axiom Set/Axiom 1)
 * 10) * Proposed page layout: The_Book_of_Mathematical_Proofs/Template:Theorem
 * 11) *Once a theorem is written in the book, it is not just going to be used by the readers; it is going to be used in the proof of further theorems. We need to be able to easily refer to and link to any theorem (and its proof). The "this result depends on" box isn't a bad idea, but it can't be used in-line in the course of a proof. As well, it could be bothersome to have to always refer to nameless theorems by their complete statement. Within an Axiom Set, numbered theorems could be linked to as [T12]. If necessary, they can be linked to from other Axiom Sets as [AxiomSetName/T12]. Of course, any text, including a theorem's statement as part of a proof, could still be turned into a link to the numbered page.
 * 12) *Under the current subtopic page setup, each subtopic page is forced to hold a lot of information for each of the many theorems that will be on it. Individual pages for each theorem give definite spaces for all this information, and prevent the subtopic pages from becoming unwieldy to navigate.
 * 13) **Name. Some theorems are known by more than one name, some theorems have no proper name. The 'Known As' section of the theorem page layout can hold any number alternate names in its bulleted list.
 * 14) **Proofs. Some theorems can be proven in different ways. With each theorem on its own page, it can have as much space as it needs for alternate proofs.
 * 15) **About and See Also. I see the About section as something written in paragraph form, not limited to a list of facts presented as trivia.
 * 16) *Numbered theorems on individual pages encourage us to refer to the theorems we have already included, because there is a definite page to link to, and to include the theorems we want to refer to, because they are needed for the proof of another theorem we want to include, which cannot be entered out of order as it would mess up the numbering. (Compare this to a proof entered on a subtopic page as a block of text, where there is no guarantee that the support it uses has been included in the book yet.) Discussion of what theorems are needed before a certain theorem can be added could occur either on the Axiom Set's discussion page or perhaps on a separate "Requesting Proof" page.
 * 17) *That actual textbooks number their theorems for internal reference shows that this kind of thing can work, and won't be difficult for readers, especially with the subtopic pages still existing in some form to provide access by subject. I'd also like to see an Index section providing access by name, and the Axiom Set pages providing access by direct statement. More details on those in the next section.

Book Layout

 * The Book of Mathematical Proofs
 * Axiom Set
 * Axiom 1
 * Axiom 2
 * Definition 1
 * Definition 2
 * Theorem 1
 * Theorem 2
 * Topic Page
 * Topic Page
 * Axiom Set
 * Axiom Set
 * Index

Each set of axioms has its own chapter at The Book of Mathematical Proofs/Axiom Set. That page will use the following layout: User:Breakmode/AxiomSetPageLayout. There are 4 types of pages that will make up the Axiom Set chapter: Axiom pages, Definition pages, Theorem pages, and Topic pages. Each page in the chapter is linked to under the matching heading on The Book of Mathematical Proofs/Axiom Set.
 * Axiom and Definition pages use the following layout:The_Book_of_Mathematical_Proofs/Template:Axiom
 * Theorem pages uses the following layout: The_Book_of_Mathematical_Proofs/Template:Theorem
 * Axioms, Definitions, and Theorems will be numbered for reference within the book. The page names will use this numbering as well; Axiom 1, Definition 3, Theorem 12, etc. As seen on the sample layout pages, there is a "Known As" section where all alternate names for the theorem/axiom/definition will be listed.
 * The Topic pages are similar in function to the Branch/Subtopic pages currently in use. They do not have to prove the theorems, as that is done on the theorem page. Their purpose is to organize and present the theorems.
 * The Index provides access to pages by name (alphabetically), like those included in the "Known As" sections.

Theorem Page Layout
The_Book_of_Mathematical_Proofs/Template:Theorem

Axiom and Definition Page Layout
The_Book_of_Mathematical_Proofs/Template:Axiom

Axiom Set Page Layout
User:Breakmode/AxiomSetPageLayout

Getting Started

 * 1) Choose an Axiom Set
 * 2) *Create the axiom set page; The Book of Mathematical Proof/Axiom Set
 * 3) *Put a link to that page in the table of contents
 * 4) Determine the axioms
 * 5) *List the statements of the axioms in the appropriate section of Axiom Set. If you are unsure whether these are the proper axioms, in that they are generally referred to by the name "Axiom Set Name", you don't have to create the individual pages for them yet.
 * 6) *The Axiom Set discussion page can be used to discuss if these are the axioms the reader will expect to be referred to by the name Axiom Set. Citations from different sources showing the ways in which others state these axioms are encouraged.
 * 7) *Once the list and ordering of the axioms is decided, create one page Axiom Set/Axiom for each of them. At the very least, put the statement of this axiom as used on the Axiom Set page under the axiom page's Statement section.
 * 8) What follows directly?
 * 9) *To get activity started in the section:
 * 10) *Add any theorems that can be proven immediately. First, add the theorem's statement to the end of the numbered list in the Theorems section of the Axiom Set page. Then, create the page Axiom Set/Theorem to match its position in the list.
 * 11) *Use the Axiom Set Name discussion page if you need help writing the proof before you update the list and create the page.
 * 12) What are the theorems readers will expect to see?
 * 13) *To give us something to work towards, list on the discussion page:
 * 14) *Anything with a name, anything that people refer to a lot, anything other textbooks seem to think is important
 * 15) *Discuss the outline of a proof for it. What needs proven to prove this?
 * 16) *When the time comes, give it its own page.

Public Domain Math

 * MetaMath
 * The Elements of Euclid

title: User:Breakmode


text:
User talk:Breakmode

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 20:49, 30 November 2007 (UTC)

The Book of Mathematical Proofs/Template:Theorem
Hi there,

I'm wondering if this is supposed to be a template. Despite the name, it contains no template-like content. If it is going to be a template, it should be moved to the template namespace. Just click move at the top of the page, and put the new name as "Template:Theorem". If it's not going to be a template, it should probably get a more descriptive title. Feel free to come to my talk page with any questions. Happy editing! – Mike.lifeguard  | talk 15:05, 1 December 2007 (UTC)

title: User talk:Breakmode


text: User talk:64.140.181.126

title: User talk:64.140.181.126


text:
Talk:Python Programming/Variables and Strings

I just downloaded Python 2.5.1 and there's one thing: the input-function doesn't work the way you describe it. Pyhton states, that fish (my answer) is not defined. If I use raw_input instead it works.

 * I get the same thing (version 2.3.5). It works if I put quotation marks around the response. -- 77.100.119.107 14:51, 5 December 2007 (UTC)

This is due to a small confusion with this functions. input. When the user finish entering the input Python proceeds to evaluate the entered string. So number get evaluate into there proper value without the need to call the int. For user input is more appropriates to use raw_input since you we don't have to worry for error handling.

Style Guide
According to "PEP 8 -- Style Guide for Python Code" http://python.org/dev/peps/pep-0008/ section "Whitespace in Expressions and Statements", the preferred style is

print(lucky)

But you have

print (lucky)

or sometimes

print( lucky )

Personally, i find either of your styles more readable than the what the Guide says. So, what's the message here, ignore the Guide and use my own style? 174.6.64.79 (discuss) 14:44, 21 April 2011 (UTC)


text:
User talk:Dhani bux

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 20:56, 30 November 2007 (UTC)

title: User talk:Dhani bux


text:
User talk:Sam0310

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 20:58, 30 November 2007 (UTC)

title: User talk:Sam0310


text:
User:Mike.lifeguard/Deletion reasons

Speedy deletions

 * Generic (default):Per speedy deletion policy
 * Spam: spam
 * Junk: junk
 * No content (query): no content
 * Copyvio: copyright violation
 * Not needed after reorganization: not needed after reorganization
 * Vandalism: vandalism
 * no meaningful content, 7d with

Image reasons

 * nld>7d: nld>7d
 * bad fair use: invalid licensing
 * no rationale: no fair use rationale
 * unused fair use: unused fair use image

Inclusion criteria

 * Generic outside project scope: not a textbook
 * Webhost: Wikibooks is not your webhost
 * WB:NOR: no original research
 * No source texts:Source texts are outside project scope
 * Soapbox: outside project scope
 * Game guides: no game guides; use

title: User:Mike.lifeguard/Deletion reasons


text:
User:Mike.lifeguard/NewUserHelp

 * Starting your first book
 * Help:Starting a new page or book is a good resource. If you need specific help with something, ask at WB:HELP.

 * Reporting vandalism
 * Report vandalism in progress or in #wikibooks. Say   in IRC to get attention. You can fix most vandalism yourself because this is a wiki. Users who fight vandalism may ask for rollback access.

 * Why did you delete that?
 * Check the deletion log for the reason (read any linked pages for details). Read the deletion policy. Check the VFD archives if applicable. If that doesn't answer your question, then ask. If you want it undeleted, ask at WB:VFU.

 * What does mean?
 * This means that the page doesn't seem like the start of a textbook. Please leave a comment on the module's talk page if you are planning a textbook. If not, please replace with.

 * What do  or  mean?
 * All files uploaded to Wikibooks must have a license template and source; without that information, the upload will be deleted after 7 days. Please use to provide this required information. Fair use images must have a . To add templates, do not re-upload the image. You must edit the image description page directly, the same way you do for other pages - click the edit this page tab. Media has all the information you should need.

 * Contacting me
 * I've retired, so there's probably no need to do that.

title: User:Mike.lifeguard/NewUserHelp


text:
Talk:IB Chemistry/Human Biochemistry

So, why not just delete the material you found on the page you cited and leave the rest?

Ewen 22:49, 30 November 2007 (UTC)

title: Talk:IB Chemistry/Human Biochemistry


text:
Cookbook:Kedgeree (Rice and Smoked Fish)

| Cuisine of the United Kingdom

Kedgeree (or occasionally kitcherie, kitchari or kitchiri) is a dish consisting of flaked fish (usually smoked haddock), boiled rice, eggs and butter. It originated amongst the British colonials in India hence was introduced to the United Kingdom as a popular English breakfast in Victorian times, part of the then-fashionable Anglo-Indian cuisine. During that time, fish was often served for colonial breakfasts so that fish caught in the early morning could be eaten while it was still fresh. It is rarely eaten for breakfast now, but is still a popular dish.

Ingredients

 * 1–2 cups Basmati or long-grain white rice (see notes)
 * 2–4 cups decent quality low-sodium chicken stock
 * 1 bay leaf
 * 500 g (1 lb) smoked haddock
 * 3 medium shallots or 1 medium onion, chopped fairly fine
 * Liberal amounts of unsalted butter
 * As much garlic as you can handle, minced or put through a garlic press
 * 6 hard boiled eggs, chopped fairly fine
 * At least 3 tsp of prepared English mustard (1½ tsp of dry mustard)
 * Enough finely-chopped parsley or cilantro to add interest and colour
 * Fresh-ground pepper
 * Curry powder (optional)
 * Heavy cream
 * Salt

Procedure

 * 1) Cook the rice in one and a half the amount of chicken stock with the bay leaf. When it is done and keeping warm, discard the bay leaf, fluff the rice with chopsticks, and place the raw smoked haddock slab on top. Close the lid and let the haddock steam on warm for 15 minutes.
 * 2) Remove the haddock, and flake with forks to get rid of every last trace of bone. Place the haddock back with the rice.
 * 3) Sauté the shallots in excess butter until light brown. Add the garlic, and cook for 1 minute more, making sure to not brown it. Transfer mixture to the rice.
 * 4) Add the eggs, mustard, parsley, pepper, curry powder, and enough cream to make everything just slightly creamy. Mix it all up, gently and thoroughly (chopsticks are perfect for this). Season with salt to taste.
 * 5) Serve immediately or later—it keeps well.

Notes, tips, and variations

 * A rice cooker is not essential, but makes the whole thing brainless. 1 cup of rice will yield a dish that is dense with egg and haddock; 2 cups will give you a dish with a more Asian proportion of rice.
 * The addition of 3–4 cloves and a few cardamom seeds to the rice whilst it is cooking, plus the addition of a level teaspoon of cumin powder to the finished product, gives the rice a wonderful aroma.
 * Leftovers may be served in kedgeree omelettes with a dribble of soy sauce or Worcestershire sauce.
 * Haddock is traditional. Smoked anything can substitute it.
 * Cartoned organic stock is much superior, but home-made still beats all comers.


text:
User talk:BenFrantzDale~enwikibooks

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 23:17, 30 November 2007 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called BenFrantzDale. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name BenFrantzDale~enwikibooks that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:02, 17 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 04:37, 19 April 2015 (UTC)

title: User talk:BenFrantzDale~enwikibooks


text:
User:Mike.lifeguard/AboutMe

About me

 * Yes, my real name is Mike
 * Yes, I am a lifeguard
 * I have a bot account using pywikipediabot.
 * My original reason for coming to Wikibooks was to bring sanity to First Aid, which is now a featured book.
 * I've made a semi-canonical PDF version, but I haven't used it in any courses yet. It will be updated as I figure out what works and what doesn't.
 * I've put together Subject:First aid, which lists First Aid along with other stuff that deals with the subject
 * I've also started Wikijunior:Water Safety, which is currently on the backburner. I do intend to finish it eventually. Same goes for Sensory Neuroscience: Hearing and speech and Knots.
 * I've written an essay about integrity.
 * I am currently an admin, CheckUser and 'crat here, as well as other roles on Meta (and a few other wikis). Most recently, I was elected as a steward. Since this is one of my home wikis, I am not permitted to take action here as a steward.
 * My main tasks are currently keeping the cleanup backlogs just this side of the apocalypse. shows the tasks where non-admins can help with these backlogs.
 * My main challenges are vandalism (mostly bad page creation); keeping up with new page patrol and verifying media uploads; and copyvios (especially in the ).
 * If you are a vandal, you'll get one warning. If you're particularly vulgar, you won't even get that.
 * I have rather strong views on rights. If you need them, are trusted, and active, you should have them. You only need the tools while you meet those requirements - if you're no longer trusted, active, or don't need them you shouldn't have them.
 * is the correct reaction to removal of admin tools for inactivity.

title: User:Mike.lifeguard/AboutMe


text:
User:Mike.lifeguard/Toolbox

Toolbox
OP: (ar|de|en|fr|he|nl|no|pt|c|m) daylog|botnet || Contribs: (|||) || (||) || (block|log|list||) (check|log)

(|NPP|upload|DR|BR) (||||) || (||) || Admins: (|) ||

title: User:Mike.lifeguard/Toolbox


text:
User:Mike.lifeguard/Subpages

Subpages
1 | 2 | Header | UserboxesTop | NewUserHelp | Deletion reasons | Copyvio | AboutMe | Toolbox | MoreLinks | Project Welcome

monobook.css | monobook.js | (TSdev.js: bugs|docs)

title: User:Mike.lifeguard/Subpages


text:
User:Mike.lifeguard/MoreLinks

More links
Special:Prefixindex | Simple Subject: page | Sibling Subject: page |

Template messages | Icon | First Aid/What needs to be done? Wikipedia:Administrators' how-to guide | MediaWiki Administrator's Handbook | Using Wikibooks

title: User:Mike.lifeguard/MoreLinks


text: User talk:71.207.9.85

title: User talk:71.207.9.85


text:
User talk:12.216.198.143

Welcome!
Welcome to Wikibooks, a collection of open-content textbooks! You don't have to log in to read or edit articles on Wikibooks, but creating an account is quick, free and non-intrusive, requires no personal information, and gives you many benefits, including:
 * The use of a username of your choice
 * The ability to view all your contributions via a "My contributions" link
 * Your own user page
 * Your own talk page which, if you choose, also allows users to send you messages without knowing your e-mail address
 * The use of your own personal watchlist to which you can add articles that interest you
 * The ability to rename pages.
 * The ability to upload images
 * The ability to customize the appearance and behavior of the website
 * The eligibility to become an administrator
 * The right to be heard in votes and elections
 * Your IP address will no longer be visible to other users.

We hope that you choose to become a Wikibookian and create an account. Feel free to ask me any questions you may have on my talk page. By the way, make sure to sign your posts and comments with four tildes (~~~~), which will let others know who left it.

– Mike.lifeguard  | talk 01:06, 1 December 2007 (UTC)

title: User talk:12.216.198.143


text: Template:Scandinavian languages

title: Template:Scandinavian languages


text:
Icelandic

Contents

 * Innihald

 * /Cover/ (Forsíða)
 * /Introduction/ (Inngangur)
 * /Alphabet and Pronunciation/ (Stafróf og framburður)

Lessons

 * Hello (Halló!)
 * Do you speak English (Talarðu ensku?)
 * Apology (Þessi,sá,hinn)
 * Diary (dagbók)

Appendices

 * Viðaukar
 * /Grammar/Capitalization/ (Stórir bókstafir)
 * /Grammar/Nouns/ (Nafnorð)
 * /Grammar/Verbs/ (Sagnorð)
 * /Grammar/Irregular Verbs/ (Óregluleg sagnorð)
 * /Grammar/Adjectives/ (Lýsingarorð)
 * /Grammar/Adverbs/ (Atviksorð)
 * /Numbers/ (Töluorð)
 * /Common phrases/ (Algengar setningar)
 * /What time is it?/ (Hvað er klukkan?)

Authors

 * Höfundar

 * Girdi
 * Numberguy6 — Ég skrifaði lýsingarorða- og atviksorðasiðurnar.
 * Swift — Ég hef einungis raðað og yfirfarið en ekki bætt við miklu. Látið mig endilega vita ef ykkur langar að bæta við innihaldið og vantar félagsskap.

title: Icelandic


text:
User talk:Ciampix

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 02:00, 1 December 2007 (UTC)

title: User talk:Ciampix


text:
User talk:Dirac~enwikibooks

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 02:00, 1 December 2007 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Dirac. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Dirac~enwikibooks that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:10, 17 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 04:53, 19 April 2015 (UTC)

title: User talk:Dirac~enwikibooks


text:
User talk:Weijun~enwikibooks

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 02:01, 1 December 2007 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Weijun. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Weijun~enwikibooks that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:51, 17 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 05:38, 19 April 2015 (UTC)

title: User talk:Weijun~enwikibooks


text:
User talk:Admulholland

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 02:01, 1 December 2007 (UTC)

title: User talk:Admulholland


text: User talk:88.249.13.201

title: User talk:88.249.13.201


text: Template:Icelandic/Contents

title: Template:Icelandic/Contents


text:
Wikijunior:World War II/Winston Churchill

Winston Churchill was the British leader during most of World War II. He replaced Neville Chamberlain as Prime Minister in May 1940, nine months after Britain declared war on Germany.

Quick Facts

 * Born: 30 November 1874
 * Died: 24 January 1965
 * Leader of: Britain
 * 1940 to 1945 and again from 1951 to 1955
 * Full name: Sir Winston Leonard Spencer-Churchill
 * After the outbreak of the Second World War, Churchill was appointed First Lord of the Admiralty. Following the resignation of Neville Chamberlain in May 1940, he became Prime Minister of the United Kingdom and led Britain to victory against the Axis powers.

Joining the army
After leaving school, Churchill joined in the army in 1894. He served in a number of countries and fought in a number of battles and wars including Cuba, Sudan, India, South Africa and Egypt.

Becoming a politician and World War I
At the start of World War I, Churchill was "First Lord of the Admiralty" meaning he was in charge of what the Navy did. After a battle went badly wrong, he left this job and joined the army again. He showed a lot of courage and daring during the fighting.

Churchill's speeches
Churchill was known for making speeches that lifted people's spirits and gave them hope. He made three very famous speeches that are still well known. He made the first of these the day he became Prime Minister:

 * ...I have nothing to offer but blood, toil, tears and sweat. We have before us an ordeal of the most grievous kind. We have before us many, many long months of struggle and of suffering.

 * You ask, what is our aim? I can answer in one word: Victory. Victory at all costs — Victory in spite of all terror — Victory, however long and hard the road may be, for without victory there is no survival.

You can read his other famous speeches by following these links: "This was their finest hour" and "We shall fight on the beaches"

After the war
Although Churchill did a huge amount to win the war for Britain, he was still voted out as Prime Minister in 1945. This is thought to be because people wanted a change after six years of terrible fighting. For the next six years, Churchill was "Leader of the Opposition". Then in 1951 he became Prime Minister again.


text:
Computers & Society/Annotated Bibliography

B
Barrett, Cameron. “Anatomy of a Weblog.” Camworld. 26 Jan 1999. Link.

Blood, Rebecca. "The blogosphere: How blogging software reshapes the online community." ''Commun. ACM'' 47 (December 2004): 53-55. (/Blood 2004/). Weblogs are distinct from simple web pages because they allow commentary and often permit the audience to contribute ideas to the site. Blood discusses the importance of permalinks as a means of putting content into context. Finally, trackbacks allow weblogs to ping one another to place a reciprocal link and keep track of responses to comments. Software has enabled blogging with need of coding the entries.

Blood, Rebecca. The Weblog Handbook: Practical Advice on Creating and Maintaining Your Blog. Perseus Publications, 2002. (/Blood 2002/). As one of the first comprehensive looks at weblogs,  Blood's contribution to the academic scholarship is a solid one. From a  review of the history of blogging to explanations for the neophyte on how to   set up their own site, Blood's dedication to her craft shines clear. As a  frequently cited author, her new media research helped prepare bloggers to   engage their audiences with proper 'netiquette' and an engaging message.

Bolter, David Jay and Richard Gursin. Remediation: Understanding New Media. Cambridge: MIT Press, 1998.

Bush, Vannevar. “As We May Think.” Atlantic Monthly 176.1 (July 1945). Link.

D
Dawkins, Richard. The Selfish Gene. New York : Oxford University Press, 1976.

Delong, Brad. “Google and Larry Page.” Brad Delong’s Webjournal. 14 Feb 2003. Link.

E
Eisenstein, Elizabeth. The Printing Press as an Agent of Change. Cambridge: Cambridge University Press, 1979. Vol 1.

F
Farkas, Meredith G. Social Software in Libraries: Building Collaboration, Communication, and Community Online. Information Today, Inc., March 2007. This is a useful source for educators and librarians new to the Web 2.0 phenomena. It provides practical advice on how to use a variety of tools such as blogs, wikis, podcasting and gaming in academic settings. This book helps put the discussion of social software in proper perspective as way to encourage public collaboration and sharing of ideas. Farkas provides anecdotal evidence of the effectiveness of these new technologies.

G
Gillmor, Dan. “Google Buys Pyra: Blogging Goes Big-Time.” Silicon Valley. 15 Feb 2003. Link.

H
Herring, S. C., I. Kouper, J. C. Paolillo, L. A. Scheidt, M. Tyworth, P. Welsch, E. Wright, and Ning Yu. "Conversations in the Blogosphere: An Analysis "From the Bottom Up"." 2005, 107b-107b. Link. This research provides a cogent examination of blog communications research. While conversations occur frequently among a subset of users with common interests, the greater blogosphere expands and contracts as new works are added and others deleted. Popular blogs drive traffic to their sites while others selectively link to blogs who comment frequently on their pages.

Herring, Susan C., Lois A. Scheidt, Elijah Wright, and Sabrina Bonus. "Weblogs as a bridging genre." Information Technology & People 18 (February 2005): 142-171. Link. This study examines weblogs as an evolving genre of  computer-mediated communications. The research points to blogger's role in  constructing their interpretive community. The writer selects meaningful  content and creates an online audience for their research. Thus, blogging plays both public as well as private roles in the new media.

L
Landow, George. Hypertext 2.0. The Convergence of Contemporary Critical Theory and Technology. Baltimore: Johns Hopkins University Press, 1997. His second edition is a creative examination of the changes wrought by electronic authorship via hypertext. The audience of readers were at once capable of rewriting as well as remixing the text (fan fiction comes to mind). In cyberspace, writing was transformed into a participatory art form as the author's work was 'decentered' by a new consumptive aesthetic derived from popular culture.

M
McLuhan, Marshall. Understanding Media: The Extensions of Man. New York: McGraw-Hill, 1964. As the groundbreaking scholarly work that helped  redefine new media in the electronic age, McLuhan's explorations of 'hot" and   "cool media" helped define emergent modes of communication. As human beings   continue to grapple with tribal vs. collective interests, hypermedia provides   a ground for cultural exchange within the 'global village'. McLuhan   acknowledged the reciprocal relationship of people being shaped by the very   tools they create. Social software provides further proof of this concept.

MLA Ad Hoc Committee on the Future of Scholarly Publication. “The Future of Scholarly Publication.” Profession 2002. 172-186. Murray, Janet Horowitz. Hamlet on the Holodeck: The Future of Narrative in Cyberspace. New York: Free Press, 1997.

N
Nardi, Bonnie et al. "Blogging as social activity, or, would you let 900 million people read your diary?" Proc. of the 2004 ACM conference on Computer supported cooperative work, Chicago. 6-10 November, 2004. 222-231. Link. Nardi's ethnographic research on blogging as an  innovative epistemological genre which relates the individual with his social   world through permalinks, comments and trackbacks. She shows how this network  evolves depending on the depth and nature of the communicative interaction. Software which facilitates user accessibility affords greater opportunities  for bloggers.

Nielsen, Jakob. "Interface Standards and Design Creativity." UseIT.com. 22 Aug 1999.Link.

T
Turkle, Sherry. Life on the Screen: Identity in the Age of the Internet. New York: Simon and Schuster, 1995. (/Turkle 1995/). This study examines weblogs as an evolving genre of computer-mediated communications. The research points to blogger's role in constructing their interpretive community. The writer selects meaningful content and creates an online audience for their research. Thus, blogging plays both public as well as private roles in the new media.

W
Walker, David. “How David Siegel Joined the Nielsen Camp.” Shorewalker. [1998?] Link.


text:
User talk:Dennis G. Jerz~enwikibooks

Hello. I was just wondering what your module entitled Bush 1945 was supposed to be. If you're trying to make a citation, there are better ways to do it. You might want to look at Manual of Style, which has a section on footnotes and endnotes. Thanks, and welcome to Wikibooks. Gentgeen 07:09, 1 December 2007 (UTC)

Thanks for the comment. I'm not exactly making a citation to that article -- there is already a Wikipedia article for that source, and I plan to link to it. I'm trying to create a place where I and a group of other scholars will be able to post annotations of that article. Those annotations won't necessarily be neutral, and they are intended to be focused on the value of the article to researchers who are studying social software. But since the file naming conventions of Wikipedia are pretty strong, I may change that. It may also be that Wikibooks isn't the best home for this project -- I'm still experimenting with the possibilities. Dennis G. Jerz 07:19, 1 December 2007 (UTC)

Wikiversity, interwiki links
Hi Dennis G. Jerz. If I understand your project correctly, you really should be doing this on Wikiversity, not Wikibooks, since there are going to be both original research aspects and POV aspects (WV was created for this sort of thing). I can import your modules over if you like.

BTW, if you want to link to a Wikipedia article, you just put a "w:" inside the link before the article name, and a "|" after. For example, while Bubble gum will make a redlink to Bubble gum on Wikibooks (or Wikiversity), Bubble gum will create Bubble gum. -- SB_Johnny | PA! 10:25, 1 December 2007 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Dennis G. Jerz. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Dennis G. Jerz~enwikibooks that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:09, 17 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 04:52, 19 April 2015 (UTC)

title: User talk:Dennis G. Jerz~enwikibooks


text:
User:Dennis G. Jerz~enwikibooks

I am working on a test site: Social Software: An Annotated Bibliography.

title: User:Dennis G. Jerz~enwikibooks


text:
User:Danwills

 * 'help tending the wiki garden?

 * I'll try to weed out some unhelpful memes such as gender neutrality, and bad spelling. :)

title: User:Danwills


text:
User talk:Danwills

talkin' to yourself again? something you'd like to discuss?

go for it! :D

title: User talk:Danwills


text: User:VSEPR~enwikibooks

title: User:VSEPR~enwikibooks


text:
HSC Extension 1 and 2 Mathematics/Plane geometry; geometrical properties

Plane Geometry terms
A line : a straight line of infinite length.

Interval: a part of the line between two points.

Collinear points: lie on the same line.

Concurrent points: pass through the same point

Produced: to extend, continue an interval.

Altitude: perpendicular line from base to highest point of a figure.

Angles on a straight line
Add to 180°

Angles at a point
Add to 360º

Vertically opposite angles
Vertically opposite angles are equal.

Parallel lines
A pair of lines in the same plane that never meet.

A transversal is a line drawn across a pair (or more) of straight lines.

Special types of angles are formed when parallel lines are cut by a transversal. These include:

- Corresponding angles

- Alternate angles

- Co-interior angles (supplementary)

Angle sum of triangles
The interior angle sum of a triangle is 180 degrees.

Exterior angle properties
An exterior angle is the angle formed on the outside of the triangle. The exterior angle of a triangle is equal to the sum of its interior opposite angles.

Angles sum of a quadrilateral and of a general polygon
The angle sum of a quadrilateral is 360 degrees.

The angle sum of any general polygon = (n-2) x 180 degrees (where 'n' is the number of sides)

Sum of the exterior angles of a general polygon
The sum of the exterior angles of any general polygon is 360 degrees.

Congruence of triangles. Tests for congruence
Congruent triangles are triangles that have exactly the same shape and same size. There are four tests to test congruency of two triangles:

- SSS three sides equal to three sides of other triangle

- SAS two sides and one angle is equal to the other *Angle must be the angle between the two sides

- AAS two angles and a side are equal to the other *Side must be corresponding side i.e. same position on both triangles (this can be seen clearly by marking matching angles)

- RHS the hypotenuse and one side of a right-angled triangle are equal to the other right-angled triangle

Properties of special triangles and quadrilaterals. Tests for special quadrilaterals
Parallelogram: Opposite sides are parallel and equal, diagonals bisect one another.

Rhombus: All sides are equal and opposite sides are parallel and equal, opposite angles are equal, diagonals bisect one another and are perpendicular, diagonals bisect angles through which they pass.

Kite: Diagonals perpendicular

Rectangle: Opposite sides parallel and equal, diagonals are equal and bisect one another, all angles are right angles

Tests for special quadrilaterals

Tests are true when any ONE of the points listed are true.

Parallelogram: - opposite sides are equal - opposite angles are equal - opposite sides are parallel & equal - diagonals bisect one another

Rectangle: (a special type of parallelogram) - diagonals are equal

Rhombus: - all sides are equal - diagonals bisect each other at right angles

Properties of transversals to parallel lines
Ratio of Intercepts

Parallel lines preserve the ratio of intercepts on transversals. The property derived from this is the ratio of intercepts which is proved using similar triangles.

Rule: When two (or more) transversals cut a series of parallel lines, the ratios of their intercepts are equal.

Similarity of triangles. Tests for similarity
Definition of similarity of triangles. Statement of tests for similarity of triangles (equality of corresponding angles or of two such pairs, corresponding sides proportional, two pairs of corresponding sides proportional and equality of the included angles). Parallel lines preserve ratios of intercepts on transversals. Line parallel to one side of a triangle divides the other two sides in proportion*.

Equal intercepts
A line joining the midpoints of two sides of a triangle is parallel to the third side and half its length.*

Pythagoras’ theorem and its converse
Pythagoras’ Theorem. Proof using similar triangles. Converse.

Area formulae
Triangle: A = 1/2bh

Paralellogram: A = bh = lb''

Rhombus:A= 1/2xy

Trapezium A= h/2(a+b)


text:
HSC Extension 1 and 2 Mathematics/Real functions

= What is a function = Much of this course is devoted to the study of properties of real-valued functions of a real variable. Such a function $$f$$ assigns to each element $$x$$ of a given set of real numbers exactly one real number y, called the value of the function $$f$$ at $$x$$. Students can think about function as a process in which when one input a number(e.g. $$x$$), a number(e.g. $$y$$) can be generated. In other word, a function is simply a relation where for every independent variable(e.g. $$x$$), there is only one dependent variable(e.g. $$y$$). The dependence of $$y$$ on $$f$$ and on $$x$$ is made explicit by using the notation $$f(x)$$ to mean the value of $$f$$ at $$x$$.

Example:

$$f(x) = x^2$$

For Every value of $$x$$, $$f(x)$$ only generate a single value. This can be shown through the table of values. The function y = $$f(x)$$may be represented pictorially by its graph, which is the set of points ($$x$$,$$f(x)$$) for each $$x$$ in the domain of $$f$$, indicated with respect to cartesian coordinate axes x,y.

Notice that a vertical line only cuts the graph once, thus making the graph a function.

A relation, however, is different to a function. A relation is a set of operations that links the independent variables to a set of dependent variables. In order words, for a single $$x$$ value. there can be multiple y values.

Example:

$$x^2+y^2 = 1$$ This is the formula for a circle. Notice that a vertical line may cross the circle more than once, thus for a given x value, there may be more than 1 y value exist. This can be illustrated pictorially or algebraically.

$$x^2+y^2 = 1$$

$$y^2=1-x^2$$

$$y=\pm\sqrt[]{1-x^2}$$

= Domain = The domain of a function is simply a set of possible $$x$$ values for which it's corresponding $$f(x)$$ exists.

Example:

$$f(x)=\sqrt[]{1-x^2}$$

As we know, in real numbers, we can not square root a negative number. Thus, by solving the following inequality, we can find out the this function's domain.

$$1-x^2\geq 0$$

$$1\geq x^2$$

$$x^2 \leq 1$$

∴ the domain of this function is all real x where $$-1\leq x \leq 1$$.

Note that a lot of questions test this topic around rational functions. It is important to remember that when the denominator is zero, the number is undefined.

Example:

$$f(x)=\frac{1}{x^2+5x+6}$$

Since the number is undefined when the denominator is zero, we can equate the denominator to zero to find out exactly when this function is undefined.

$$x^2+5x+6 = 0 $$

$$(x+2)(x+3) = 0 $$

$$(x+2)=0 $$ OR $$(x+3)=0 $$

$$x = 2,3 $$

∴ the domain of this function is all real x where $$x \neq 2,3$$.

= Range = The domain of a function is simply a set of possible $$f(x)$$ values for which it's corresponding $$x$$ exists. This is very similar to Domain, but concerning a different axis.

Example:

$$f(x)=x^2$$

The best way to approach this problem is by drawing a quick sketch of the function in question. As you can see, this function is simply a parabola. We know that all parabolas have their two arms extending to either positive or negative infinity depending on the signs of the parabola. In this parabola, we can see that its minimum point(minima) is at 0 with no $$f(x)$$ value existing below it. Thus, we know that all the possible $$f(x)$$ value of this function is above 0 inclusive.

∴the range of this function is all real y where $$y\geq0$$.

= Even/Odd Functions = First that's have a brief look of some of the typical even functions.

As it is clearly shown, an even function is one that is symmetrical with respect to the Y axis. Now, in order to solve problems around even functions, we need to make this geographical description more mathematical.

As you can see if you input 1 or -1, the output of this function remains constant. Thus we can deduce that if a function is even, then $$f(x)=f(-x) $$.

Example:

Show that the function $$f(x) = \frac{x^4+1}{x^2+x^4} $$ is even.

First don't be intimidated by this seemingly complex function, you don't have to graph it.

Calculate what $$f(-x) $$; to do this replace all x with (-x).

$$f(-x) = \frac{(-x)^4+1}{(-x)^2+(-x)^4} $$

As we all know if

$$(-x)^2 = x^2 $$ so that

$$((-x)^2)^2 = (x^2)^2 $$ hence

$$(-x)^4 = x^4 $$

In fact any even number power will make what's inside the bracket positive.

Thus

$$f(-x) = \frac{x^4+1}{x^2+x^4} $$

∴$$f(x)=f(-x) $$, f(x) is even.

= Locus =

= Regions/Inequality =

Dependent and independent variables. Functional notation. Range and domain.
Much of this course is devoted to the study of properties of real-valued functions of a real variable. Such a function f assigns to each element x of a given set of real numbers exactly one real number y, called the value of the function f at x. The dependence of y on f and on x is made explicit by using the notation f(x) to mean the value of f at x. The set of real numbers x on which f is defined is called the domain of f, while the set of values f(x) obtained as x varies over the domain of f is called the range or image of f. x is called the independent variable since it may be chosen freely within the domain of f, while y = f(x) is called the dependent variable since its value depends on the value chosen for x.

The functions f studied in this course are usually given by an explicit rule involving calculations to be made on the variable x in order to obtain f(x). For this reason, a function f is often described in a form such as ‘y = f(x)’ with the domain of x specified.

It is also common usage to refer to ‘the function f(x)’ where f(x) is prescribed but no domain is given. In such cases, the understanding required to be developed is that the domain of f is the set of real numbers for which the expression f(x) defines a real number.

It is important to realise that use of the notation y = f(x) does not imply that the expression corresponding to f(x) is the same for all x. For example, the rule

$$ f(x) = x, x \ge 0 $$

$$f(x) = -x, x < 0 \;$$

defines a function with domain all real x.

The use of x and y is customary and is related to the geometrical representation of a function f by graphing the set of points (x, f(x)) for x in the domain of f, using cartesian (x, y) coordinates. Other symbols for independent and dependent variables occur frequently in practice and students should become familiar with functions defined in terms of other symbols.

The graph of a function. Simple examples.
The pictorial representation of a function is extremely useful and important, as is the idea that algebraic and geometrical descriptions of functions are both helpful in understanding and learning about their properties.

The function y = f(x) may be represented pictorially by its graph, which is the set of points (x, f(x)) for each x in the domain of f, indicated with respect to cartesian coordinate axes 0x0y. Denoting the point with coordinates (x, f(x)) by P, the graph of the function (and sometimes the function itself) is often referred to as the ‘set of points P(x, f(x))’. Since f is a function, there is at most one point P of its graph on any ordinate. The graph of y = f(x) is also called the curve y = f(x) and the part of the curve lying between two ordinates is called an arc.

Examples of functions y = f(x) should be given which illustrate different types of domain, bounded and unbounded ranges, continuous and discontinuous curves, curves which display simple symmetries, curves with sharp corners and curves with asymptotes. Students are to be encouraged to develop the habit of drawing sketches which indicate the main features of the graphs of any functions presented to them. They should also develop at this stage the habit of checking simple properties of functions and identifying simple features such as:

where is the function positive? negative? zero?; where is it increasing? decreasing?; does it have any symmetry properties?; is it bounded?; does it have gaps (jumps) or sharp corners?; is there an asymptote?

Knowledge of the symmetries of the graphs of odd and even functions is useful in curve sketching.

A function f(x) is even if f(–x) = f(x) for all values of x in the domain. Its graph is symmetric with respect to reflection in the y-axis, i.e. it has line symmetry about the y-axis. A function f(x) is odd if f(–x) = –f(x) for all values of x in the domain. Its graph is symmetric with respect to reflection in the point 0 (the origin or axes), i.e. it has point symmetry about the origin.

Algebraic representation of geometrical relationships. Locus problems.
Some of the work of this section might profitably be discussed in conjunction with Topics 6 and 9. A circle with a given centre C and a given radius r is defined as the set of points in the plane whose distance from C is r. If cartesian coordinate axes 0x0y are set up in the plane so that C is the point with coordinates (a, b), then the distance formula shows that P(x, y) lies on the given circle if and only if x and y satisfy the equation (x – a)2 + (y – b)2 = r2, hence this equation is an algebraic representation corresponding to the geometrical description given above.

It should be noted that if this equation is used to express y as a function of x, then two functions are obtained: y = b + √(r2 – (x – a)2) and y = b – √(r2 – (x – a)2), each with domain a – r less than or equal to x less than or equal to a + r.

Generally, sets of points satisfying simple conditions stated in geometrical terms can be described in algebraic terms by introducing cartesian coordinates and interpreting the original conditions as conditions relating x and y. The conditions then usually reduce to one or more equations or inequalities.

problems involving the determination of the set of points which satisfy a given number of conditions (which may be expressed geometrically or algebraically) are called locus problems and often stated in the form ‘Find the locus of a point P which satisfies …’. The means in practice ‘Find a simple algebraic or geometric description of the set of all points P which satisfy …’.

Region and inequality. Simple examples.
Treatment is to be restricted to regions of the (cartesian x, y–) plane which admit a simple geometrical description — for example, by use of words such as interior, exterior, bounded by, boundary, sector, common to, etc., — and which admit a simple algebraic description using one or more inequalities in x and y.

Examples should be simple and involve at most one non-linear inequality, but should include both bounded and unbounded regions. Note that the case of one or more linear inequalities is specifically listed in Topic 6.4.

A clear sketch diagram, illustrating the relevant regions, should be drawn for each example. Regions whose algebraic description involves two or more inequalities should be understood to correspond to the common part (intersection) of the regions determined by each separate inequality.


text:
Chess Opening Theory/1. e4/1...c5/2. Nc3/2...Nc6

Closed Sicilian
2...Nc6 Most of the time in the Sicilian, White puts their Knight on f3. White may yet play d4, but for the moment the question is yet to be answered. White's second move of 2. Nc3 suggests the possibility of NOT playing d4 (avoiding the exchange), and playing a closed position instead of the slashing, attacking types of position, that are more common to the Sicilian Defence. Leads to 3. g3 g6 4. Bg2 Bg7 5. d3 d6

Statistics
Estimated next move popularity: Nf3 30%, g3 29%, f4 16%, Nge2 12%, Bb5 12%, d3 1%, Bc4 1%, other moves less than 0.3%.

Theory table
.

'''1. e4 c5 2. Nc3 Nc6'''


text:
User talk:Cguegan

Welcome, Cguegan! Please note that source texts, such as Colregs are outside project scope. Please move the content to Wikisource, which is specifically for source texts such as this one. This page will be deleted in a few days.

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 15:09, 1 December 2007 (UTC)
 * PS: When you have moved the content, please mark the page at the top by adding . This helps us keep track things. Thanks! – Mike.lifeguard  | talk 15:10, 1 December 2007 (UTC)

Colregs is now at Colregs - please contribute any further content at Wikisource. As well, please provide license information for that text at Wikisource. Thanks! – Mike.lifeguard  | talk 17:34, 17 December 2007 (UTC)

title: User talk:Cguegan


text:
User talk:Ludds~enwikibooks

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 15:13, 1 December 2007 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Ludds. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Ludds~enwikibooks that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:23, 17 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 05:12, 19 April 2015 (UTC)

title: User talk:Ludds~enwikibooks


text:
Algorithm Implementation/Sorting/Radix sort

Radix Sort
Radix Sort is a sorting algorithm designed to work on items where the key of each item is an ordered set of integers in the range 0 to (N-1) inclusive both ends, or can be transformed into such an ordered set.

C# least significant digit (LSD) radix sort implementation
Here we sort an unsigned integer array that's passed to the RadixSort method (Note: all arrays in C#/.NET are reference types, and therefore a is a reference to an array).

Source: article on www.osix.net (here)

Python LSD radix sort
Implementazioni di algoritmi/Radix sort


text:
Talk:Algorithm Implementation/Sorting/Radix sort

enwiki history
* (cur) (last) 15:28, 1 December 2007 Oli Filth (t | c) (-7787) (Moved sample implementations to wikibooks, like most of the other sort algorithm articles) (×) * (cur) (last) 18:28, 29 November 2007 Ceros (t | c) (-55) (using source tag for sources) (×) * (cur) (last) 03:20, 14 November 2007 Ryan Roos (t | c) (-74) (Undid revision 171340418 by 203.131.127.234 (talk)) (×) * (cur) (last) 01:46, 14 November 2007 203.131.127.234 (t) (+74) (→C# least significant digit (LSD) radix sort implementation) (×) * (cur) (last) 15:07, 25 October 2007 SieBot (t | c) m (+2) (robot Modifying: uk:Сортування за розрядами) (×) * (cur) (last) 22:29, 22 October 2007 131.111.8.104 (t) (-1) (grammar nazi) (×) * (cur) (last) 11:46, 15 October 2007 200.253.230.100 (t) (-8) (→Least significant digit radix sorts) (×) * (cur) (last) 05:37, 9 October 2007 AntiSpamBot (t | c) (-1005) (BOT--Reverting edits by Pvamsiece to revision 157459675 (example\.com)) (×) * (cur) (last) 05:37, 9 October 2007 Pvamsiece (t | c) (+1005) (×) * (cur) (last) 20:44, 12 September 2007 DnetSvg (t | c) m (+1) (Switched to svg images) (×) * (cur) (last) 18:30, 19 August 2007 Oskar Sigvardsson (t | c) (+13) (→References - adding navbox) (×) * (cur) (last) 20:14, 13 August 2007 Dcoetzee (t | c) m (-33) (Reverted edits by Lilnepatiz (talk) to last version by Thijs!bot) (×) * (cur) (last) 20:13, 13 August 2007 Lilnepatiz (t | c) (+33) (×) * (cur) (last) 18:52, 5 August 2007 Thijs!bot (t | c) m (+18) (robot Adding: cs:Radix sort) (×) * (cur) (last) 05:43, 27 July 2007 Inquam (t | c) m (-126) (×) * (cur) (last) 20:02, 8 July 2007 GregorB (t | c) m (+8) (→C# least significant digit (LSD) radix sort implementation - Line wrap) (×)[–] * (cur) (last) 20:02, 8 July 2007 GregorB (t | c) (+135) (+cat) (×) * (cur) (last) 12:48, 5 July 2007 MisterSheik (t | c) (-342) (simplified) (×) * (cur) (last) 08:01, 2 July 2007 MrSeasword (t | c) (+26) (→C++ LSD Radix sort using STL, non-recursive implementation) (×) * (cur) (last) 14:56, 26 June 2007 Anchor Link Bot (t | c) (+51) (Notifying of internal link to section External links from Radix sort) (×) * (cur) (last) 21:48, 15 June 2007 65.57.245.11 (t) (+741) (→C++ LSD radix sort example of non-recursive implementation) (×) * (cur) (last) 07:30, 5 June 2007 CJLL Wright (t | c) m (-41) (category rename per CfD 2007 May 24 using AWB) (×) * (cur) (last) 22:01, 31 May 2007 Ahy1 (t | c) (-85) (→See also - rm burstsort link. It doesn't provide any information on Radix sort) (×) * (cur) (last) 19:34, 31 May 2007 169.229.53.213 (t) (-10) (→See also - changed link to more direct page for Burstsort library) (×) * (cur) (last) 07:38, 30 May 2007 Blashyrk (t | c) m (+95) (added burst sort to "see also section") (×) * (cur) (last) 04:28, 29 May 2007 MartinBot (t | c) m (+587) (BOT - rv 121.247.152.253 (talk) to last version by 24.12.11.31) (×) * (cur) (last) 04:28, 29 May 2007 121.247.152.253 (t) (-587) (→An example) (×) * (cur) (last) 03:32, 24 May 2007 24.12.11.31 (t) (-4) (Significance goes down as you go from left to right. Digits to the right are less significant.) (×)[–] * (cur) (last) 03:25, 24 May 2007 24.12.11.31 (t) (-3) (m) (×) * (cur) (last) 14:07, 23 May 2007 Chobot (t | c) m (+21) (robot Adding: ko:기수 정렬) (×) * (cur) (last) 05:13, 21 May 2007 Bbik (t | c) m (-9) (Link repetition cleanup. The text (of the full article, not just the intro) needs some help with repetition, too.) (×)[–] * (cur) (last) 05:11, 21 May 2007 Bbik (t | c) m (0) (→Recursion - "Next less" is if you're working up, which it's not, so therefore it should be "next most") (×) * (cur) (last) 17:44, 11 May 2007 200.219.249.101 (t) (+3) (→C sample MSD implementation) (×) * (cur) (last) 12:28, 1 May 2007 193.157.245.216 (t) (35,515 bytes) (added four ") (×)   * (cur) (last) 05:25, 2 April 2007 24.12.11.31 (t) ("next most" could be confused to mean the next more significant digit, so I changed it to "next less") (×)[–]    * (cur) (last) 04:55, 24 March 2007 24.12.11.31 (t) (Fixed broken link due to the change in heading capitalization.) (×)    * (cur) (last) 18:33, 18 March 2007 JhsBot (t | c) m (robot Adding: no:Radikssortering) (×)    * (cur) (last) 02:17, 15 March 2007 24.12.11.31 (t) (m) (×)    * (cur) (last) 02:14, 12 March 2007 Hdante (t | c) (→C++ LSD radix sort example of non-recursive implementation - removing useless comment) (×)    * (cur) (last) 09:13, 8 March 2007 24.12.11.31 (t) (m) (×)[–]    * (cur) (last) 09:05, 8 March 2007 24.12.11.31 (t) (Clarified meaning of paging space) (×)    * (cur) (last) 08:59, 8 March 2007 24.12.11.31 (t) (Defined memory fragmentation) (×) * (cur) (last) 22:17, 5 March 2007 24.12.11.31 (t) (Made the original, unsorted list in the LSD radix sort example more prominent) (×) * (cur) (last) 20:59, 5 March 2007 24.12.11.31 (t) (Revised paragraph structure and contents to make them more clear) (×) * (cur) (last) 18:53, 5 March 2007 24.12.11.31 (t) (m) (×) * (cur) (last) 17:27, 1 March 2007 216.87.108.136 (t) (→An example) (×) * (cur) (last) 13:06, 27 February 2007 151.199.38.32 (t) (→An example) (×) * (cur) (last) 13:10, 26 February 2007 80.168.225.144 (t) (→Sample implementations - formatting subheads again) (×)[–] * (cur) (last) 13:09, 26 February 2007 80.168.225.144 (t) (finishing formatting) (×) * (cur) (last) 13:08, 26 February 2007 80.168.225.144 (t) (formatting subheadings) (×) * (cur) (last) 05:47, 26 February 2007 Njahnke (t | c) m (comma before quote) (×) * (cur) (last) 21:41, 25 February 2007 Raul654 (t | c) (×) * (cur) (last) 21:17, 25 February 2007 Davidhorman (t | c) m (×) * (cur) (last) 21:14, 25 February 2007 TomCAnthony (t | c) m (Added in some paragraph breaks.) (×) * (cur) (last) 21:06, 25 February 2007 82.39.157.250 (t) (×) * (cur) (last) 20:23, 17 February 2007 Gwern (t | c) m (Robot-assisted disambiguation (you can help!): Queue (disambiguation)) (×) * (cur) (last) 12:49, 26 January 2007 24.12.11.31 (t) (Gave example of the difference between numeric ordering and lexicographics ordering.) (×) * (cur) (last) 06:41, 25 January 2007 PJY (t | c) m (→C sample MSD implementation - change link to c to c the programming language) (×) * (cur) (last) 20:17, 15 January 2007 Edcolins (t | c) m (→A Recursive Forward Radix Sort Example - tyop : readability,) (×) * (cur) (last) 02:38, 30 December 2006 Simon12 (t | c) m (Disambiguation, link to base) (×) * (cur) (last) 07:01, 29 December 2006 24.12.11.31 (t) (m) (×)[–] * (cur) (last) 13:02, 28 December 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 12:32, 28 December 2006 24.12.11.31 (t) (Cleaned up code and added a lot of comments) (×) * (cur) (last) 03:50, 10 December 2006 Gwern (t | c) m (Robot-assisted disambiguation (you can help!): Java programming language) (×) * (cur) (last) 03:15, 10 December 2006 129.97.219.101 (t) (→A Recursive Forward Radix Sort Example) (×) * (cur) (last) 04:53, 2 December 2006 Rspeer (t | c) (→Least Significant Digit Radix Sorts - take out misinformation about big-O notation. You never assume constant memory.) (×) * (cur) (last) 23:37, 1 December 2006 Cuberoot31 (t | c) (Dispute seems over) (×) * (cur) (last) 07:42, 21 November 2006 DHN-bot (t | c) m (robot Modifying: lt:Skaitmeninis rikiavimo algoritmas) (×) * (cur) (last) 03:43, 17 November 2006 24.12.11.31 (t) (iostream.h and stdlib.h should work with all standard C++ compilers) (×) * (cur) (last) 03:43, 12 November 2006 216.145.71.254 (t) (→C++ LSD Radix Sort example of non-recursive implementation) (×) * (cur) (last) 12:47, 2 November 2006 88.81.227.162 (t) (→References) (×) * (cur) (last) 07:54, 29 October 2006 Ahy1 (t | c) (revert vandalism) (×) * (cur) (last) 05:40, 29 October 2006 64.91.0.137 (t) (→See also) (×)[–] * (cur) (last) 05:39, 29 October 2006 64.91.0.137 (t) (→See also) (×) * (cur) (last) 05:39, 29 October 2006 64.91.0.137 (t) (→Least Significant Digit Radix Sorts) (×) * (cur) (last) 08:05, 21 October 2006 24.12.11.31 (t) (Added more of an explanation of the O notation) (×)[–] * (cur) (last) 07:33, 20 October 2006 24.12.11.31 (t) (Made a distinction between numbers and number representations to be clear) (×) * (cur) (last) 07:16, 20 October 2006 24.12.11.31 (t) (Revised wording to be more clear) (×) * (cur) (last) 06:43, 20 October 2006 24.12.11.31 (t) (Revised wording to be more clear) (×) * (cur) (last) 06:08, 20 October 2006 24.12.11.31 (t) (Revised text to be more clear) (×) * (cur) (last) 05:49, 20 October 2006 24.12.11.31 (t) (Made the text more clear) (×) * (cur) (last) 05:13, 20 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 23:12, 18 October 2006 24.12.11.31 (t) (Underlined some digits to make it more clear which digits are being processed) (×) * (cur) (last) 12:05, 18 October 2006 24.12.11.31 (t) (Revised wording about traversal.) (×) * (cur) (last) 11:57, 18 October 2006 24.12.11.31 (t) (Revised wording) (×) * (cur) (last) 11:09, 18 October 2006 24.12.11.31 (t) (Revised ambiguous language) (×) * (cur) (last) 06:48, 18 October 2006 24.12.11.31 (t) (Expanded on what is meant by a histogram in the context of radix sorting) (×) * (cur) (last) 19:32, 16 October 2006 24.12.11.31 (t) (It's sometimes possible to determine set membership in a list in constant time) (×) * (cur) (last) 04:42, 16 October 2006 24.12.11.31 (t) (Moved postal sort reference to the MSD radix sort section) (×) * (cur) (last) 21:39, 15 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 21:38, 15 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 19:10, 15 October 2006 24.12.11.31 (t) (Mentioned the possibility of using pointers to keys in an LSD sort) (×) * (cur) (last) 08:24, 15 October 2006 66.30.10.183 (t) (→C sample MSD implementation) (×)[–] * (cur) (last) 08:24, 15 October 2006 66.30.10.183 (t) (→Sample implementations) (×) * (cur) (last) 08:23, 15 October 2006 66.30.10.183 (t) (→Sample implementations) (×) * (cur) (last) 03:00, 15 October 2006 24.12.11.31 (t) (Separated discussion of LSD and MSD radix sorts) (×) * (cur) (last) 23:56, 14 October 2006 69.116.213.35 (t) (×)[–] * (cur) (last) 23:54, 14 October 2006 69.116.213.35 (t) (→C++ example of non-recursive implementation) (×) * (cur) (last) 23:49, 14 October 2006 69.116.213.35 (t) (→C/C++) (×) * (cur) (last) 23:48, 14 October 2006 69.116.213.35 (t) (→C/C++) (×) * (cur) (last) 20:57, 14 October 2006 24.12.11.31 (t) (Added Burstsort reference.) (×)[–] * (cur) (last) 20:14, 14 October 2006 24.12.11.31 (t) (This is edlee. Forgot my password. Adding requested revision.) (×) * (cur) (last) 23:19, 12 October 2006 71.235.102.239 (t) (See talk page) (×) * (cur) (last) 01:46, 12 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 14:54, 21 September 2006 194.73.96.226 (t) (Items need not be keys, and need not be unique.) (×) * (cur) (last) 06:44, 14 September 2006 Fredrik (t | c) m (×) * (cur) (last) 08:37, 7 September 2006 Nguyen Thanh Quang (t | c) m (→References - vi) (×) * (cur) (last) 20:57, 1 September 2006 RTC (t | c) m (→See also) (×) * (cur) (last) 14:47, 27 August 2006 SmackBot (t | c) m (ISBN formatting &/or general fixes using AWB) (×) * (cur) (last) 22:06, 14 August 2006 88.11.173.229 (t) (→C++ example of non-recursive implementation) (×) * (cur) (last) 00:41, 8 August 2006 128.176.151.108 (t) (→External links) (×)[–] * (cur) (last) 00:40, 8 August 2006 128.176.151.108 (t) (→External links) (×) * (cur) (last) 06:04, 5 August 2006 209.152.117.83 (t) (→An example) (×)[–] * (cur) (last) 06:03, 5 August 2006 209.152.117.83 (t) (→An example) (×) * (cur) (last) 20:44, 4 August 2006 69.18.50.2 (t) (→An example) (×)[–] * (cur) (last) 20:44, 4 August 2006 69.18.50.2 (t) (→An example) (×) * (cur) (last) 17:38, 17 July 2006 VTBassMatt (t | c) (→External links) (×) * (cur) (last) 18:22, 27 June 2006 StrongMan (t | c) m (×) * (cur) (last) 01:43, 22 June 2006 83.17.58.50 (t) (link) (×) * (cur) (last) 16:03, 15 June 2006 137.65.45.13 (t) (fixed error in step 2) (×) * (cur) (last) 09:51, 12 June 2006 A5b (t | c) m (link to ru:~) (×) * (cur) (last) 04:23, 26 May 2006 71.112.103.189 (t) (→C#) (×) * (cur) (last) 12:41, 16 May 2006 FlaBot (t | c) m (robot Adding: it) (×) * (cur) (last) 00:20, 12 May 2006 Booyabazooka (t | c) (Category:Stable sorts) (×)[–] * (cur) (last) 22:58, 11 May 2006 Booyabazooka (t | c) m (link postal sort) (×) * (cur) (last) 04:38, 27 April 2006 Booyabazooka (t | c) m ("however" is not a conjuction) (×) * (cur) (last) 21:24, 26 April 2006 Edlee (t | c) (Regard 2 as 002. Least Significant Digit Radix sorts are stabile) (×) * (cur) (last) 23:26, 25 April 2006 71.209.19.167 (t) (spelling fix) (×) * (cur) (last) 19:23, 25 April 2006 128.131.200.27 (t) (→An example) (×) * (cur) (last) 22:26, 23 April 2006 RussHolsclaw (t | c) (→See also) (×) * (cur) (last) 04:41, 10 April 2006 129.237.156.132 (t) (→C#) (×) * (cur) (last) 21:26, 5 April 2006 128.105.165.130 (t) (×) * (cur) (last) 07:18, 19 March 2006 YurikBot (t | c) m (robot Adding: fi) (×) * (cur) (last) 20:45, 17 March 2006 Petri Krohn (t | c) (→See also - +IBM 80) (×) * (cur) (last) 04:19, 17 March 2006 YurikBot (t | c) m (robot Adding: he) (×) * (cur) (last) 08:53, 16 March 2006 Edlee (t | c) (Added information about inserting strings into internal nodes) (×)[–] * (cur) (last) 06:51, 16 March 2006 Edlee (t | c) m (×) * (cur) (last) 06:47, 16 March 2006 Edlee (t | c) m (Changed a reference to an example due to the movement of the text) (×) * (cur) (last) 23:21, 14 March 2006 Wwagner (t | c) (Reverting changes by 71.135.55.94 to last version by StuRat) (×) * (cur) (last) 23:13, 14 March 2006 71.135.55.94 (t) (→An example) (×) * (cur) (last) 19:18, 14 March 2006 StuRat (t | c) (→Sample implementations - Finished move.) (×)[–] * (cur) (last) 19:16, 14 March 2006 StuRat (t | c) (→Recursion - Removed vandalism and moved huge snow white section to it's own section.) (×) * (cur) (last) 22:29, 13 March 2006 199.90.6.26 (t) (→Recursion) (×)[–] * (cur) (last) 22:25, 13 March 2006 199.90.6.26 (t) (→Iterative version using queues) (×) * (cur) (last) 21:38, 13 March 2006 199.80.154.63 (t) (→Recursion) (×)[–] * (cur) (last) 21:30, 13 March 2006 199.80.154.63 (t) (→Iterative version using queues) (×) * (cur) (last) 02:22, 8 March 2006 Fuzzie (t | c) m (disambig Java link) (×) * (cur) (last) 18:23, 3 March 2006 Edlee (t | c) (→Recursion) (×)[–] * (cur) (last) 18:03, 3 March 2006 Edlee (t | c) (→Recursion - Added clarification.) (×) * (cur) (last) 17:16, 3 March 2006 Edlee (t | c) (→Recursion) (×) * (cur) (last) 14:12, 3 March 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 14:01, 3 March 2006 Edlee (t | c) (→Recursion) (×) * (cur) (last) 13:42, 3 March 2006 Edlee (t | c) m (×) * (cur) (last) 13:35, 3 March 2006 Edlee (t | c) m (×) * (cur) (last) 13:33, 3 March 2006 Edlee (t | c) (→Recursion - Revised wording to make it more general.) (×) * (cur) (last) 13:26, 3 March 2006 Edlee (t | c) (→Recursion) (×) * (cur) (last) 12:19, 3 March 2006 Edlee (t | c) (Added an example of a circularly threaded trie.) (×) * (cur) (last) 01:25, 2 March 2006 Edlee (t | c) (Added more detail to the discussion of trie traversal.) (×) * (cur) (last) 15:09, 27 February 2006 Edlee (t | c) (→External links - Added note about hexadecimal digits) (×) * (cur) (last) 12:53, 27 February 2006 Edlee (t | c) m (×) * (cur) (last) 12:37, 27 February 2006 Edlee (t | c) m (×) * (cur) (last) 12:24, 27 February 2006 Edlee (t | c) m (Linked to the correct picture name, which is case-sensitive) (×) * (cur) (last) 12:18, 27 February 2006 Edlee (t | c) (→Recursion - Added another illustration of a trie) (×) * (cur) (last) 08:09, 26 February 2006 Edlee (t | c) (→Recursion - Added diagram of one possible trie structure.) (×) * (cur) (last) 02:20, 24 February 2006 Edlee (t | c) m (×) * (cur) (last) 12:38, 23 February 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 10:56, 23 February 2006 Lightst (t | c) m (→C++ example of non-recursive implementation - Fixed comments in the code.) (×) * (cur) (last) 23:57, 22 February 2006 Edlee (t | c) (Radix sorts are simply unrelated to comparison-based quick sorts) (×)[–] * (cur) (last) 23:02, 22 February 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 22:53, 22 February 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 22:52, 22 February 2006 Edlee (t | c) m (×) * (cur) (last) 22:22, 22 February 2006 Edlee (t | c) m (spelling) (×) * (cur) (last) 11:00, 22 February 2006 24.12.11.31 (t) (Non sequitur) (×)[–] * (cur) (last) 10:39, 22 February 2006 24.12.11.31 (t) (Added summary of incremental trie-based radix sorts) (×) * (cur) (last) 06:12, 18 February 2006 84.134.113.7 (t) (Changed link) (×) * (cur) (last) 08:11, 17 February 2006 202.90.128.28 (t) (×) * (cur) (last) 08:11, 17 February 2006 202.90.128.21 (t) (×) * (cur) (last) 14:29, 16 February 2006 Lightst (t | c) m (→C++ example 2 - Fair enough. Added copyright notice and license (GFDL is not appropiate for source code imho)) (×) * (cur) (last) 22:39, 15 February 2006 Dcoetzee (t | c) (Please do not sign your contributions) (×) * (cur) (last) 22:28, 15 February 2006 Lightst (t | c) m (→C++ example 2 - Signed the code) (×) * (cur) (last) 19:48, 15 February 2006 81.76.123.165 (t) (→C/C++ example 2 - The former code had a very strange indentation and produced segmentation faults. This code has been tested in a Pentium M. Comments are welcome) (×) * (cur) (last) 16:24, 13 February 2006 131.91.83.29 (t) (Added link to another demonstration page.) (×) * (cur) (last) 16:34, 2 February 2006 66.9.95.117 (t) (Added other name for Radix sort.) (×) * (cur) (last) 23:50, 31 January 2006 Dcoetzee (t | c) (Accuracy, style/language) (×)[–] * (cur) (last) 23:49, 31 January 2006 Dcoetzee (t | c) (Revert accidental reversion and addition of grammatical error) (×) * (cur) (last) 23:47, 31 January 2006 Frencheigh (t | c) m (×) * (cur) (last) 23:47, 31 January 2006 Dcoetzee (t | c) (→An example - Fmt) (×)[–] * (cur) (last) 23:45, 31 January 2006 Dcoetzee (t | c) (→An example - Note on stableness) (×) * (cur) (last) 23:42, 31 January 2006 Dcoetzee (t | c) (Do not ever use "finitely many" to mean a "small number of") (×) * (cur) (last) 20:30, 29 January 2006 81.110.217.155 (t) (→C/C++ example 2) (×)[–] * (cur) (last) 20:30, 29 January 2006 81.110.217.155 (t) (→C/C++ example 2) (×) * (cur) (last) 20:30, 29 January 2006 81.110.217.155 (t) (×) * (cur) (last) 02:23, 14 January 2006 63.224.32.63 (t) (→C/C++) (×)[–] * (cur) (last) 02:22, 14 January 2006 63.224.32.63 (t) (→C/C++) (×) * (cur) (last) 13:16, 11 January 2006 Bluebot (t | c) m (Fixing C++ links) (×) * (cur) (last) 19:37, 29 December 2005 Dcoetzee (t | c) (Remove text/links - there is no radix sort implementations article at present, might be one in the future) (×) * (cur) (last) 18:15, 29 December 2005 84.60.22.85 (t) (→C#) (×) * (cur) (last) 19:00, 10 December 2005 Decrypt3 (t | c) m (rv) (×) * (cur) (last) 14:28, 10 December 2005 194.85.160.55 (t) (→External links) (×) * (cur) (last) 04:13, 10 December 2005 195.131.144.254 (t) (→C++) (×)[–] * (cur) (last) 04:11, 10 December 2005 195.131.144.254 (t) (→С++) (×) * (cur) (last) 04:09, 10 December 2005 195.131.144.254 (t) (→C#) (×) * (cur) (last) 03:14, 29 November 2005 Dcoetzee (t | c) (Change back to all comparison sorts, and change big O to Ω so it's correct) (×) * (cur) (last) 02:48, 29 November 2005 Frencheigh (t | c) m (bubble sort is a CS) (×) * (cur) (last) 02:16, 29 November 2005 Dcoetzee (t | c) (Link comparison sort) (×)[–] * (cur) (last) 03:44, 19 November 2005 Dcoetzee (t | c) m (Fix year) (×) * (cur) (last) 21:12, 18 November 2005 Dcoetzee (t | c) m (→References - Page fix) (×) * (cur) (last) 21:12, 18 November 2005 Dcoetzee (t | c) (→References - CLRS ref) (×) * (cur) (last) 09:25, 18 November 2005 Dcoetzee (t | c) (Fix Knuth ref) (×) * (cur) (last) 09:24, 18 November 2005 Dcoetzee (t | c) (Fix Knuth ref) (×) * (cur) (last) 09:12, 18 November 2005 Dcoetzee (t | c) (Add references section with Knuth reference) (×) * (cur) (last) 01:46, 15 November 2005 Frencheigh (t | c) (→External links - removing that dead link) (×) * (cur) (last) 13:14, 13 November 2005 221.134.9.50 (t) (→External links) (×) * (cur) (last) 21:09, 28 October 2005 20.137.18.50 (t) (→Sample implementations) (×) * (cur) (last) 16:47, 11 October 2005 198.96.86.4 (t) (×) * (cur) (last) 01:11, 7 October 2005 StuRat (t | c) m (Added "A".) (×) * (cur) (last) 00:20, 6 October 2005 128.42.167.181 (t) (×) * (cur) (last) 01:32, 4 October 2005 Frencheigh (t | c) (rv, see the example) (×) * (cur) (last) 16:41, 3 October 2005 24.62.122.25 (t) (→Recursion) (×) * (cur) (last) 15:05, 2 October 2005 StuRat (t | c) (→Efficiency - Grammar (added "the"s)) (×) * (cur) (last) 13:18, 2 October 2005 80.252.129.22 (t) (→Efficiency) (×) * (cur) (last) 16:19, 30 August 2005 Lt-wiki-bot (t | c) m (robot Adding: es) (×) * (cur) (last) 11:11, 15 August 2005 Sam Hocevar (t | c) m (→An example - grammar (it's / its)) (×) * (cur) (last) 22:04, 5 August 2005 StuRat (t | c) (→Recursion) (×) * (cur) (last) 21:52, 5 August 2005 172.142.201.90 (t) (→Recursion - Added recursion example.) (×)[–] * (cur) (last) 21:18, 5 August 2005 172.142.201.90 (t) (→Recursion) (×) * (cur) (last) 21:13, 5 August 2005 172.142.201.90 (t) (→Implementation) (×) * (cur) (last) 21:11, 5 August 2005 172.142.201.90 (t) (→Efficiency) (×) * (cur) (last) 21:08, 5 August 2005 172.142.201.90 (t) (→Application to Parallel Computing) (×) * (cur) (last) 21:03, 5 August 2005 172.142.201.90 (t) (→Recursion - Added headline text.) (×) * (cur) (last) 20:49, 5 August 2005 172.142.201.90 (t) (→Recursion - Added link to "parallel computing".) (×) * (cur) (last) 17:18, 5 August 2005 StuRat (t | c) (→Recursion - Added single pass/double pass discussion and expanded on parallel processing applications.) (×)[–] * (cur) (last) 09:11, 5 August 2005 StuRat (t | c) (→Recursion) (×) * (cur) (last) 22:30, 22 July 2005 Jemfinch (t | c) (There is absolutely no reason even to mention Java in this language-independent section.) (×) * (cur) (last) 08:18, 14 July 2005 RobotE (t | c) m (robot Modifying: lt) (×) * (cur) (last) 18:50, 8 July 2005 Sdr (t | c) m (fixed a typo (acheive to achieve)) (×) * (cur) (last) 22:45, 7 July 2005 128.221.4.201 (t) (Fixed misspelling of unwrapped.) (×) * (cur) (last) 23:47, 15 June 2005 EatMyShortz (t | c) (→An example - Added note) (×) * (cur) (last) 01:39, 30 May 2005 24.59.195.47 (t) (×) * (cur) (last) 15:55, 21 May 2005 84.175.158.190 (t) (Link to german version of this article) (×) * (cur) (last) 16:49, 19 May 2005 Fredrik (t | c) m (×) * (cur) (last) 22:20, 28 March 2005 201.0.20.223 (t) (×) * (cur) (last) 11:03, 21 March 2005 Knutux (t | c) m (interwiki: +lt) (×) * (cur) (last) 22:27, 8 March 2005 Ellywa (t | c) m (robot Adding:nl) (×) * (cur) (last) 00:38, 19 February 2005 Gameboyguy13 (t | c) m (spelling fix: radicies -> radices) (×) * (cur) (last) 18:16, 1 February 2005 Frencheigh (t | c) (fix links) (×)[–] * (cur) (last) 18:05, 1 February 2005 Frencheigh (t | c) (several) (×) * (cur) (last) 17:12, 1 February 2005 Frencheigh (t | c) m (→External links - mention that first FP link has imp. and sort-of indicate that the second follows the first) (×) * (cur) (last) 19:50, 28 January 2005 Sf222 (t | c) m (typo) (×) * (cur) (last) 15:46, 28 January 2005 Cal 1234 (t | c) m (→Recursion - fixed bold text and added link to bucket) (×) * (cur) (last) 23:22, 14 January 2005 Frencheigh (t | c) m (→External links - specific type of floating point) (×) * (cur) (last) 13:43, 29 November 2004 209.50.165.26 (t) (→Recursion) (×) * (cur) (last) 14:08, 26 November 2004 156.34.220.92 (t) (mentioned floating point and fixed a typo) (×)[–] * (cur) (last) 14:07, 26 November 2004 156.34.220.92 (t) (clarified the cases where we get O(n) and O(n log n) in practise) (×) * (cur) (last) 13:59, 26 November 2004 156.34.220.92 (t) (added multiple histogramming with link) (×) * (cur) (last) 23:26, 20 November 2004 65.67.63.228 (t) (removed quicksort from list of nlogn searches) (×) * (cur) (last) 15:29, 9 November 2004 Burn (t | c) m (+zh) (×) * (cur) (last) 15:08, 19 October 2004 Robbot (t | c) m (robot Modifying:fr) (×) * (cur) (last) 02:11, 9 September 2004 Guanabot (t | c) m (Guanaco - robot: changing unnecessary HTML entities to ISO-8859-1 characters - see Wikipedia:Special characters) (×) * (cur) (last) 21:51, 2 September 2004 Danakil (t | c) m (×)[–] * (cur) (last) 21:43, 2 September 2004 Danakil (t | c) (×) * (cur) (last) 21:41, 2 September 2004 Danakil (t | c) m (×) * (cur) (last) 14:58, 8 August 2004 82.161.6.36 (t) (→External links) (×)[–] * (cur) (last) 14:58, 8 August 2004 82.161.6.36 (t) (×) * (cur) (last) 14:57, 8 August 2004 82.161.6.36 (t) (×) * (cur) (last) 14:57, 8 August 2004 82.161.6.36 (t) (→External links) (×) * (cur) (last) 00:00, 29 July 2004 Frencheigh (t | c) m (→External links) (×)[–] * (cur) (last) 23:09, 28 July 2004 Frencheigh (t | c) m (→External links - radix sort of floating point) (×) * (cur) (last) 16:29, 15 June 2004 205.180.71.123 (t) (×) * (cur) (last) 14:11, 30 May 2004 Timwi (t | c) (Category:Sort algorithms) (×) * (cur) (last) 06:24, 24 April 2004 Eequor (t | c) m (Link to radix sort animation.) (×) * (cur) (last) 22:59, 4 April 2004 Dysprosia (t | c) m (fmt) (×) * (cur) (last) 22:27, 23 February 2004 Hashar (t | c) m (fr:) (×) * (cur) (last) 18:58, 20 February 2004 Ww (t | c) m (×) * (cur) (last) 18:01, 15 February 2004 Timwi (t | c) m (×) * (cur) (last) 21:24, 8 February 2004 Decrypt3 (t | c) m (×) * (cur) (last) 14:03, 17 December 2003 Hofoen (t | c) (replaced dead link) (×) * (cur) (last) 14:54, 4 December 2003 Mxn (t | c) m (×) * (cur) (last) 04:55, 3 November 2003 218.221.176.3 (t) (+ja) (×) * (cur) (last) 20:04, 8 August 2003 Nixdorf (t | c) m (link) (×) * (cur) (last) 08:43, 25 July 2003 Daniel Quinlan (t | c) m (×) * (cur) (last) 20:54, 23 June 2003 Heron (t | c) m (supercede -> supersede ) (×) * (cur) (last) 13:34, 26 April 2003 Notheruser (t | c) m (×)[–] * (cur) (last) 13:34, 26 April 2003 Notheruser (t | c) m (×) * (cur) (last) 15:10, 27 March 2003 Hfastedge (t | c) m (×) * (cur) (last) 01:59, 15 January 2003 TakuyaMurata (t | c) m (×)[–] * (cur) (last) 01:58, 15 January 2003 TakuyaMurata (t | c) (add in computer science) (×) * (cur) (last) 14:56, 30 November 2002 130.225.96.2 (t) (Corrected error in example, where 66 changed value to 67 and 65.) (×) * (cur) (last) 23:35, 22 October 2002 Derek Ross (t | c) m (typo) (×)[–] * (cur) (last) 23:35, 22 October 2002 Derek Ross (t | c) m (sp) (×) * (cur) (last) 17:43, 7 September 2002 AxelBoldt (t | c) m (×) * (cur) (last) 20:26, 16 July 2002 207.172.11.233 (t) (×)[–] * (cur) (last) 19:43, 16 July 2002 207.172.11.233 (t) (*from H Seward. email: hhseward@rcn.com) (×) * (cur) (last) 20:55, 10 March 2002 AxelBoldt (t | c) m (copyedit) (×) * (cur) (last) 16:48, 10 March 2002 Robert Merkel (t | c) (for integer keys, effectively O(n)) (×) * (cur) (last) 15:51, 25 February 2002 Conversion script (t) m (Automated conversion) (×) * (cur) (last) 08:49, 18 December 2001 Hannes Hirzel (t | c) m (×) * (cur) (last) 17:47, 12 December 2001 AxelBoldt (t | c) (No need to do it stably in recursive version.) (×) * (cur) (last) 05:35, 12 December 2001 Damian Yerrick (t | c) (It's a generalization of quicksort) (×) * (cur) (last) 19:42, 11 December 2001 Zundark (t | c) (sample implementation removed (see /Talk)) (×)[–] * (cur) (last) 18:57, 11 December 2001 Zundark (t | c) m (int -> unsigned (missed one)) (×) * (cur) (last) 18:55, 11 December 2001 Zundark (t | c) m (int -> unsigned int (in comment)) (×) * (cur) (last) 18:47, 11 December 2001 Zundark (t | c) (fixes to problems mentioned in /Talk) (×) * (cur) (last) 18:25, 11 December 2001 AxelBoldt (t | c) m (×) * (cur) (last) 18:15, 11 December 2001 Damian Yerrick (t | c) (If keyspace is proportional to number of items, you get O(n lg n). More info coming soon from my E2 article) (×) * (cur) (last) 17:18, 11 December 2001 AxelBoldt (t | c) (Clarifying my own clarifications) (×)[–] * (cur) (last) 01:04, 11 December 2001 AxelBoldt (t | c) (Added that it is linear not in the number of elements to be sorted, but in the sum of the keylengths. Moved fan message to /Talk) (×) * (cur) (last) 01:00, 11 December 2001 AxelBoldt (t | c) (Added that it is linear not in the number of elements to be sorted, but in the sum of the keylengths. Moved fan message to /Talk) (×) * (cur) (last) 18:24, 10 December 2001 206.80.116.xxx (t) (×) * (cur) (last) 08:15, 29 October 2001 Kragen (t) (Explained why radix sort isn't always used; improved spelling.)


text: Template:MONTHABBREV

title: Template:MONTHABBREV


text: Template:MONTHNUMBER

title: Template:MONTHNUMBER


text: User talk:68.195.54.92

title: User talk:68.195.54.92


text: User talk:217.44.199.148

title: User talk:217.44.199.148


text:
User:Oldelpaso

w:User:Oldelpaso

title: User:Oldelpaso


text:
User talk:Quasarstrider/Universal Religion Proposal

The Cardinal Sin of Man
 The cardinal sin of mankind is to believe that the Supreme Being must be a liar or a weakling, or even perhaps an ogre.
 * Liar :- Christianity stakes the claim that either God the Son was a liar, pretending to be too weak to hinder humans from arresting him, etc.; or else :-
 * Weakling :- Alternatively, for Christians, God the Son was such a weakling that he could be easily taken prisoner by humans, easily tortured to death by humans, etc.; and even :-
 * Ogre :- As Son of the Christian God who sought in a typically ogrish fashion to condemn humans just for being human, Jesus Christ as his Son is a member of a family of treacherous ogres; and is, therefore, completely untrustworthy.


text:
User talk:Oldelpaso

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 18:12, 1 December 2007 (UTC)

title: User talk:Oldelpaso