text:
Rust for the Novice Programmer/Number Conversions

Number Conversions
If we have a number of one type (e.g. u8) and we want to convert it to a number of a different type (e.g. i32), how would we do this? An important principle of converting between number types is that increasing the number of bits will always be safe. However, going the other way can be risky since we are losing bits which may or may not carry information. Thus, if we are doing a 'safe' transformation upwards, then there are some easy ways to do it. At the end, all of these will be 10. Note that for the third one, we specified the type of number3 as i32. If we didn't do this, it wouldn't compile since the compiler must know the type of a variable. If we used it later on in a place where an i32 was required then the compiler could infer that it is an i32. This is called type inference and is very helpful in reducing the amount of unnecessary code we write.

If we want to go the other way and convert from a larger type into a smaller type, the easiest way is to use the keyword 'as' to cast. This is risky since if the number is something the smaller type can't store, then you will get strange behaviour. For example: This prints out 246. Note that we use the i32 at the end of -10 to put the type there. This is just another way of doing it; you may like it or not like it but it is an option it is nice to be aware of. The reason for printing out 246 is a u8 can only store numbers from 0 to 255. The 10th number from 256 is 246. However, it is extremely rare you will want to rely on this behaviour so instead we would do this instead: Now we have to use explicit typing on number2 to show that we want to convert it to a u8. The try_into function tries to convert it to a number and returns a type called 'Result' that indicates whether the conversion was a success. The unwrap means that we are going to assume the conversion was a success. If the conversion wasn't a success i.e. the other number isn't representable with the new number type, then the program will crash, which is called panicking in Rust. It may seem odd to crash over a number not being converted correctly, but this is an important concept. If something goes wrong, what do we want to do? We have two options: abort and stop running, or continue and try to run with what we have. However, small errors can cause unseen consequences. Often programs rely on values or numbers being as we expect. If we use 'as' for our conversions, we could easily get strange unintended results which cause bugs much further down the program, which are very hard to track down. Instead we often want to just crash and be able to determine that there is a bug and where it occured, allowing us to fix the bug. Only in extremely rare circumstances do we want to rely on the strange behaviour of 'as' when the numbers don't fit.

Going back to the question from the last chapter, we wanted to return a floating point from our get_median function. We can return an f64 from the function and since an f64 is larger than an i32, we can use the safe conversion method. Note that since we are returning an f64 from the function, the compiler can work out when we use .into we want an f64 out, so we don't have to write out the type. Now this function works as expected, returning the correct median values.

Next: Tuples and Structs


text:
Skaneateles Conservation Area/Invasive species/Invasive microorganism list

 * List of invasive or potentially invasive plants that could be found at the SCA
 * List of invasive or potentially invasive animals that could be found at the SCA
 * List of invasive or potentially invasive microorganisms that could be found at the SCA

Proteobacteria

 * }

Cyanobacteria (blue-green algae)

 * }

Chromista

 * }

Plantae

 * }

Fungi

 * }

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


text:
User:Juuudfufhbf/sandbox

Iii

title: User:Juuudfufhbf/sandbox


text:
Minecraft resource gathering/Clay

Clay can be found in riverbeds, lake floors and in shallow oceans, and can be mined with a shovel (or your fist if you fancy drowning) to get clay balls, which can be smelted into bricks, or crafted back together into clay blocks, which can be smelted into terracotta.

It may help to use a potion of water breathing or enchant your helmet with respiration if you plan to mine clay in large quantities.

If you use Silk Touch, it drops the clay block.

title: Minecraft resource gathering/Clay


text:
User talk:Juuudfufhbf/The legend book

This page is currently being used for the book creator please do not delete

title: User talk:Juuudfufhbf/The legend book


text:
User:Juuudfufhbf/The legend book

This the book of legends the ones who have changed history the ones who have done things so great they ended up in this book

title: User:Juuudfufhbf/The legend book


text:
User:Anerisys/Mario Kart Arcade FL

Mario Kart Arcade FL is a flash-based fan-made video game released in 2010 where the player mainly collects coins and dodges shells on a straight lane. It was initially published on Newgrounds by "CodeCow Games" / "ProgrammerFRA", and uses graphical and musical assets from Nintendo's franchise.

Menu codes
These unlockable codes can not be classified as "cheat codes", since they are a mandatory part of completing the game. However, they can be used to skip parts of the game if already known.
 * 8144: "Debug mode", which displays five indescriptive property values.
 * 5420: Level select 1 (first five levels)
 * 1010: 10 extra lives
 * 1145: "Italian roads 1" kart dodging stage
 * 4250: "Sky road" level
 * 2563: "Infinity" level
 * 2489: Level select 2 (full list of tracks except below + "Italian roads 2")
 * 1991: Beta level (code unlocked after completing "Italian roads 2", apparently without further goal)

There may be further unknown codes, since the developer, in the pause menu of the beta level, states their fascination with surprising easter eggs in video games.

title: User:Anerisys/Mario Kart Arcade FL


text:
Turkish/Infinitive

Infinitives are used to create fully-fledged nouns out of verbs or subordinate clauses. The main infinitive endings we are covering in this article are -ma, -mak and -ış. This topic is quite advanced, so this article assumes you have a good grasp on vowel harmony, noun and verb declensions, and basic sentences.

-ma and -mak do not have any difference in meaning. However, -ma is used in some declensions, and -mak is used in others, so they are not interchangable. A subordinate clause without a subject may be constructed using -ma/mak + case suffixes, and the logical subjects of these clauses are either the subject of the main clause, apparent from context, or is left unknown on purpose.

Meanwhile, in order to state the subject explicitly, -ma is used in conjunction with possessive suffixes. This formation will be elaborated later on.

-ış on the other hand, is used less extensively, and is used to stress the way of doing an action, rather than the action itself.

Formation
Both -ma and -mak obey the 2-way vowel harmony. There aren't any exceptions, and no consonant harmony either. -ış on the other hand, obeys 4-way vowel harmony, and the buffer consonant y is added if the verb ends in a vowel.

 * Okuma (verbal noun)
 * Okuma! (negative imperative)
 * Okumama (negative verbal noun)

Case suffixes and possessive suffixes may be added after either one, and the usage of these will be discussed below.

Declension for case
As stated above, -ma and -mak differ only in usage. -ma is mandatory in accusative, dative and genitive, while -mak is mandatory in nominative, locative and ablative.

In verbal sentences
Creating subjectless subordinate clauses are easy. The order of objects is the same as in a normal sentence, and simply suffixing the verb with the appropriate suffix is sufficient.

 * dün gece kitap okumak reading books last night
 * kalemini kaybetmek losing one's pencil

In order to turn a full sentence with a subject into a subordinate clause, the subject of the sentence is declined into genitive, and a possessive suffix is attached to -ma corresponding to the subject. Clauses like this can also be further declined for case.

In nominal and var/yok sentences
These suffixes, however cannot be attached to nouns. In order to create subordinate clauses from nominal sentences, the verb olmak is used.

 * Öğrenci olmak being a student
 * Benim bu kadar iyi olmam for me to be so good

In sentences with var, var is replaced with olma-.

 * Soğanın olması that there are onions
 * Üç çocuğumun olması to have three children

In sentences with değil and yok, both are replaced with olmama-

 * Senin yerinde olmamam for me to not be in your place
 * Hiç ümidimizin olmaması for us to not have any hope

-ma-/-mak in Nominative
A -ma/mak subordinate clause in nominative can function as the subject of a sentence...

...or, with copular markers, the predicate.
 * Ölmek beni çok korkutuyor. Dying scares me a lot.
 * Eve dönmen lazım. You need to return home.

 * En büyük amacım öğretmen olmaktı. My biggest goal was becoming a teacher.

The verb istemek takes a -mak clause in nominative. However, if a -ma- clause with a subject is used, or if the clause isn't directly before the verb, accusative is used instead.

 * Uyumak istiyorum. I want to sleep.
 * Konuşmayı çok istiyorum. I really want to talk.
 * Görünmeni istemiyorum. I don't want you to be seen.

The postposition için may be used in conjunction with -ma-/mak in nominative to express aim or purpose.

 * Görebilmek için gözlük takıyorum. I'm wearing glasses in order to see.
 * Senin rahat yaşaman için çok uğraşıyoruz. We are working very hard for you to live comfortable.

-ma-/-mak in nominative can also be used with other nominative postpositions.

 * Seni görmek gibi bir haz yok bu dünyada. Тhere is no pleasure in this world as good as seeing you.

-mak üzere means be about to ...

-mak zorunda means must, but this construction isn't used as extensively as in English.
 * Sıkıntıdan patlamak üzereyim. I'm about to explode out of boredom.
 * Sanırım ağlamak üzere. I think he's about to cry.

-mak yerine means instead of.
 * Acilen eve dönmek zorundasın. You must return home urgenty.
 * Uçağa binmek için kimliğinizi göstermek zorundasınız. You must show your ID to get in the plane.

 * Okula gitmek yerine evde dinleniyorum. I'm resting at home instead of going to school.
 * Vapura binmek yerine otobüse binelim. Let's take the bus instead of the ferry.

Declined -ma/mak
Declined versions of -ma/mak are used as objects of most verbs.

 * Eve dönmekte ısrar etti. (S)he insisted on returning home.
 * Seni görmeye geliyorum. I'm coming to see you.
 * Annenle konuşmayı düşünüyorum. I'm thinking about talking to your mom.

 * Borcumu ödemekten vazgeçtim. I changed my mind about paying back my debt.

In such cases, -masını may replace -mayı in informal speech in a small amount of verbs.

 * Bana Osmanlıca okumasını öğretsene. / Bana Osmanlıca okumayı öğretsene. Why don't you teach me how to read Ottoman Turkish?

Ablative -mak can be used in comperative sentences.

 * Evde kalmak, okula gitmekten daha iyi. Staying home is better than going to school.

-makla birlikte can mean although in formal speech.

 * Üç gün beklemekle birlikte, hiçbir şeyimiz kalmadı. Even though we waited 3 days, we have nothing left.

-maksızın can mean without in formal speech.

 * Bir hafta dinlenmeksizin çalıştık. We worked one week without resting.

-maktan öte/başka means other than.

 * Bu ödevi yapmaktan başka bir şeyimiz yok. We have nothing to do other than doing this homework.

-maktansa means rather than.

 * Eve dönmektense sinemaya giderim. I'd rather go to the cinema than return home.

There are many other use cases for declined -ma/mak, but they are too numerous to list here.

Bare -ma and -ma in Genitive
-ma without suffixes or in genitive is used in noun constructions.

 * eve dönme vakti time to go home
 * lokantaya gitme fikri idea of going to restaurant
 * kitap okumanın zararları disadvantages of reading books

-ış
The ending -ış is used less frequently than -ma/mak, and it can't replace -ma/mak. Just like -ma, infinitives with -ış may receive a possessive ending, and the subject of an -ış clause is in genitive. It is used to talk about either the manner of the action being performed, or a single occurrence of the action.

 * Kitabı okumanı beğendim. I liked that you are reading the book.
 * Kitabı okuyuşunu beğendim. I liked the way you are reading the book.

When it is used to talk about a single occurrence of an action, it is countable.

 * Bizim son üç görüşüşümüzde de bir şeyler oldu. Something happened in all three of our last meetings.

It shouldn't be confused with the derivational suffix -ış, and the reciprocal suffix -ış.

title: Turkish/Infinitive


text:
History of video games/Platforms/Bemani Pocket

Launch
Handheld game console series made by Konami and released in Japan beginning in 1998.

Legacy
The last models were released around 2001.

On March 31st, 2018 an April Fools Day tweet by the jubeat team jokingly announed a jubeat pocket.

Technology
Aside from at least 25 versions of the console being released, a wearable watch formfactor edition called the Bemani PopFlash was also released.

Games

 * A Hello Kitty game.


text:
User:Zsohl/sandbox/ZArchiver

A script that allows a user to select and archive multiple discussions to another page.

Personalized copy of Archy McArchface

The script will add an "ZA Switch" Button (under "more", in Vector Skin tab) to the top of the page near the "View history" button, similarly to how Twinkle does. Click this. Then each section will have [archive] next to its heading. Click [archive] for the sections that you want to select. Then click the large button at the bottom of the screen when you are done. Then Specify where to Archive in dialog box and Click Ok.

To install this script:

Add to Special:MyPage/common.js

Or Copy the line, then 'click here', paste the line, and Publish.

title: User:Zsohl/sandbox/ZArchiver


text:
User:Zsohl/sandbox/ZArchiver.js

$.when( mw.loader.using(['mediawiki.util','mediawiki.api']), $.ready).done( function {    if (mw.config.get("wgNamespaceNumber") % 2 == 0 && mw.config.get("wgNamespaceNumber") != 4)        // not a talk page and not project namespace        return;    if (mw.config.get("wgNamespaceNumber") == -1)        // is a special page        return;    $("head").append(" a.arkylink { font-weight:bold } .arkyhighlight { background-color:#D9E9FF } ");    var validSections = new Object;    var fromTos = new Object;    var wikiText = "";    var revStamp;    var startArchiveButton = mw.util.addPortletLink("p-cactions", "#", "ZA Switch", "pt-oeca", "Enter/exit the archival process", null, null);    var overlay = $(document.createElement("button"));    $(startArchiveButton).click(function(e) { $(".arkylink").click; $(".arky").toggle; $("#archivebutton").toggle; });   overlay.html("Archive all the selected threads")        .attr("id", 'archivebutton')        .css("position", 'sticky')        .css("bottom", 0)        .css("width", '100%')        .css("font-size", '200%');    $(document.body).append(overlay);    overlay.toggle;    overlay.click(function(e) { var numOfThreads, archiveTarget; var sections, archiveThis; var cutOffset, revisedPage; function cut(s, start, end) { return s.substr(0, start) + s.substring(end); }       cutOffset = numOfThreads = 0; revisedPage = wikiText; sections = $("a.arkylink").map(function {           return $(this).attr("data-section");        }); if (!(numOfThreads = sections.length)) return alert("No threads selected, aborting"); archiveTarget = prompt("Archiving " + numOfThreads + " threads: where should we move them to? (e.g. User talk:Sandbox/Archive 1)", mw.config.get("wgPageName")); if (!archiveTarget || archiveTarget == mw.config.get("wgPageName")) return alert("No archive target selected, aborting"); sections.each(function(i, n) {           revisedPage = cut( revisedPage, fromTos[n][0] - cutOffset, fromTos[n][1] - cutOffset );           cutOffset += fromTos[n][1] - fromTos[n][0];        }); archiveThis = sections.map(function {           return wikiText.substring(fromTos[this][0], fromTos[this][1]);        }).toArray.join(""); console.log("archive this:" + archiveThis); console.log("revised page:" + revisedPage); if (1) new mw.Api.postWithToken("csrf", {action: 'edit', title: mw.config.get("wgPageName"), text: revisedPage, summary: "Removed " + numOfThreads + " threads to " + archiveTarget + " By ZArchiver", basetimestamp: revStamp, starttimestamp: revStamp}) .done(function(res1) {               alert("Successfully removed threads from talk page");                console.log(res1);                new mw.Api.postWithToken("csrf", {action: 'edit', title: archiveTarget, appendtext: "\n" + archiveThis, summary: "Added threads from " + mw.config.get("wgPageName") + " By ZArchiver"})                    .done(function(res2) { alert("Successfully added threads to archive page"); })                   .fail(function(res2) { alert("failed to add threads to archive page. manual inspection needed."); })                   .always(function(res2) { console.log(res2); window.location.reload; });           })            .fail(function(res1) {                alert("failed to remove threads from talk page. aborting archive process.");                console.log(res1);                window.location.reload;            }); });   new mw.Api.get({action: 'parse', page: mw.config.get("wgPageName")}).done(function(dataShit) { new mw.Api.get({action: 'query', pageids: mw.config.get("wgArticleId"), prop: ['revisions'], rvprop: ['content', 'timestamp']}).done(function(shit) {           var rv;            rv = shit.query.pages[mw.config.get("wgArticleId")].revisions[0];            wikiText = rv["*"];            revStamp = rv['timestamp'];        }); $(dataShit.parse.sections) .filter(function(i, s) { return s.index == parseInt(s.index) }) .each(function(i, s) { validSections[s.index] = s }); for (var i in validSections) { i = parseInt(i); fromTos[i] = [ validSections[i].byteoffset, validSections.hasOwnProperty(i+1)?validSections[i+1].byteoffset:Infinity ];       }        $("#mw-content-text").find(":header").find("span.mw-headline").each(function(i, title) {            var header, headerNum, editSection, sectionNumber;            header = $(this).parent;            headerNum = header.prop("tagName").substr(1, 1) * 1; // wtf javascript            editSection = header.find(".mw-editsection"); // 1st child            sectionNumber = header.find(".mw-editsection a:last");            if (sectionNumber[0]) {               // Note: href may not be set.                sectionNumber = sectionNumber.attr("href") && sectionNumber.attr("href").match(/&section=(\d+)/);                if (sectionNumber)                    sectionNumber = sectionNumber[1];            } else // eg not a real section                 sectionNumber = undefined;            if (validSections.hasOwnProperty(sectionNumber))                editSection[0].innerHTML += "  [  " + headerNum + " && $(archivable[i]).hasClass(\"arkylink\") != $(this).hasClass(\"arkylink\")) { $(archivable[i]).click; } else { break; } }'>archive ]  "; });   }); });

title: User:Zsohl/sandbox/ZArchiver.js


text:
User:Zsohl/common.js

mw.loader.load( '/w/index.php?title=User:Zsohl/sandbox/ZArchiver.js&action=raw&ctype=text/javascript' ); // Backlink: User:Zsohl/sandbox/ZArchiver //syntax highlighter mw.loader.load('//www.mediawiki.org/w/index.php?title=MediaWiki:Gadget-DotsSyntaxHighlighter.js&action=raw&ctype=text/javascript');

title: User:Zsohl/common.js


text:
History of video games/Platforms/Lenovo IdeaCentre 5 17IAB7

History
The console was announced on Feburary 4th, 2022.

Technology
The console used a PC architecture.


text:
User talk:Zsohl/Archive 1

Welcome!
Welcome to Wikibooks, Zsohl!

 First steps tutorial Wikibooks is for collaborative development of free textbooks.

You do not need technical skills to contribute. You can easily change most books. Please introduce yourself, and let us know what interests you.

If you already contribute at other Wikimedia projects, our Wikimedia Orientation should quickly get you started. (Would you like to provide feedback on this message?)

  Getting help   Made a mistake?   Goodies, tips and tricks
 * Read the Using Wikibooks book for a friendly introduction to the project, or our help pages for more information.
 * You can get friendly help from the community in the user assistance room or our IRC channel.
 * Upload freely licensed files to Wikimedia Commons. You may request permission to upload fair use files locally. Please include author and source information and a non-free use rationale for non-free files.
 * You can restore a previously saved version.
 * Pages should follow the  naming convention.
 * Need to rename a page? Use the move tab (is available once your account is 4 days old - until then, ask for help).
 * To request a page be deleted, add to the top of the page.
 * Was a page you made deleted? Please read the deletion policy, and check the deletion log to find out why. Also check the RFD archives if applicable. You can request undeletion at WB:RFU, or ask the administrator who deleted the page.
 * Please fill in the edit summary and preview your edits before saving.
 * Sign your name on discussion pages by typing ~~~~
 * User scripts can make many tasks easier. Look at the Gadgets tab of my preferences; check off the boxes for the scripts you want, and hit save!

Thanks for your contributions -- Jules (Mrjulesd) 15:09, 4 February 2022 (UTC)

title: User talk:Zsohl/Archive 1


text:
Minecraft resource gathering/Concrete

Concrete cannot be found naturally in Minecraft. The only way to obtain it is to make it. Here's how.

Concrete powder
There are only three ingredients to craft Concrete Powder: 4 Sand, 4 Gravel, and any color of dye.

Turning it into concrete
You need to put the concrete powder in water to get concrete. And you're done!

title: Minecraft resource gathering/Concrete


text:
Minecraft resource gathering/Gold

Gold can be found in Minecraft at levels 32 or below, or at any level in Mesa biomes. It can be mined with a stone pickaxe or higher.

title: Minecraft resource gathering/Gold


text:
Minecraft resource gathering/Iron

Iron can be found at any level in Minecraft and can be mined with stone-tier pickaxes or higher.

Obtaining
Iron ore naturally occurs in ore veins at any level of the Overworld. It drops raw iron (ever since the "Caves and Cliffs" update. Otherwise, it drops Iron Ore), which can be smelted into Iron Ingots; Silk Touch is required to obtain iron ore after the Caves and Cliffs update. Blocks of raw iron can rarely be found in ore veins in deep caverns.

Iron golems drop 3–5 Iron Ingots when killed. Zombies have a very small chance of dropping a single Iron Ingot.

Iron Ingots can be found as chest loot for dungeons, abandoned mineshafts, bastion remnants, buried treasure, desert temples, End cities, jungle temples, Nether fortresses, pillager outposts, shipwrecks, strongholds, village toolsmiths, village armorers, village weaponsmiths, and woodland mansions. Iron Nuggets can be found as chest loot for bastion remnants, ruined portals, shipwrecks, and taiga village houses. Blocks of iron can be found as chest loot for bastion remnants.

Usage
Iron is mainly used to craft tools and armor.

title: Minecraft resource gathering/Iron


text:
Mathematical Proof and the Principles of Mathematics/Numbers/Natural numbers

Earlier, we constructed the natural numbers as sets, based on the axioms of set theory.

Now, we approach the natural numbers numbers from an arithmetic viewpoint, and we will see how we can derive the familiar notions of addition and multiplication from the successor operation. As we are moving away from set theory and into arithmetic, we will write $$\mathbb{N}$$ instead of $$\omega$$ to denote the natural numbers. Since we are about to introduce arithmetic, but haven't done so yet, we will provisionally in this section use S(n) instead of n + 1 to denote the successor of n.

Definitions
Definition Addition is defined from 0 and the successor function by the two rules

We will see first how this definition justifies our previous usage of a + 1 for the successor of a:

For every natural number a, one has

Induction principle
We will now show how all those properties of addition that you know from school can be derived from the definition.

The proofs rely on the induction principle. Recall the theorem:

Induction principle Suppose $$P(x)$$ is a property of natural numbers for which $$P(0)$$ holds, and such that for all natural numbers $$n$$ for which $$P(n)$$ holds, we have that $$P(n+ 1)$$ also holds. Then $$P(n)$$ holds for every natural number $$n$$.

When writing a proof using the induction principle, we call the proof of $$P(0)$$ the base case, and the proof of $$P(a + 1)$$ from $$P(a)$$ the induction step. In the proof of the induction step, we will use the fact that we can assume $$P(a)$$ and call that the induction hypothesis. Let's see this in action:

Addition with 0
Definition [Def. 1] states directly that 0 is a right identity, that is, that for any number a, a + 0 = a.

We prove that 0 is a left identity, that is, that 0 + a = a by induction on the natural number a.

Theorem For every natural number a, 0 + a = a.

For the base case a = 0, 0 + 0 = 0 by definition [Def. 1].

So we proceed to the induction step. We can assume the induction hypothesis, that 0 + a = a. Then So we have shown that 0 + S(a) = a from the assumption that 0 + a = a. So, we can conclude with the induction principle that 0 + a = a for every natural number a.

Associativity
Let us try our hand at a more complex example, the associativity property:

Theorem For any three natural numbers a, b and c, (a + b) + c = a + (b + c).

The first thing to note is that we have three numbers here, a, b and c. So we will fix a and b to be arbitrary numbers and we will apply the induction principle to c.

More precisely, the property $$P(c)$$ is $$(a + b) + c = a + (b + c)$$.

For the base case c = 0,

 * (a+b)+0 = a+b = a+(b+0)

Each equation follows by definition [Def. 1]; the first with a + b, the second with b.

Now, for the induction step. We assume the induction hypothesis, namely we assume that for some natural number c,

 * (a+b)+c = a+(b+c)

Then it follows,

In other words, $$P$$ holds for S(c). Therefore, the induction on c is complete.

Commutativity
Another important property that you will now from school is commutativity: When adding to numbers, the order doesn't matter.

Theorem For any two natural numbers a and b, a + b = b + a.

Since this is even more involved, we introduce a lemma first.

A helpful lemma
Lemma For any two natural numbers a and b, S(a) + b = S(a + b).

Let's perform induction on b, starting with the base case b = 0: And now the induction step: There we go - the induction on b is complete.

The proof of commutativity
From this brief digression we have earned ourselves a property that we can now use in the proof of commutativity.

We will proceed again by induction on b, starting with the base case:

Note how the base case is just a straightforward consequence of the identity property we showed above.

Now, suppose that for all natural numbers a, we have a + b = b + a. We must show that for all natural numbers a, we have a + S(b) = S(b) + a. We have

This completes the induction on b.

Multiplication
By now we introduced addition, and we derived all the basic properties we know about addition on the natural numbers. But arithmetic is more than addition, of course. So, just like we derived addition from the successor relation, we will derive multiplication from addition:

Definition Multiplication is derived from 0, addition and the successor function by the two rules We can quickly check mentally that those two equations are indeed true in our intuition of the natural numbers.

Since you are familiar now with how to approach problems using induction, we leave the proofs of commutativity and associativity to you.

Distributivity
Before we let you, though, let us go through one more property that arises from having two different operators present. It is known as distributivity.

Theorem For every three natural numbers a, b and c, $$a \cdot (b + c) = (a \cdot b) + (a\cdot c)$$.

We prove distributivity by induction on c:

Start with the base case: ...and proceed by induction: And this was to be proven.

Exercises
Now that you have seen various techniques of inductive argument in action, you should try and figure out the remaining properties of multiplication for yourself.

Try to write them up line by line, with the source of any identity you use to the right of the equation, just as it is laid out on this page.

To help you, there is a skeletal outline of the dependencies between the properties in the diagram on the right. It also includes derivations of the properties that we have already seen, as well as the definitions of multiplication and addition.

Good luck!


text:
Angry Birds

Angry Birds is a mobile game where you fling birds with different abilities at structures with green pigs in them.

General Gameplay

 * /Birds/
 * /Structure materials/
 * /Enemies/
 * How to Play

title: Angry Birds


text: User:Faster than Thunder/Expand with Translation


text:
Rust for the Novice Programmer/Tuples and Structs

Tuples and Structs
Let's say we wanted to return multiple values from a function. As an example, let's make a function that gets the minimum, maximum value as well as whether the mean(average) was less than a certain threshold out of a vector of numbers. We can't return a vector or array since the third value we want to return will be a boolean, while the other two will be integers and vectors and arrays can only store values of the same type. Thus, the easiest solution is to return a tuple.

A tuple is just a collection of values, organised with parentheses. So our function will be like So the function takes in a vector of input values and a threshold as an input, and returns a tuple of two integers and one boolean as an output. The reason to have this as one function rather than three separate functions is that we can calculate all three at the same time while only going through the numbers once. If we had three separate functions, it would be slower to go through all the numbers three times. The whole code is included for you to look at, examine and try out. I will note that the min and max must have a value to begin with so they are set to the maximum and minimum values initially so pretty much any value inside the vector will overwrite them. The main thing for tuples is that we construct a tuple at the end by putting it in brackets and return it from the function. The order is important as we use it to get the values out of the tuple. In our main function, there are two ways of getting values out. Here is the first way: Note that we include other things in the text inside the println! here to provide context to the different values. The value after the comma will be inserted where the {} is. We get the values out of the tuple by referring to their index in the tuple, again like arrays starting from 0. However, unlike arrays and vectors we cannot use variables to get a value out, so we couldn't do: This is called destructuring, since we mimic the structure of the tuple to get the values out into variables that act like any other variables. Which option you choose to get values out is up to you, and may depend on the situation for whatever is most appropriate.

However, there is a clear disadvantage to this. Imagine we wanted to also get other values like the mode, or the standard deviation(if you don't know what these are that's ok). A tuple that has too many values is unwieldy since we have to remember the order of all the values. The best way to have a more structured view of a set of data is called a struct. We construct/declare a struct like so: Since this is a declaration, we just specify the types that will be put inside. Then we change our getting values function to: Now this means in our main function we can do: Now we refer to the values inside the struct by the names we assigned to them after a dot, which should hopefully be useful to us, more memorable and easier to understand when reading.

Next: Enums


text:
Angry Birds/Birds

Every bird in Angry Birds has its own unique ability, which often affects the trajectory of their shots.
 * Red bird (Red) - Standard
 * Blue bird (Jay, Jake and Jim A.K.A. The Blues ) - Splits into 3 birds
 * Yellow bird (Chuck) - Speed up
 * Black bird (Bomb) - Explodes
 * White bird (Matilda) - Drops an egg bomb
 * Green bird (Hal) - Goes back like a boomerang
 * Terrence - Standard but bigger
 * Orange bird (Bubbles) - Inflates
 * Pink Bird (Stella) - Lifts things up with bubbles

title: Angry Birds/Birds


text:
Angry Birds/Structure materials

Angry Birds contains a variety of player destructible structures for the player to either avoid or leverage to their advantage.
 * Glass - Easily Broken
 * Wood - Moderately difficult to break.
 * Stone - Hard to break

title: Angry Birds/Structure materials


text: Category:Book:Angry Birds

title: Category:Book:Angry Birds


text: Angry Birds/Printable version

title: Angry Birds/Printable version


text:
Template:Cb

Cookbook:

title: Template:Cb


text:
Template:Cb/doc

Usage
An easy way to make cookbook links. To link to Cookbook:Tea, just insert:

which results in:

To do

 * Add a second parameter to display different text.

title: Template:Cb/doc


text:
User talk:Leaderboard/Archive 3

When did I get rollback rights?
Hi, I just recently checked Special:RecentChanges and noticed I can rollback edits. When was this added since I don’t remember getting rollback or reviewer rights - only uploader, and Special:CentralAuth confirms this. -Gifnk dlm 2020 If only Middle English Wikipedia could be saved (talk) 19:10, 23 November 2021 (UTC)

 * That's because you now have reviewer which is granted automatically. In fact, Special:CentralAuth actually confirms that, as you have, which is just reviewer. Leaderboard (discuss • contribs) 19:14, 23 November 2021 (UTC)
 * Oh really? I thought editor means at least 10 edits and 4 days. -Gifnk dlm 2020 If only Middle English Wikipedia could be saved (talk) 19:48, 23 November 2021 (UTC)
 * I think you're getting confused with autoconfirmed on the English Wikipedia. Leaderboard (discuss • contribs) 19:50, 23 November 2021 (UTC)
 * Yep that’s what I was thinking about. Thank you very much for clarifying! -Gifnk dlm 2020 If only Middle English Wikipedia could be saved (talk) 19:52, 23 November 2021 (UTC)

Merry Christmas 2021

Gifnk dlm 2020 (chat) wishes you a Very Merry Christmas and a Happy New Year. Hopefully this greeting has made your day a little better. Spread WikiLove by wishing another user Merry Christmas! Merry Christmas and Happy New Year.

Much love! -Gifnk dlm 2020 Merry Christmas 🎄(talk) 12:10, 24 December 2021 (UTC)

How we will see unregistered users
Hi!

You get this message because you are an admin on a Wikimedia wiki.

When someone edits a Wikimedia wiki without being logged in today, we show their IP address. As you may already know, we will not be able to do this in the future. This is a decision by the Wikimedia Foundation Legal department, because norms and regulations for privacy online have changed.

Instead of the IP we will show a masked identity. You as an admin will still be able to access the IP. There will also be a new user right for those who need to see the full IPs of unregistered users to fight vandalism, harassment and spam without being admins. Patrollers will also see part of the IP even without this user right. We are also working on better tools to help.

If you have not seen it before, you can read more on Meta. If you want to make sure you don’t miss technical changes on the Wikimedia wikis, you can subscribe to the weekly technical newsletter.

We have two suggested ways this identity could work. We would appreciate your feedback on which way you think would work best for you and your wiki, now and in the future. You can let us know on the talk page. You can write in your language. The suggestions were posted in October and we will decide after 17 January.

Thank you. /Johan (WMF)

18:14, 4 January 2022 (UTC)

I am nominating Minecraft resource gathering for deletion.
Edit filter issues.96.18.219.55 (discuss) 18:01, 8 January 2022 (UTC)

 * Try again. Leaderboard (discuss • contribs) 18:03, 8 January 2022 (UTC)
 * I did. It is a pending change,and you are an admin,so I think you can review said change to nom it for deletion.96.18.219.55 (discuss) 18:07, 8 January 2022 (UTC)
 * Indeed, but it shouldn't matter in practice since the default is to show the latest (unreviewed) version. BTW: not sure why that's even nominated for deletion, and make sure to notify the contributors. Leaderboard (discuss • contribs) 18:08, 8 January 2022 (UTC)
 * I did. Even the blocked IP vandal.96.18.219.55 (discuss) 18:12, 8 January 2022 (UTC)
 * I don't understand. Leaderboard (discuss • contribs) 18:13, 8 January 2022 (UTC)
 * OK,look at this editor. User:2600:387:5:803:0:0:0:3C I notified this editor because he contributed to the book. And he's a blocked IP vandal. Was that a good idea?96.18.219.55 (discuss) 18:16, 8 January 2022 (UTC)
 * Probably not necessary, though there is nothing wrong with notifying banned users. Leaderboard (discuss • contribs) 18:17, 8 January 2022 (UTC)
 * Here is why it is nominated for deletion. This and most of the subpages were low-quality and not helpful. Example: Using the former revision of the Meat sub-page,I could see a Minecraft newbie crafting a weapon and then attacking a creeper thinking it will drop meat,then said player blows up because creepers blow up. 96.18.219.55 (discuss) 18:23, 8 January 2022 (UTC)

I am making a proposal to amend Strategy guides.
It is basic,not really !voted on yet,I will make amendments if consensus says "Amend",however each amendment needs community consensus.96.18.219.55 (discuss) 23:52, 9 January 2022 (UTC)

 * I don't understand the proposal. It seems that you initially intended to propose disallowing strategy guides, but then removed that option - so all I see are "Keep" (which is default) and "Amend" (which anyone can do per policy and doesn't need a "proposal"). Leaderboard (discuss • contribs) 04:36, 10 January 2022 (UTC)
 * I do not like Strategy guides,so I am requesting this amendment policy here. 96.18.219.55 (discuss) 16:21, 10 January 2022 (UTC)
 * Your link points to nothing. Leaderboard (discuss • contribs) 16:25, 10 January 2022 (UTC)
 * That is because it cannot be created,because of the edit filter blocking external links,can you copy over Strategy guides to the place the link goes to? 96.18.219.55 (discuss) 16:28, 10 January 2022 (UTC)
 * No, because you're creating the page at an inappropriate location. Propose your changes in the talk page of the policy page. Also seriously consider creating an account; that way, the edit filter will bother you far less. Leaderboard (discuss • contribs) 16:34, 10 January 2022 (UTC)
 * Copy over the policy to the talk page of said policy,bottom section.96.18.219.55 (discuss) 16:43, 10 January 2022 (UTC) Edit filter issues. 96.18.219.55 (discuss) 16:43, 10 January 2022 (UTC)
 * Done. Leaderboard (discuss • contribs) 16:47, 10 January 2022 (UTC)
 * Hi. I am that IP above.Tgregtregretgtr (discuss • contribs) 21:51, 10 January 2022 (UTC)

I made an account.
This is that IP above,but has an account.Tgregtregretgtr (discuss • contribs) 21:30, 10 January 2022 (UTC)

Editing news 2022 #1
Read this in another language • Subscription list for this multilingual newsletter

The New topic tool helps editors create new ==Sections== on discussion pages. New editors are more successful with this new tool. You can read the report. Soon, the Editing team will offer this to all editors at the 20 Wikipedias that participated in the test. You will be able to turn it off at Special:Preferences.

Whatamidoing (WMF) 18:43, 2 May 2022 (UTC)

Editing news 2022 #2
Read this in another language • Subscription list for this multilingual newsletter The new [] button notifies people when someone replies to their comments. It helps newcomers get answers to their questions. People reply sooner. You can read the report. The Editing team is turning this tool on for everyone. You will be able to turn it off in your preferences.

–Whatamidoing (WMF) 23:35, 29 August 2022 (UTC)

I saw your comment after closing
Hi, Leaderboard, I noticed that the page was imported and a soft redirect was created, so I decided to close the discussion myself. I noticed your comment only after closing it. Sorry for the inconvenience. - 🇺🇦 Слава🇺🇦Україні 🇺🇦 Героям🇺🇦Слава🇺🇦 (talk)🇺🇦 08:42, 16 November 2022 (UTC)

Question about edit filters
Hi @Leaderboard! I've been poking around the edit filter pages to learn more about them, and I was wondering why so many of them are set such that they are private and cannot be viewed (I do understand why they are set to restrict editing of course). I hope this doesn't come across as too pushy or invasive—I'm just very interested in the details of how filtering and moderation work on a technical level, and I'm curious about why some information isn't public. Cheers :) —Kittycataclysm (discuss • contribs) 17:27, 31 December 2022 (UTC)

 * (Also, I just realized what today's date is—Happy New Year!!) —Kittycataclysm (discuss • contribs) 17:28, 31 December 2022 (UTC)
 * A filter is basically code that defines some conditions for it to trigger. For instance, one can write code that looks for anyone trying to creating a page with less than 5 edits, or adding content with a specific keyword to a page.
 * Once we have defined a filter, we need to decide what to do if a user does something that triggers a filter (in the above example, creating a page with less than 5 edits). These can range from simply tagging, giving the user a warning (i.e, allowing once the warning is acknowledged), preventing the edit from going through, or blocking the user. At Wikibooks, we make use of all four options. We can also choose to simply log the attempt (i.e, do nothing from the user's point of view); that's used when we want to test a filter to see if it works as expected.
 * Regarding why many of them look private: this is because they are used as part of our antivandalism and anti-spam efforts. To allow anyone to view those filters would mean that someone would be able to use the information in the filter to find out what it does, and use that against the project (for example by using different keywords to bypass the filter). Hence these filters can only be viewed by admins (for local filters), and Meta admins/users with abuse filter helper or higher for global filters (which affect every project in Wikimedia).
 * Also BTW: not sure where you are, but it's not 2023 where I'm at (GMT +3). Leaderboard (discuss • contribs) 18:05, 31 December 2022 (UTC)
 * @ and Leaderboard: apologies for chiming in, but happy new year (it's also 2023 where I am (UTC+11)) to both of you too. Let's hope that 2023 is better than 2022. SHB2000 (discuss • contribs) 23:00, 31 December 2022 (UTC)
 * Thank you so much, that makes sense! —Kittycataclysm (discuss • contribs) 16:59, 1 January 2023 (UTC)
 * Thank you so much, that makes sense! —Kittycataclysm (discuss • contribs) 16:59, 1 January 2023 (UTC)

Question about temp adminship
Hello! I wanted to check with you since you're the one who suggested that I apply for temp adminship: how can we determine whether consensus is reached regarding admin permissions? Administrators doesn't have a clear answer, but Xania suggested that I should be patient when I asked about next steps, and I wanted to see what you think as well. Cheers! —Kittycataclysm (discuss • contribs) 22:57, 28 December 2022 (UTC)

 * If MarcGarver doesn't return by Jan 1, I think a request (or two) should be made on SRP as a last resort. SHB2000 (discuss • contribs) 05:19, 29 December 2022 (UTC)
 * Xania is correct; there is not much we can do other than wait (which could be up to a few months). While we are relatively generous with allowing global rights users to use them here, changing user rights isn't one of them.
 * Posting on Meta is not going to be of use; they'll simply tell you to wait. As noted above, stewards are very careful not to change rights on a wiki where a local user can do so, unless that person has been inactive for an extended period of time.
 * The other thing I had was to have more bureaucrats on this wiki; even then, only MarcGraver can promote such a user. Leaderboard (discuss • contribs) 05:42, 29 December 2022 (UTC)
 * Would you mind if I nominate you for bureaucrat? Although it probably has little effect in regards to my and Kittycataclym's RfA, having two bureaucrats should prevent a situation like this again. SHB2000 (discuss • contribs) 06:30, 29 December 2022 (UTC)
 * The problem is more that I am unsure that I would get the support of the community - remember those users that ultimately drove me out of the project entirely - as can be seen on my userpage. I don't want this to be like my CheckUser attempt, which was painful and an embarrassment to me. Leaderboard (discuss • contribs) 17:42, 29 December 2022 (UTC)
 * ←Raktáros I’m going back in my office today for a new update with my help for my health insurance health care provider help help for insurance help insurance health help insurance help for insurance insurance health health help help for → 2001:4C4C:19DF:4600:C4D9:93F4:AA24:E058 (discuss) 20:56, 5 January 2023 (UTC)
 * Got it, thank you! I agree that it seems like we might benefit from an additional bureaucrat on Wikibooks. @Leaderboard, do you have any thoughts on whether any current long-term admins would be suited for and interested in promotion to bureaucrat? Even if it wouldn't be able to happen immediately, it seems at least beneficial to get the process started in the name of progress and prophylaxis. I'm optimistic :) —Kittycataclysm (discuss • contribs) 17:58, 30 December 2022 (UTC)
 * , I think Xania is the only other option (they are active from time to time though). I don't think the others are active enough. I would have nominated myself if not for the concern I raised in my response to SHB2000. Leaderboard (discuss • contribs) 18:01, 30 December 2022 (UTC)
 * It's much easier to have no bureaucrats. Then you simply ask one of the 40 odd Stewards, who are always available, to make the change. MarcGarver (discuss • contribs) 22:35, 5 January 2023 (UTC)

Editing news 2023 #1
Read this in another language • Subscription list for this multilingual newsletter

This newsletter includes two key updates about the Editing team's work:

 * 1) The Editing team will finish adding new features to the Talk pages project and deploy it.
 * 2) They are beginning a new project, Edit check.

Talk pages project

The Editing team is nearly finished with this first phase of the Talk pages project. Nearly all new features are available now in the Beta Feature for.

It will show information about how active a discussion is, such as the date of the most recent comment. There will soon be a new "" button. You will be able to turn them off at Special:Preferences. Please tell them what you think.

An A/B test for on the mobile site has finished. Editors were more successful with. The Editing team is enabling these features for all editors on the mobile site.

New Project: Edit Check

The Editing team is beginning a project to help new editors of Wikipedia. It will help people identify some problems before they click "". The first tool will encourage people to add references when they add new content. Please watch that page for more information. You can join a conference call on 3 March 2023 to learn more.

–Whatamidoing (WMF) (User talk:Whatamidoing (WMF)) 23:18, 22 February 2023 (UTC)

Template:Lang broken
It looks like your importing of Template:Lang and Module:Lang on April 2nd broke all the existing calls to that template. How can this be fixed? - dcljr (discuss • contribs) 04:17, 7 April 2023 (UTC)

 * By importing more modules from Wikipedia. I think that has been fixed. Leaderboard (discuss • contribs) 04:46, 7 April 2023 (UTC)
 * OK, looks good now. Thanks. - dcljr (discuss • contribs) 05:06, 7 April 2023 (UTC)

dark mode
i want to add dark mode for myself by this, but showing some error can you help about this Kuldeepburjbhalaike (discuss • contribs) 11:24, 11 April 2023 (UTC)

 * , what's the error? Leaderboard (discuss • contribs) 11:50, 11 April 2023 (UTC)
 * I want to add to it by my common.js but it showing to protect from spammers you cannot edit this page or something like that (so now i added in my .css) Kuldeepburjbhalaike (discuss • contribs) 11:54, 11 April 2023 (UTC)
 * , you were hit by an abuse filter. As a result, I've manually added it to your common.js - but note that this may conflict with your common.css so let me know if you want that deleted. Leaderboard (discuss • contribs) 11:57, 11 April 2023 (UTC)
 * It will delete if it will do anything wrong. Thanks Kuldeepburjbhalaike (discuss • contribs) 12:02, 11 April 2023 (UTC)

Need your input on a policy impacting gadgets and UserJS
Dear interface administrator,

This is Samuel from the Security team and I hope my message finds you well.

There is an ongoing discussion on a proposed policy governing the use of external resources in gadgets and UserJS. The proposed Third-party resources policy aims at making the UserJS and Gadgets landscape a bit safer by encouraging best practices around external resources. After an initial non-public conversation with a small number of interface admins and staff, we've launched a much larger, public consultation to get a wider pool of feedback for improving the policy proposal. Based on the ideas received so far, the proposed policy now includes some of the risks related to user scripts and gadgets loading third-party resources, best practices for gadgets and UserJS developers, and exemptions requirements such as code transparency and inspectability.

As an interface administrator, your feedback and suggestions are warmly welcome until July 17, 2023 on the policy talk page.

Have a great day! Samuel (WMF), on behalf of the Foundation's Security team 23:02, 7 July 2023 (UTC)

title: User talk:Leaderboard/Archive 3


text:
Wikibooks:Reading room/Archives/2021/December

Copy button
The Wikibook I am writing will have a lots of blocks of preformatted text (computer code) that readers may want to copy and paste. I'm looking unsuccessfully for a template that would add a button to, or associate with, each block of preformatted code so that the reader could easily copy the code to their clipboard. Is that possible, and where could I ask to get it made? Derek Andrews (discuss • contribs) 11:59, 18 December 2021 (UTC)

Community Wishlist Survey 2022 is coming. Help us!
The Community Wishlist Survey 2022 starts in less than two weeks (Monday 10 January 2022, 18:00 UTC). We, the team organizing the Survey, need your help.

Only you can make the difference

How many people will hear and read about the Survey in their language? How many will decide to participate? Will there be enough of you to vote for a change you would like to see? It all depends on you, volunteers.

Why are we asking?

 * We have improved the documentation. It's friendlier and easier to use. This will mean little if it's only in English.
 * Thousands of volunteers haven't participated in the Survey yet. We'd like to improve that, too. Three years ago, 1387 people participated. Last year, there were 1773 of them. We hope that in the upcoming edition, there will be even more. You are better than us in contacting Wikimedians outside of wikis. We have prepared some images to share. More to come.

What is the Community Wishlist Survey? It's an annual survey that allows contributors to the Wikimedia projects to propose and vote for tools and platform improvements. Long years of experience in editing or technical skills are not required.

Thanks, and be safe and successful in 2022! SGrabarczuk (WMF) (talk) 03:15, 29 December 2021 (UTC)

Software Screen grabs
This is probably more appropriate at Commons....but: For a book here, if I (for example) post an image of a screen grab from a piece of software's dialogue box.....does that fit within policy? Those can be helpful at times. --Buddpaul (discuss • contribs) 18:13, 29 December 2021 (UTC)
 * The material is likely copyright, or not available under a compatible free license. Therefore you cannot use it here unless it fits the requirements of fair use - minimal use, clear justification, no other way of communicating the information. E.g., if it is just to make the book look nice, you can't use it. By the way, Commons does not accept fair use - to use it here you'd need to be granted local upload rights which would include a review to ensure you understood the rules. MarcGarver (discuss • contribs) 20:24, 29 December 2021 (UTC)
 * Okie dokie......that helps a lot. But: what if the software itself is Open Source??--Buddpaul (discuss • contribs) 18:07, 30 December 2021 (UTC)
 * If it is open source and the license is compatible with Commons, then you can upload it. The upload process at Commons guides one through the process of ensuring the license is acceptable. MarcGarver (discuss • contribs) 23:56, 31 December 2021 (UTC)

Upcoming Call for Feedback about the Board of Trustees elections

 * You can find this message translated into additional languages on Meta-wiki.
 *  m:Special:MyLanguage/Wikimedia Foundation Board of Trustees/Call for feedback:2022 Board of Trustees election/Upcoming Call for Feedback about the Board of Trustees elections •

The Board of Trustees is preparing a call for feedback about the upcoming Board Elections, from January 7 - February 10, 2022.

While details will be finalized the week before the call, we have confirmed at least two questions that will be asked during this call for feedback:

 * What is the best way to ensure fair representation of emerging communities among the Board?
 * What involvement should candidates have during the election?

While additional questions may be added, the Movement Strategy and Governance team wants to provide time for community members and affiliates to consider and prepare ideas on the confirmed questions before the call opens. We apologize for not having a complete list of questions at this time. The list of questions should only grow by one or two questions. The intention is to not overwhelm the community with requests, but to provide notice and welcome feedback on these important questions.

Do you want to help organize local conversation during this Call?

Contact the Movement Strategy and Governance team on Meta, on Telegram, or via email at msg(_AT_)wikimedia.org.

Reach out if you have any questions or concerns. The Movement Strategy and Governance team will be minimally staffed until January 3. Please excuse any delayed response during this time. We also recognize some community members and affiliates are offline during the December holidays. We apologize if our message has reached you while you are on holiday.

Best,

Movement Strategy and Governance Team --Mervat (WMF) (discuss • contribs) 20:11, 23 December 2021 (UTC)


text:
Practice Problems in LOLGraphics/Problem I - Calculator

Namer is a street cat from Beer Sheva, Israel. Like all street cats, it’s his dream to reach the Kingdom of Cats - a mansion with a beautiful garden on a floating island with everything a cat can ever wish for. However, not every cat is eligible to live in the Kingdom of Cats - cats have to first pass a test in LOLGraphics to be allowed to even enter the Kingdom. A cat that enters the Kingdom will feast with the King of Cats and then will pass another test in order to join the Order of the Tiger. Only members of the Order are allowed to live in the Kingdom of Cats.

Each year, a hot air balloon only visible to cats departs from a random city in the world. This year it departs from Istanbul. Namer left Beer Sheva towards the sea where he met a cat with a boat. The cat said that he doesn’t know how to program, and that he will take Namer free of charge if he programs a calculator in LOLGraphics for him. He also gave a page which reads as following:

If you program a calculator in LOLGraphics for me, I will take you to Istanbul for free. My requirements for the LOLGraphics calculator are as following: First, the calculator should ask the user to enter two numbers, and then a mathematical operation (addition, subtraction, multination, division), and then it will print the result. For division, since LOLGraphics doesn’t support fractions, I want to see the integer result and the reminder. For 99/3 it will print 33 and 0, for 15/7 it will print 2 and 1.


text:
Minecraft resource gathering/Preface

This book is intended to give instructions on the best ways to gather resources, like diamonds, in Minecraft.

Versions
The book isn’t meant to be version specific. It gives info regarding older versions as well. For example, the page about diamonds will describe the best strategies for mining diamonds both prior to the Caves and Cliffs update and after.

title: Minecraft resource gathering/Preface


text: Category:Wikipedia message box parameter needs fixing


text:
Practice Problems in LOLGraphics/Problem II - Greek Numerals

Namer has successfully written a calculator in LOLGraphics and got a free ride to Istanbul. Near the port, he met a cat from the Order of the Tiger who said he will tell the way to the launch location if Namer can write a program in LOLGraphics that converts Arabic Numerals to Greek Numerals. He also gave a page that reads as following: In order to prove that you are worthy to see the hot air balloon of His Majesty King Battlecat III, you need to first write a code that converts Arabic Numerals to Greek Numerals. Here is a table of Greek Numerals (there are multiple variations, we will be using the modern one for typability): So the number 7777 will be written 	,ΖΨʹΟʹΖʹ. Assume the number is smaller than 9999 but bigger than 1.


text:
Category:Mint recipes

Recipes involving.

title: Category:Mint recipes


text:
Category:Turmeric recipes

Recipes involving.

title: Category:Turmeric recipes


text:
Category:Black pepper recipes

Recipes involving.

title: Category:Black pepper recipes


text:
Category:Salt recipes

Recipes involving.

title: Category:Salt recipes


text:
User:Lahpemed

User:Lahpemed

title: User:Lahpemed


text:
Cookbook:Oyster sauce

Oyster sauce is a dark, savory condiment derived from oysters. Traditionally it is produced by reducing the liquid left over after boiling oysters, but many modern oyster sauces include some combination of sugar, salt, caramel color, oyster flavoring, and cornstarch. It is a staple in many cuisines, including Chinese, Thai, Vietnamese, and Malay.

Variations
Vegetarian substitutes for oyster sauce exist, and these use alternate ingredients such as mushrooms to produce the desired savory flavor profile.

title: Cookbook:Oyster sauce


text:
User:Zsohl/huggle.yaml.js

--- enable: true version: "3.4.10 build: 3880 3.4.10" report-summary: "Reporting $1" confirm-multiple: false confirm-talk: true confirm-self-revert: true confirm-whitelist: true revert-on-multiple-edits: true automatically-resolve-conflicts: true software-rollback: false enforce-months-as-headers: true history-load: true on-next: 1 delete-edits-after-revert: true skip-to-last-edit: false preferred-provider: 2 remove-oldest-queue-edits: false truncate-edits: false talkpage-freshness: 20 remove-after-trusted-edit: true retrieve-founder: false display-title: false check-tp: true manual-warning: false summary-mode: false automatic-reports: false han-html: false han-display-user-talk: true han-display-bots: false han-display-user: true watchlist: "preferences" automatically-group: false queue-id: "default" page-empty-queue: "" enable-max-score: false max-score: 0 enable-min-score: false min-score: 0 automatic-refresh: true automatically-watchlist-warned-users: false shortcut-hash: "0b4f613d34d264a3ca0909ebc34c1ed0" show-warning-if-not-on-last-revision: true number-dropdown-menu-items: true insert-edits-of-rolled-user-to-queue: true confirm-on-recent-warning: true recent-warning-time-span: 120 confirm-warning-on-very-old-edits: true skip-warning-on-confirm: true queues:
 * 1) // This is a configuration of huggle, do not change it unless you know what you are doing.
 * 1) // Last version of huggle that wrote into this configuration file (sanity check)
 * 1) // This option will change the behaviour of automatic resolution, be carefull
 * 1) // Get original creator of every page so that you can G7 instead of reverting the page
 * 1) // Periodically check if you received new messages and display a notification box if you get them
 * 1) // HAN
 * 1) // Whether edits made by same user should be grouped up together in page
 * 1) // Location of page (wiki page name, for example WP:Huggle) that should be displayed when you hit next and queue is empty. Leave empty for default page.
 * 1) // If true you will not warn users who received a warning recently
 * 1) // If warning was sent less than N seconds ago it's considered too recent
 * 1) // If true, the options above will not generate confirmation, but instead will be silently accepted (warning will not be sent)

title: User:Zsohl/huggle.yaml.js


text:
User talk:M Bash Ne

Welcome
Welcome, M Bash Ne!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. - 📜 GIFNK 📖 DLM💻MMXX🏰 (TALK🎙 | CONTRIBS) 07:51, 8 February 2022 (UTC)

title: User talk:M Bash Ne


text:
NiwEnglisc/Bible/Gekyndbok

Kapitel 1
Þe Frymþ
 * 1) In þem Frymþ schop Godd þie Rodern and þie Erðe.
 * 2) Nu was þie Erðe unheiw and lær, Þiestre was ofer þer Ruse þer Diepþ, and þe Gast Goddes swaf ofer þer Ruse þer Water. Þe ærste Daȝ: Lieȝht
 * 3) And Godd kwaþ, "Werðe Leoȝht!" and þa warþ Lieȝht.
 * 4) And Godd saw þat þat Leoȝht god was, and schedd þat Lieȝht of þer Þiestre.
 * 5) And Godd heȝht þat Leoȝht "Daȝ," and þie Þiestre heȝht he "Naȝht."  And þa was Æfen, and þa was Morgen - þe ærste Daȝ. Þe tweȝnþe Daȝ: Rodor
 * 6) And Godd kwaþ, "Werðe ane Ƕalfe betwienen þen Watern, Water of Water to schaden."
 * 7) So schop Godd þie Ƕalfe and schedd þat Water under þer Ƕalfe of þem Water bufen her. And it warþ so.
 * 8) And Godd heȝht þie Ƕalfe "Lyft."  And þa was Æfen, and þa was Morgen - þe tweȝnþe Daȝ. Þe þridde Daȝ: Drieȝ Grund
 * 9) And God kwaþ, "Werðe þat Water under þer Lyft to anem Stedd gegæderd, and læt drieȝen Grund ætiewen." And it warþ so.
 * 10) And Godd heȝht þen drieȝen Grund "Land," and þie gegaderden Water heȝht he "Sæen."  And Godd saw þat it god was.
 * 11) And Godd kwaþ, "Aspriete þat Land Grownes: sædberende Planten and Treen on þem Lande þe Ofet mid Sæden þærin bereþ, æfter hjeren syndrigen Kynnen on þer Erðe."  And it warþ so.
 * 12) Þat Land asprot Grownes: sædberende Planten æfter hjeren Kynnen and ofetberende Tree mid Sæden þærin æfter hjeren Kynnen.  And Godd saw þat it god was.
 * 13) And þa was Æfen, and þa was Morgen - þe þridde Daȝ. Þe Fierþe Daȝ: Sunne, Mone, Sterren
 * 14) And Godd kwaþ, "Werðeþ Lieȝhter in þer Ƕalfe þer Lyft, þen Daȝ of þer Naȝht oftoschaden, and werðeþ hje to Taknen þeȝnen, godkunde Teimen, and Dæȝe, and Ȝære to gemarken,
 * 15) and werðeþ Lieȝhter in þer Ƕalfe þer Lyft, for on þer Erðe to lieȝhten." And it warþ so.
 * 16) And Godd schop þwa greate Lieȝhter - þat grieter Leoȝht for þen Daȝ to walden and þat læsse Leoȝht for þie Naȝht to walden.  He schop eak þie Sterren.
 * 17) And Godd stallde hje in þie Ƕalfe þer Lyft for on þer Erðe to lieȝhten,
 * 18) for þen Daȝ and þie Naȝht to walden, and for þat Leoȝht of þer Þiestre to schaden.  And Godd saw þat it god was.
 * 19) And þa was Æfen, and þa was Morgen - þe fierþe Daȝ. Þe Feifte Daȝ: Fische and Fugeln
 * 20) And Godd kwaþ, "Tieme þat Water mid libbenden Wiȝhten, and fliegen Fugeln bufen þer Erðe þwers þie Ruse þer Ƕalfe þer Lyft."
 * 21) So Godd schopp þie greaten Orken þer Sæ and geƕilce libbende Wiȝht, þærmid þat Water tiemþ and þærin ƕirfþ, æfter hjeren Kynnen, and geƕilcen fyðerden Fugel æfter his Kynn. And Godd saw þat it god was.
 * 22) And Godd blesste hje and kwaþ, "Gewæstmbereþ and maniȝfaldeþ and fylleþ þat Water in þen Sæen, and maniȝfaldeþ þie Fugeln on þer Erðe.
 * 23) And þa was Æfen, and þa was Morgen - þe feifte Daȝ. Þe Sixte Daȝ: Wiȝhte on þem Lande
 * 24) And Godd kwaþ, " Tieme þat Land mid libbenden Wiȝhten æfter hjeren Kynnen: Feoȝh, þie Wiȝhte þe andlang þes Grundes ƕerfeþ, and þie wilden Deer, geƕilc æfter his Kynn."  And it warþ so.
 * 25) And Godd schop þie wilden Deer æfter hjeren Kynnen, þat Feoȝh æfter his Kynn, and alle þie Wiȝhte, þe andlang þes Grundes ƕerfeþ, æfter hjeren Kynnen.  And God saw þat it god was.
 * 26) And Godd kwaþ, "Scheppeþ wiȝ Mannkynn in userer Anleiknes, and walden hje þie Fische in þer Sæ, þie Fugeln in þer Lyft, þat Feoȝh, alle wilden Deer, and alle Wiȝhte, þe andlang þes Grundes ƕerfeþ."
 * 27) So schopp Godd Mannkynn in seiner Anleiknes, in þer Anleiknes Goddes schop he hje; werlic and weiflic schop he hje.
 * 28) And Godd blesste hje and hjem to kwaþ, "Wæstmbæreþ and maniȝfaldeþ; fylleþ þie Erðe and wældeþ schie.  Waldeþ þie Fisch in þer Sæ and þie Fugeln in þer Lyft and geƕilce libbenden Wiȝhte þe on þem Grunde ƕerfeþ."
 * 29) And Godd kwaþ, "Gelokeþ! Ic habe ȝu geƕilce sædberende Plante on þer Ruse þer halen Erðe gegefen, and geƕilce Tree þe sædberende Ofet þærin bereþ.  Hje beeþ ȝuer to Foden.
 * 30) And to allen þen Deeren þer Erðe and allen þen Fugeln in þer Lyft and allen Wiȝhten þe andlang þes Grundes ƕerfeþ - ælce Wiȝht þe þen Æðem Feorȝhes hafþ - ic habe geƕilce grœne Plante to Foden gegefen." And it warþ so.
 * 31) And Godd saw all þe he schop, and it was sweiðe god.  And þa was Æfen, and þa was Morgen - þe sixte Daȝ.

Kapitel 5 - Of Adam oþ Noah

 * 1) Þisse is þie Bok Adames Mæȝrake.  In þem Dæȝ þe Godd Mann schop, worȝhte he hin in his Andleiknes.
 * 2) He schop hje Wæpnedmann and Weifmann and hje blesste. And he namde hje "Adam" (Mannkynn), þa he hje schop.
 * 3) And Adam lifde twahundþrittiȝ (230) Ȝære, and kennde anen Son in seiner Andleiknes, and heȝht hin Seth.
 * 4) Æfterþem he geboren warþ, lifde Adam sefenhundred (700) Ȝære and kennde oðre Sœne and Dœȝhter.
 * 5) Allnunge lifde Adam neiȝnhundþrittiȝ (930) Ȝære, and þa starf he.
 * 6) And Seth lifde twahundfeif (205) Ȝære, and kennde Enosch.
 * 7) And Seth lifde sefenhundsefen (707) Ȝære, æfterþem he Enosch kennde, and kennde oðre Sœne and Dœȝhter.
 * 8) Allnunge lifde Seth neiȝnhundtwelf (912) Ȝære, and þa starf he.
 * 9) (Year 1, Adam was 0 years old.  Add 230, and Seth was born in 231; add 205, and you get 436 when Enosch was born)
 * 10) Þa Enosch hundneiȝntiȝ Ȝære lifde, kennde he Kenan.
 * 11) And Enosch lifde sefenhundfeiftien (715) Ȝære and kennde oðre Sœne and Dœȝhter.
 * 12) Allnunge lifde Enosch neiȝnhundfeif (905) Ȝære, and þa starf he.
 * 13) And Kenan lifde hundsefentiȝ (170) Ȝære, and kennde Mahalalel.
 * 14) And Kenan lifde sefenhundfiertiȝ (740) Ȝære, æfterþem he Mahalalel kennde, and kennde oðre Sœne and Dœȝhter.
 * 15) Allnunge lifde Kenan neiȝnhundtien (910) Ȝære, and þa starf he.
 * 16) And Mahalalel lifde hundfeifandsixtiȝ (165) Ȝære, and kennde Jared.
 * 17) And Mahalalel lifde sefenhundþrittiȝ (730) Ȝære, æfterþem he Jared kennde, and kennde oðre Sœne and Dœȝhter.
 * 18) Allnunge lifde Mahalalel aȝhthundfeifandneiȝntiȝ (895) Ȝære, and þa starf he.
 * 19) And Jared lifde hundredtwaandsixtiȝ (162) Ȝære, and kennde Enoch.
 * 20) And Jared lifde aȝhthundred (800) Ȝære, æfterþem he Enoch kennde, and kennde oðre Sœne and Dœȝhter.
 * 21) Allnunge lifde Jared neiȝnhundtwaandsixtiȝ (962) Ȝære, and þa starf he.
 * 22) And Enoch lifde hundfeifandsixtiȝ (165) Ȝære, and kennde Methuselah.
 * 23) And Enoch geng trewlice mid Godde þriehundred (300) Ȝære, and kennde oðre Sœne and Dœȝhter.
 * 24) Allnunge lifde Enoch þriehundfeifandsixtiȝ (365) Ȝære.
 * 25) Enoch geng trewlice mid Godde; þa was he nan mær, forþem God hin ætnaam.
 * 26) And Methuselah lifde hundredsefenandaȝhtiȝ (187) Ȝære, and kennde Lamech.
 * 27) And Methuselah lifde sefenhundtwaandaȝhtiȝ (782) Ȝære, and kennde oðre Sœne and Dœȝhter.
 * 28) Allnunge lifde Methuselah neiȝnhundneiȝnandsixtiȝ (969) Ȝære, and þa starf he.
 * 29) And Lamech lifde hundredtwaandaȝhtiȝ (182) Ȝære, and kennde anen Son.
 * 30) He namde hin Noah, and kwaþ, "He werðeþ usic in þem Arfoþ and swærer Besige userer Hænde angestalld be þem fram Driȝhten(YHWH) gewergden Grund frœfern."
 * 31) And Lamech lifde feifhundfeifandsixtiȝ (565) Ȝære, and kennde oðre Sœne and Dœȝhter.
 * 32) Allnunge lifde Lamech sefenhundþreeandfeiftiȝ Ȝære (753), and þa starf he.
 * 33) And Noah was feifhundred (500) Ȝære, and kennde Shem, Ham, and Japheth. (Shem at 502).

Kapital 5 Noten

 * Bidde markeþ þat þe Septuagint hafþ oðre Reime in Stedden for Adam (230 instedd 130), Seth (205 instedd 105), Enosch (190 instedd 90). Þie Reime wurden fram þen Phariseen gewrixeld, forþem hje þie Witegung Jesus onsakan wollden, þe sæȝde þat þe Hælend in þem feiften Jarþusend kommen wirþ.  If þie Reime gewrixeld wurden, þa warþ he in þem wrangen Jarþusend geboren, and þus was noȝht þe Hælend.

 * Adam was in þem 1. Ȝære geboren. Þær is nan Ȝær 0.  Þus warþ his Son, Seth, in 231 geboren.
 * Teimleine: Adam: geboren 1, Seth in 231, Enosch in 436, Kenan in 626, Mahalalel in 796, Jared in 961, Enoch in 1123, Methuselah in 1288, Lamech in 1475, and Noah in 1657.
 * Noahs Sœne: Japheth (500), Shem (502), þa Ham.

Kapitel 11

 * 1) And þie hale World hafde an Gererd and ane gemæne Sprake.
 * 2) So geschaa, þat hje easten fœrden, fanden hje an Gefilde in þem Lande Schinar, and þær eardeden.
 * 3) Hje kwaðen to ælcen oðern, "Kommeþ, scheppeþ wiȝ Tiȝlen and hje þurȝhbaken."  Hje broken Tiȝle instedd Stanes, and Teer for Wallleim.
 * 4) Þa kwaðen hje, "Kommeþ, bueþ wiȝ us selfen ane Burg, mid anem Turr þe to þen Rodern ræceþ, soþat wiȝ us gemærsen; elkor werðeþ wiȝ ofer þie Ruse þer halen Erðe gestrogden."
 * 5) Ak þe Driȝhten (YHWH) kam niðer, þie Burg and þen Torr to seen, þie þie Leode gebuen hafden.
 * 6) Þe Driȝhten (YHWH) kwaþ, "Soðes sind þie Leode geþwær and habeþ an Gererd.  And hje habeþ þis begunnen, nu wirþ naȝht oþhalden, þe hje akræfteþ to don.
 * 7) Kommeþ, gaþ wiȝ niðer and gemencgeþ hjer Gererd, soþat hje understandeþ noȝht ælcen oðern."
 * 8) So testragd þe Driȝhten (YHWH) hje þanen ofer alle þie Erðe, and hje lannen of, þie Burg to buen.
 * 9) Þus hatte schie Babel - forþen þe Driȝhten (YHWH) þær þat Gererd þer halen Werld gemencgde .  Þanen testragd þe Driȝhten (YHWH) hje ofer þen Eard þer halen Erðe. Of Shem oþ Abram
 * 10) þis sind þie Kynnrekenne Shems. Twa Ȝære æfter þem Flod, was Shem hundredwintre (100 years old), and kennde Arphaxad.
 * 11) And Shem lifde feifhundred (500) Ȝære, and kennde oðre Sœne and Dœȝhter.
 * 12) And Arphaxad lifde hundfeifandþrittiȝ (135) Ȝære, and kennde Cainan.
 * 13) And Arphaxad lifde fierhundþrittiȝ (430) Ȝære, æfterþem he Cainan kennde, and kennde oðre Sœne and Dœȝhter.  And Cainan lifde hundþrittiȝ (130) Ȝære, and kennde Shelah.  And Cainan lifde þreehundþrittiȝ (330) Ȝære, æfterþem he Shelah kennde, and kennde oðre Sœne and Dœȝhter.
 * 14) And Shelah lifde hundþrittiȝ (130) Ȝære, and kennde Eber.
 * 15) And Shelah lifde þreehundþrittiȝ (330) Ȝære, æfterþem he Eber kennde, and kennde oðre Sœne and Dœȝhter.
 * 16) And Eber lifde hundfierandþrittiȝ (134) Ȝære, and kennde Peleg.
 * 17) And Eber lifde þreehundsefentiȝ (370) Ȝære, æfterþem he Peleg kennde, and kennde oðre Sœne and Dœȝhter.
 * 18) And Peleg lifde hundþrittiȝ (130) Ȝære, and kennde Reu.
 * 19) And Peleg lifde twahundneiȝn (209) Ȝære, æfterþem he Reu kennde, and kennde oðre Sœne and Dœȝhter.
 * 20) And Reu lifde hundtwaandþrittiȝ (130) Ȝære, and kennde Serug.
 * 21) And Reu lifde twahundsefentiȝ (270) Ȝære, æfterþem he Serug kennde, and kennde oðre Sœne and Dœȝhter.
 * 22) And Serug lifde hundþrittiȝ (130) Ȝære, and kennde Nahor
 * 23) And Serug lifde twahundred (200) Ȝære, æfterþem he Nahor kennde, and kennde oðre Sœne and Dœȝhter.
 * 24) And Nahor lifde neiȝnandsefentiȝ (79) Ȝære, and kennde Terah.
 * 25) And Nahor lifde hundredneiȝnandtweȝntiȝ (129)* Ȝære, and kennde oðre Sœne and Dœȝhter. (125, 119, or 129?)
 * 26) And Terah lifde hundþrittiȝ (130) Ȝære, and kennde Abram, Nahor, and Haran. Abrams Heired
 * 27) þis sind þie Kynnrekenne Terahs.  Terah kennde Abram, Nahor, and Haran.  And Haran kennde Lot.
 * 28) And Haran starf forr seinem Fader Terah, in þem Lande seiner Gebyrd, Ur þer Chaldeanen. (28)
 * 29) Abram and Nahor geweiften.  Þe Name Abrams Weif was Sarai, and þe Name Nahors Weif was Milah, Harans Doȝhter, þe Fader Milkahs and Iskahs.
 * 30) Ak Sarai was untiemende, schie kennde nan Cild.
 * 31) And Terah naam seinen Son Abram, and Lot Haransson seinen Barnsbarn, and seine Snore Sarai, þat Weif seines Sones Abrams, and hje kamen ætsammen of Ur þer Chaldeanen ut, to Canaan to gan.  And hje kamen to Harran and eardeden þa.
 * 32) Terah lifde twahundredfeif (205) Ȝære, and starf in Harran.

Kapitel 11 Noten

 * Þie Ælden þisser Menne wurden fram þen Phariseen geschyrted, to þon þe hje ane Witegung Cristes unsoðen kuðen. Æfter hjeren Geliefen wyrde Christ in þem 6.  Ȝærþusend of Geschæft (5000 oþ 5999 AM) ætiewen, and þat Kynereic in þem 7. Ȝærþusend inlæden.  If man gelytle þie Ælden syndriger Hefdfæder in Gekyndbok 5 and 11, þonn wære Crist to ær geboren worden, and þus wære noȝht þe Hælend.  Mid þissen smælleren Ælden, schollde þe Hælend æm ærsten 240 AD geboren werðen, forþen þe masoretische Traȝht gereimþ, þat 3761 BC þie Tælmark Geschæft seie.

title: NiwEnglisc/Bible/Gekyndbok


text:
Niw Englisch/Modernizing Old English

The Niw Englisch language is essentially a modernized and simplified version of Old English. If you look at Old High German and compare it to New High German (Modern German), you can see how conservative the German language has been over the last 1200 years. In comparison, English has lost nearly all inflection and relies nearly entirely on word order to carry meaning. Niw Englisch takes Old English and modernizes and simplifies it to the degree that modern German has changed from Old High German.

Orthography
Nouns are capitalized like they were in the 18th century and in modern German, and adjectives acting like nouns are capitalized.

Example:
 * Stream - "stream"
 * Burg - "city"
 * þe Braade - "the broad one"

To modernize from Old English to Niw Englisch, it is sometimes necessary to look at Proto-Germanic to develop a regular scheme of modernization. In Proto-Germanic, the 'a' broke into 'ea' in some Old English words, and sometimes the 'au' turned into 'ea'. The broken 'ea' is returned to 'a' like some accents of Old English, and the 'au' remains 'ea', pronounced as 'æ'.

Example:
 * stréam from straum; it becomes Stream.

The Proto-Germanic 'eu' became éo, like léoht, céosan. This becomes 'ie,' Lieȝht and ciesen.

Old English æ in simple stems remains in Niw Englisch if followed by ȝ, so nægl becomes Næȝl, and pæþ becomes Paþ. In some of these, leveling of the æ of the singular into the plural led to the crossing of a lot of simple nouns into the umlauting class, so that Paþ becomes Pæðe in the plural, Swaþ->Swæðe.

Digraphs and Trigraphs
The letter combination sce-/sci- represented the 'sh' sound in English before back vowels, while sca-/sco-/-scu- represented 'sk' generally. In Niw Englisch, the combination sch- always represents the 'sh' sound, while 'sk' always represents the 'sk' sound.

Examples:
 * scur->Schur - 'shower'
 * sceacan->schaken - 'to shake'

Consonants
The consonants from Old English to Niw Englisch are generally the same, though distinctions are made between the palatal and non-palatal consonants. The G is always a hard G sound like 'gold,' while the 'ȝ' is always a 'y' sound like 'young.'

Example:
 * geong->ȝong -> young
 * gold->Gold -> gold

In the digraph ȝh, after front vowels (æ, e, i, œ, y) it is pronounced like the ich-laut in German. After back vowels (a, o, u) it is pronounced like the ach-laut in German.

The C is always the 'ch' sound, while 'k' represents the hard 'k' sound from Old English.

Example:
 * calan->kalan - to cool
 * sceadan->schaden - to divide, separate

The two letters þ and ð represent the soft and hard version of the 'th' sound from English, as in 'think' and 'that'. They alternate to tell you how to pronounce a word.

Examples:
 * þencan->þenken -> to think; 'th' like 'think'
 * wiþer->wiðer -> against; 'th' like 'that'

HL, HR, HW - the HL and HR like hlud and hring are dropped to luud and Ring. The HW remained in actual English, so it remains, spelled with the Gothic letter hwair (Ƕƕ), like hwisprian->ƕispern.

Verbs
To modernize the Old English verb, change the -an/-ian to -en on the infinitive. All contracted verbs become uncontracted. For example, fón becomes fangen on analogy to the past participle. The verbs téon and téon become teiȝen and tieȝen, so you can now tell which is a type 1 or type 2 strong verb. A verb like 'ascian' becomes 'asken,' since it was pronounced 'as-ki-an' with a k, rather than 'ch' sound, and the -ian becomes -en.

Type 1 strong verbs change the í to ei, pronounced like modern English and German verbs write or schreiben. So, a verb like líðan to travel becomes leiðen.

Type 2 strong verbs change the éo to ie like in German, and regularize the past and past participle vowel to 'o'. Old English dréosan becomes driesen; the past goes from dreas/druron to dros/drosen, and the participle from gedroren to gedrosen, regularizing the 's'.

Type 3 strong verbs regularize the vowel of the singular, 'a' as the past tense vowel, and the vowel of the past participle into the past subjunctive. For example, helpan becomes helpen; hilpþ stays hilpþ; halp, hulpon becomes halp, halpen; the participle geholpen remains geholpen. The past subjunctive in Old English, hulpe, developed into holpe, so the past subjunctive would be hœlpe, with an umlaut like German.

Masculine
Masculine nouns by and large were strong and weak: Old English generalized the masculine nominative plural into the accusative, while most other Germanic languages generalized the accusative plural. That's an easy way to explain why the -s plural survived in English and not other Germanic languages. Couple that with the Norman Conquest, with French generalizing the -s plural of the Latin accusative plural, and the tendency towards and -s plural is strengthened. Without that, it's possible that the -s plural might not have gone on. Most other Germanic languages with at least 2 plural forms have a distinct dative plural case if any of the cases are distinct. Icelandic has 4 plural forms If the weak noun had continued on as a distinct class, it would have weakened the endings to a schwa/e sound.

As in German, Old English nouns that ended in -el are weak in the plural:
 * laden (to load) -> Lædel (ladle), plural Lædeln.

Feminine Nouns
Many feminine nouns ended in -u in the nominative; this would have weakened to -e as would the other endings of the singular, and the plural, similarly weakened, would have caused many feminine nouns to become weak in the plural so there would remain a distinction between the two.

A large number of feminine nouns would fall into this category, though a few have dropped the -e in the singular, as Brod, Broden (brood) did. Feminine nouns ending in -el/-er just add -n:
 * Muskel -> Muskeln = mussel
 * Feðer -> Feðern = feather

Feminine nouns ending in -en add -ne in the plural.

Feminine weak nouns all became strong in the singular, and retained their weak endings in the plural.

Verb Inflection
Like Old English, verbs have four inflections in the present: 1st, 2nd, and 3rd person singular, and a common plural.

Present Indicative
Just like in Old English and German, the 2nd and 3rd person singular have an umlaut of the stem vowel for strong verbs.

In Niw Englisch, the plural has weakened to 'eþ', and the 2nd and 3rd person singular, like modern German, regularly lose the 'e' unless the verb stem has a consonant cluster that would result in not being able to pronounce the ending without it. If you look at modern Saxon (Low German), you'll see the same pattern of 3 singular forms, and a common plural form.

Present Subjunctive
In Old English, the present subjunctive was either singular or plural:

For Niw Englisch, the present subjunctive looks like the German present subjunctive:

Had Old English similar influences as German, it would have been relatively reasonable that the '-est' ending of the 2nd person would be used in the subjunctive mood as well. This goes for the strong verb subjunctives also.

Example:
 * findan->finde or finden; finden-> finde, findest, or finden (strong verb)
 * ascian->ascie or ascien; asken-> aske, askest, or asken (weak verb)

Past Indicative
In Old English, the past tense of 'weak' verbs had a dental (d/t) suffix and the personal endings afterwards. With voiceless consonants like s or þ, it became a 't' instead. For class 2 weak verbs ending in -ian, the ending became -ode, -odest, -odon

For Niw Englisch, all weak verbs have the following endings, the vowels all weakend to the 'e' (schwa) sound. There are no longer any distinctions between class 1a, 1b, and class 2 weak nouns. All weak nouns take these endings, but may insert 'e' between the verb stem and the ending to make it clearly pronounced. Similar to Old English, any sibilant (s, sch, z, c) will take a 't' instead of 'd' for the past tense marker, as will k/g/cg.

Example:
 * cyssan-cysste -> kyssen-kysste
 * hangian-hangode -> hangen-hangte (hankte)
 * acealdian-acealdode -> akalden-akaldede; the 'e' was added to make sure the ending was pronounced.

Past Subjunctive
In Old English, the pat subjunctive was either singular or plural:

For Niw Englisch, the past subjunctive looks like the German present subjunctive:

For strong verbs, the subjunctive operates like in modern German - endings in the present, umlaut plus endings in the past In Old English, the past subjunctive was either singular or plural for strong verbs with the past plural stem:

For Niw Englisch, the past subjunctive looks like the German past subjunctive:

title: Niw Englisch/Modernizing Old English


text:
Talk:Chess Opening Theory/1. g3/1...b6

What!? This is not a thing. It's never been played and you're down a rook for nothing in the "Main LIne". This page is just a silly joke and must be deleted. AeyBess (discuss • contribs) 15:20, 8 February 2022 (UTC)

 * you have a concern posted here and you'll have 7 days to answer. —Atcovi (Talk - Contribs) 18:11, 8 February 2022 (UTC)
 * @AeyBess  I am glad you brought forward your concerns and I believe that your feedback can help improve this page. If I understand correctly, you do not believe this is a position that has been played nor that it should be played due to an unnecessary rook sacrifice and knight for bishop trade.
 * Firstly, although this opening may seem unconventional, it is not uncommon.  As of March 8, 2022, on the Lichess database of non-master players (which will be used as a reference from now on), the moves 1. g3 b6 2. Bg2 Bb7 have been played 41 225 times by players with an average rating of 1835.  As a comparison, an opening that dates back to the XVI century, the Damiano defence, defined by moves 1.e4 e5 2.Nf3 f6, has only been recorded 160 455 times in the database, the average player has a rating of 1708.  Accounting for the length of the existence of both openings, the fianchetto being a quite recent response for kingside fianchetto, it seems to be catching momentum in the eyes of higher-rated players.  I am not suggesting that it is at the calibre of a master's opening repertoire but it is common and should be cataloged.
 * Secondly, to address your concern that this is a losing position for black, you are correct.  The engine analysis, made by Stockfish 14+ (which will be used as a reference from now on), evaluates this position as +7 for white at depth 22.  For comparison, the Damiano defence evaluates the position at +1,9 in depth 36.  But by looking deeper, things become interesting.  With the fianchetto, the win rate for white is at 64% compared to 33% for black, the rest being draws.  Compared to the Damiano defence, which is won 63% of the time by white and the same amount of times by black, you come to realize that material advantage or engine evaluation is not the only important factor for the outcome of the game with lower-ranking players.  To go briefly, for black, it can be useful to sacrifice a rook to win long-term advantages, especially in fast-paced games where the opponent could be destabilized.  Isn’t it just like a gambit, but putting more on the line? As for white, it can be useful to prepare to take advantage of blacks’ mistakes when they occur, as they could easily be missed.
 * If there is one thing to remember, it is that, although this position favours white, keeping it in our minds and in the books can be a useful tool if used properly, and there are important lessons to learn from it.  I will eagerly be waiting for your thoughts and I hope I have convinced you that this is not some «silly joke» and should remain in the Chess Opening Theory WikiBook.  To avoid further confusion and to deepen the available knowledge available on the module, I think a collaboration rather than an opposition would be a better solution. 24.226.246.19 (discuss) 22:06, 8 February 2022 (UTC)

title: Talk:Chess Opening Theory/1. g3/1...b6


text:
HKDSE Geography/E1/Mining

Sliver Mine Bay

Ma On Shan

Anderson Quarry

title: HKDSE Geography/E1/Mining


text:
HKDSE Geography/E1/Geological Tourism and Education

How does Geopark promote sustainable development?

- allowing geological research

- promoting ecotourism

Evaluation of the effectiveness of setting up the Hong Kong Geopark in conserving the geological resources in the High Island area

Effective

•       development is forbidden within the park

→    laws related to the Geopark can prohibit improper behaviours (e.g. graffiti / water / solid waste pollution)

→    help protect the geological resources

•       public has low awareness towards geological resources protection in Hong Kong

→    the establishment of geopark provides an opportunity for educating the public about the unique geology of Hong Kong

→    provides suitable educational resources and field study destination for the students and the general public

→    encourage scientific research on geosciences

→    conserves the completeness of the natural environment for scientific research + gains further support for conservation

•       designating the area as the Geopark encourages small-scale eco-tourism

→    helps maintain the carrying capacity of the area

→    increases the attractiveness of Hong Kong as a tourist spot

Limitations

•       the setting up of the Geopark may attract more tourists

→    large influx of tourists, leading to various problems, e.g. by littering, taking away rocks/gravels, climbing and engraving/drawing graffiti on rocks

→    cause disturbance to the local residents

→    minor damage to geological features will occur

→    solid waste pollution will become more serious

→    since the location is relatively remote, it is costly and difficult to monitor visitors’ behavior → the landform cannot be properly protected

•       construction of infrastructure, such as pavilions/ roads, footpaths, toilets, etc. may damage the natural environment

•       the extent of the Geopark is limited: private land and villages are excluded from the Geopark

•       local people may oppose to the setting up of the Geopark/it may lead to social conflicts

Other measures to conserve the geological resources

•       stricter law enforcement to prevent removal or destruction of geological resources

•       education to promote public awareness and participation in the conservation of geological resources

•       eco-tourism in the Geopark to ensure minimal impact on the area


text:
HKDSE Geography/M7

Weather is the condition of the lowest part of the atmosphere over a short period of time, while climate is the average weather conditions over many years.

There are different evidences showing global warming is happening.

title: HKDSE Geography/M7


text:
HKDSE Geography/M2b/Sea Level

Sea level is fluctuating.

title: HKDSE Geography/M2b/Sea Level


text:
HKDSE Geography/E4

Zhujiang Delta is an important region in China.

title: HKDSE Geography/E4


text: User talk:SpaceRocky

title: User talk:SpaceRocky


text:
Angry Birds/Enemies

In Angry Birds, green pigs are the enemies.

Green pigs come in different sizes.

title: Angry Birds/Enemies


text:
Minecraft resource gathering/Redstone

You can find Redstone underground at y-level 32 or below. You must mine it with an Iron-tier or higher pickaxe or it will not drop anything. It will drop 4-8 Redstone Dust, which can be used for redstone cirucits.

Witches also drop up to six peices redstone Dust.

Redstone Dust can be used on a brewing stand with most potions to make the potion last longer.

title: Minecraft resource gathering/Redstone


text:
User:Felix QW/sandbox

Inverse matrices play a key role in linear algebra, and particularly in computations. However, only square matrices can possibly be invertible. This leads us to introduce the Moore-Penrose inverse of a potentially non-square real- or complex-valued matrix, which satisfies some but not necessarily all of the properties of an inverse matrix.

We will see below that given a matrix $$A$$, there exists a unique matrix $$A^+$$ that satisfies all four of the Moore–Penrose conditions. They generalise the properties of the usual inverse.

Basic properties of the Hermitian conjugate
We assemble some basic properties of the conjugate transpose for later use. In the following lemmas, $$A$$ is a matrix with complex elements and n columns, $$B$$ is a matrix with complex elements and n rows.

Existence and uniqueness
We establish existence and uniqueness of the Moore-Penrose inverse for every matrix.

This leads us to the natural definition:

Basic properties
We have already seen above that the Moore-Penrose inverse generalises the classical inverse to potentially non-square matrices. We will now list some basic properties of its interaction with the Hermitian conjugate, leaving most of the proofs as exercises to the reader.

The following identities hold:
 * 1) A+ = A+ A+* A$$
 * 2) A+ = A$$ A+* A+
 * 3) A = A+* A$$ A
 * 4) A = A A$$ A+*
 * 5) A$$ = A$$ A A+
 * 6) A$$ = A+ A A$$

Proof of the first one: $$A^+ = A^+AA^+$$ and $$AA^+ = \left(AA^+\right)^*$$ imply that $$A^+ = A^+\left(A A^+\right)^* = A^+A^{+^*}A^*$$. □

The remaining identities are left as exercises.

Reduction to the Hermitian case
The results of this section show that the computation of the pseudoinverse is reducible to its construction in the Hermitian case. It suffices to show that the putative constructions satisfy the defining criteria.

Products
We now turn to calculating the Moore-Penrose inverse for a product of two matrices, $$C = AB.$$

Another important special case which approximates closely that of invertible matrices is when $$A$$ has full column rank and $$B$$ has full row rank.

We finally derive a formula for calculating the Moore-Penrose inverse of $$A A^*$$.

Projectors and subspaces
The defining feature of classical inverses is that $$A A^{-1} = A^{-1} A = I.$$ What can we say about $$A A^+$$ and $$A^+ A$$?

We can derive some properties easily from the more basic properties above:

We can conclude that $$P = AA^+$$ and $$Q = A^+ A$$ are orthogonal projections.

We finish our analysis by determining image and kernel of the mappings encoded by the Moore-Penrose inverse.

Applications
We present two applications of the Moore-Penrose inverse in solving linear systems of equations.

Least-squares minimization
Moore-Penrose inverses can be used for least-squares minimisation of a system of equations that might not necessarily have an exact solution.

Minimum-norm solution to a linear system
The proof above also shows that if the system $$Ax = b$$ is satisfiable i.e. has a solution, then necessarily $$z = A^+b$$ is a solution (not necessarily unique). We can say more:

An immediate consequence of this result is that $$z$$ is also the uniquely smallest solution to the least-squares minimization problem for all $$Ax = b$$, including when $$ A $$ is neither injective nor surjective. It can be shown that the least-squares approximation $$Az = y \approx b$$ is unique. Thus it is necessary and sufficient for all $$x$$ that solve the least-squares minimization to satisfy $$Ax = y = Az = AA^+b$$. This system always has a solution (not necessarily unique) as $$Az$$ lies in the column space of $$A$$. From the above result the smallest $$x$$ which solves this system is $$A^+(AA^+b) = A^+b = z$$.

title: User:Felix QW/sandbox


text: Template:Programming language/sandbox

title: Template:Programming language/sandbox


text:
Category:Template sandboxes

Pages where changes to heavily-used templates can be tested before publishing.

title: Category:Template sandboxes


text:
Free Knowledge Culture Calendar/April 13

Today in 2012 the Open Data Institute was founded.


text:
Free Knowledge Culture Calendar/October 30

Today in 2012 the dutch Rijksmuseum started to make its massive art collection freely available as full digital reproductions.


text:
Macroeconomics/Market Failure

Market failure happens when firms do not produce the quantity of output that would have been produced under the conditions of perfect competition. In other words, the quantity of output produced is either too little or too great. If it is too little then the product is under produced and under consumed. There is allocative inefficiency and society would be better off if more resources were used to produce the product. For example, under the conditions of imperfect competition, firms produce less output than they would produce under the conditions of perfect competition. If the quantity produced is too great, then the good is overproduced and overconsumed. Society would be better off if less output were produced and excess resources transferred to making another product that is in greater demand. An example of this type of market failure is the negative production externality.

Consumers who consume output without having to pay for it are known as free riders.

Causes of Market Failure

 * 1) Public goods - The main characteristic of public goods is non-excludability. This means that if the good or service is produced for one consumer, no other consumer can be prevented from consuming it. The classic examples are the service of a country's defense force, street lighting and lighthouses. For example, if I build a lighthouse so that my ships can be warned of a dangerous reef at night, there is nothing that I can do to prevent other people's ships from also enjoying the benefit of the light from the lighthouse. Can you see the problem that now arise? If ask other people to pay some costs of building the lighthouse, will they pay? Probably not. They will build the lighthouse anyway and that they will be able to consume the light for it. Consumers who behave in this way consume output without having to pay for it. Under produced by the market system. Too few consumers are prepared to pay for goods; they would rather be free riders. Therefore, there is an under-allocation of resources to the production of public goods and the market fail

title: Macroeconomics/Market Failure