<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Isfahan</PublisherName>
				<JournalTitle>Mathematics and Society</JournalTitle>
				<Issn>2345-6493</Issn>
				<Volume>1</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2016</Year>
					<Month>11</Month>
					<Day>21</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The missing place of the number 'e' in secondary school books</ArticleTitle>
<VernacularTitle>The missing place of the number &#039;e&#039; in secondary school books</VernacularTitle>
			<FirstPage>13</FirstPage>
			<LastPage>23</LastPage>
			<ELocationID EIdType="pii">7547</ELocationID>
			
<ELocationID EIdType="doi">10.22108/msci.2016.7547</ELocationID>
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Mehdi</FirstName>
					<LastName>Hassani</LastName>
<Affiliation>University of Zanjan</Affiliation>

</Author>
<Author>
					<FirstName>Azizeh</FirstName>
					<LastName>Ahmadi</LastName>
<Affiliation>University of Zanjan</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>The limited information about the number $\mathrm{e}$ found in secondary school books prompted us to write this article in defense of the possibility of providing more comprehensive explanations about this number at the secondary education level. We begin with presenting a historical background of this number and then proceed to prove the inequality, $0&lt;\mathrm{e}-\sum_{k=0}^{n}{1}/{k!}&lt;{1}/{(n.n!)}$ which holds for every $n\geq 1$. By utilizing this inequality, we infer the enigmatic nature of $\mathrm{e}$ and calculate the sum of $\sum_{k=0}^{n} P(n,k)$. This sum leads us to the counting of distinct paths between two arbitrary vertices of a complete graph. Finally, we demonstrate the proof of the inequality involving arithmetic, geometric, and harmonic means based on the inequality Image. All the proofs and deductions are based on the materials covered in the final year of secondary education.</Abstract>
			<OtherAbstract Language="FA">The limited information about the number $\mathrm{e}$ found in secondary school books prompted us to write this article in defense of the possibility of providing more comprehensive explanations about this number at the secondary education level. We begin with presenting a historical background of this number and then proceed to prove the inequality, $0&lt;\mathrm{e}-\sum_{k=0}^{n}{1}/{k!}&lt;{1}/{(n.n!)}$ which holds for every $n\geq 1$. By utilizing this inequality, we infer the enigmatic nature of $\mathrm{e}$ and calculate the sum of $\sum_{k=0}^{n} P(n,k)$. This sum leads us to the counting of distinct paths between two arbitrary vertices of a complete graph. Finally, we demonstrate the proof of the inequality involving arithmetic, geometric, and harmonic means based on the inequality Image. All the proofs and deductions are based on the materials covered in the final year of secondary education.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Euler's number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Irrational number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Analytic combinatorics</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Inequality of arithmetic</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">geometric</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">harmonic means</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://math-sci.ui.ac.ir/article_7547_ff9daeffa9086b3eab13b6273d4697ab.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
