<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://drorbn.net/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Michael.Wang</id>
	<title>Drorbn - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://drorbn.net/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Michael.Wang"/>
	<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=Special:Contributions/Michael.Wang"/>
	<updated>2026-05-06T17:14:25Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.6</generator>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Class_Photo&amp;diff=11985</id>
		<title>12-240/Class Photo</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Class_Photo&amp;diff=11985"/>
		<updated>2012-09-29T19:52:20Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: /* Who We Are... */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Our class on September 25, 2012:&lt;br /&gt;
&lt;br /&gt;
[[Image:12-240-ClassPhoto.jpg|thumb|centre|800px|Class Photo: click to enlarge]]&lt;br /&gt;
{{12-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
Please identify yourself in this photo! There are two ways to do that:&lt;br /&gt;
&lt;br /&gt;
* [[Special:Userlogin|Log in]] to this Wiki and edit this page. Put your name, userid, email address and location in the picture in the alphabetical list below.&lt;br /&gt;
* Send [[User:Drorbn|Dror]] an email message with this information.&lt;br /&gt;
&lt;br /&gt;
The first option is more fun but less private.&lt;br /&gt;
&lt;br /&gt;
===Who We Are...===&lt;br /&gt;
&lt;br /&gt;
{| align=center border=1 cellspacing=0&lt;br /&gt;
|-&lt;br /&gt;
!First name&lt;br /&gt;
!Last name&lt;br /&gt;
!User ID&lt;br /&gt;
!Email&lt;br /&gt;
!Place in photo&lt;br /&gt;
!Comments&lt;br /&gt;
&lt;br /&gt;
{{Photo Entry|last=Bar-Natan|first=Dror|userid=Drorbn|email=drorbn@ math. toronto. edu|location=facing everybody, as the photographer|comments=Take this entry as a model and leave it first. Otherwise alphabetize by last name. Feel free to leave some fields blank. For better line-breaking, leave a space next to the &amp;quot;@&amp;quot; in email addresses.}}&lt;br /&gt;
{{Photo Entry|last=Frailich|first=Rebecca|userid=Rebecca.frailich|email=rebecca.frailich@ mail.utoronto.ca|location=Last row, in between two guys standing at the back (one in red, one in black) |comments=}}&lt;br /&gt;
{{Photo Entry|last=Hoover|first=Ken|userid=Khoover|email=ken.hoover@ mail.utoronto.ca|location=First row, fourth from the right.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Klingspor|first=Josefine|userid=Josefine|email=josefine. klingspor@ mail. utoronto. ca|location=First row, second from left.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Le|first=Quan|userid=Quanle|email=quan.le@mail.utoronto.ca|location=Start bottom right corner, third from right. Go three steps north-west. Directly north-east from there, in blue collar shirt|comments=}}&lt;br /&gt;
{{Photo Entry|last=Liu|first=Zhaowei|userid=tod|email=tod. liu@ mail. utoronto .ca|location=First row, third from the right|comments=}}&lt;br /&gt;
{{Photo Entry|last=Millson|first=Richard|userid=Richardm|email=r.millson@ mail. utoronto. ca|location=Seventh row from the front, fourth from the right, blue sweater|comments=}}&lt;br /&gt;
{{Photo Entry|last=McGrath|first=Celton|userid=CeltonMcGrath|email=celton. mcgrath@ mail. utoronto. ca|location=4th row front from, centre right, brown sweater|comments=}}&lt;br /&gt;
{{Photo Entry|last=Morenz|first=Karen|userid=KJMorenz|email=kjmorenz@ gmail.com|location=3rd-ish row from the back, centre right, purple shirt|comments=}}&lt;br /&gt;
{{Photo Entry|last=Vicencio-Heap|first=Felipe|userid=Heapfeli|email=felipe. vicencio. heap@ mail. utoronto. ca|location=Second row from the front, furthest to the right.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Wamer|first=Kyle|userid=kylewamer|email=kyle. wamer @ mail. utoronto. ca|location=Second row, fifth from the left in the red shirt.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Yang|first=Chen|userid=chen|email=neochen. yang@ mail. utoronto. ca|location=sixth row, first from the right in the black pull-over.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Zhang|first=BingZhen|userid=Zetalda|email=bingzhen.zhang@ mail. utoronto. ca|location=Second last row, third from left.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Zhao|first=TianChen|userid=Ericolony|email=zhao_tianchen@ hotmail. com|location=fourth row, the guy in green shirt.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Zibert|first=Vincent|userid=vincezibert|email=vincent. zibert@ mail. utoronto. ca|location=Directly beneath the white notice posted on the door on the right-hand side.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Zoghi|first=Sina|userid=sina.zoghi|email=sina.zoghi@ utoronto .ca|location=First row, leftest left.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Léger|first=Zacharie|userid=zach.leger8|email=zacharie. leger@ mail. utronto. ca|location= 5th row in a black T-shirt.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Wang|first=Minqi|userid=Michael.Wang|email=wangminqi@ yahoo.cn|location=First row, fourth from the left in black oufit) |comments=}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--PLEASE KEEP IN ALPHABETICAL ORDER, BY LAST NAME--&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--PLEASE KEEP IN ALPHABETICAL ORDER, BY LAST NAME--&amp;gt;&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11665</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11665"/>
		<updated>2012-09-16T20:13:15Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[12-240]][[Image:12-240-Splash.png]]&lt;br /&gt;
&lt;br /&gt;
[[12-240/Classnotes for Tuesday September 11]]&lt;br /&gt;
&lt;br /&gt;
In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) &lt;br /&gt;
&lt;br /&gt;
F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number n which is not a prime number can not &amp;quot;form&amp;quot; a field F(n)&lt;br /&gt;
&lt;br /&gt;
If you do not understand what the F(n) means, you can look through the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;Why all the numbers  which are not prime numbers can not form a field F(n)?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) , which means n is not a prime number.&lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*   0   1   2   3   .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0   0   0   0   0   ...........0........0 &lt;br /&gt;
&lt;br /&gt;
1   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
2   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
3   0   .   .   .   ...................... &lt;br /&gt;
&lt;br /&gt;
4   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
..   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
a   0  (a) (2a) (3a).........(a*b)....(n-1)*a   &#039;&#039;&#039; ( in this row, every element mod n)&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
 &lt;br /&gt;
(n-1) 0...................................&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, actually each row or column, to meet the rule :Existence of Negatives/Inverses. (About the rule, seen in the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
So if F(n) is a field, then &lt;br /&gt;
     there must exist k,m ∈N*, m&amp;lt;n&lt;br /&gt;
          to meet the equation:&lt;br /&gt;
                  m*a=k*n+1&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
   And we know that n=ab&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
     So m*a=k*a*b+1 (a≠1)&lt;br /&gt;
&lt;br /&gt;
     Hence m=k*b+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist, because m should be an integer.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11664</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11664"/>
		<updated>2012-09-16T20:11:06Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[12-240]][[Image:12-240-Splash.png]]&lt;br /&gt;
&lt;br /&gt;
[[12-240/Classnotes for Tuesday September 11]]&lt;br /&gt;
&lt;br /&gt;
In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) &lt;br /&gt;
&lt;br /&gt;
F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number n which is not a prime number can not &amp;quot;form&amp;quot; a field F(n)&lt;br /&gt;
&lt;br /&gt;
If you do not understand what the F(n) means, you can look through the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;Why all the numbers  which are not prime numbers can not form a field F(n)?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) , which means n is not a prime number.&lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*   0   1   2   3   .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0   0   0   0   0   ...........0........0 &lt;br /&gt;
&lt;br /&gt;
1   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
2   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
3   0   .   .   .   ...................... &lt;br /&gt;
&lt;br /&gt;
4   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
.   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
a   0  (a) (2a) (3a).........(a*b)....(n-1)*a   &#039;&#039;&#039; ( in this row, every element mod n)&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
 &lt;br /&gt;
(n-1) 0...................................&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, actually each row or column, to meet the rule :Existence of Negatives/Inverses. (About the rule, seen in the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
So if F(n) is a field, then &lt;br /&gt;
     there must exist k,m ∈N*, m&amp;lt;n&lt;br /&gt;
          to meet the equation:&lt;br /&gt;
                  m*a=k*n+1&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
   And we know that n=ab&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
     So m*a=k*a*b+1 (a≠1)&lt;br /&gt;
&lt;br /&gt;
     Hence m=k*b+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist, because m should be an integer.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11663</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11663"/>
		<updated>2012-09-16T20:09:20Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;nowiki&amp;gt;[[12-240]][[Image:12-240-Splash.png]]&lt;br /&gt;
&lt;br /&gt;
[[12-240/Classnotes for Tuesday September 11]]&lt;br /&gt;
&lt;br /&gt;
In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) &lt;br /&gt;
&lt;br /&gt;
F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number n which is not a prime number can not &amp;quot;form&amp;quot; a field F(n)&lt;br /&gt;
&lt;br /&gt;
If you do not understand what the F(n) means, you can look through the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;Why all the numbers  which are not prime numbers can not form a field F(n)?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) , which means n is not a prime number.&lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*   0   1   2   3   .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0   0   0   0   0   ...........0........0 &lt;br /&gt;
&lt;br /&gt;
1   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
2   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
3   0   .   .   .   ...................... &lt;br /&gt;
&lt;br /&gt;
4   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
.   0   .   .   .   ......................&lt;br /&gt;
&lt;br /&gt;
a   0  (a) (2a) (3a).........(a*b)....(n-1)*a   &#039;&#039;&#039; ( in this row, every element mod n)&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
&lt;br /&gt;
....0.....................................&lt;br /&gt;
 &lt;br /&gt;
(n-1) 0...................................&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, actually each row or column, to meet the rule :Existence of Negatives/Inverses. (About the rule, seen in the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
So if F(n) is a field, then &lt;br /&gt;
     there must exist k,m ∈N*, m&amp;lt;n&lt;br /&gt;
          to meet the equation:&lt;br /&gt;
                  m*a=k*n+1&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
   And we know that n=ab&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
     So m*a=k*a*b+1 (a≠1)&lt;br /&gt;
&lt;br /&gt;
     Hence m=k*b+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist, because m should be an integer.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;br /&gt;
&amp;lt;nowiki&amp;gt;&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11610</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11610"/>
		<updated>2012-09-13T14:47:33Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[12-240]][[Image:12-240-Splash.png]]&lt;br /&gt;
&lt;br /&gt;
[[12-240/Classnotes for Tuesday September 11]]&lt;br /&gt;
&lt;br /&gt;
In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) &lt;br /&gt;
&lt;br /&gt;
F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number n which is not a prime number can not &amp;quot;form&amp;quot; a field F(n)&lt;br /&gt;
&lt;br /&gt;
If you do not understand what the F(n) means, you can look through the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;Why all the numbers  which are not prime numbers can not form a field F(n)?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) , which means n is not a prime number.&lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*  0  1  2  3  .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0  0  0  0  0  ...........0.........0 &lt;br /&gt;
&lt;br /&gt;
1  0  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
2  0  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
3  0  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
4  0  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
..   0  .  .  .  .......................&lt;br /&gt;
&lt;br /&gt;
a  0  (a)  (2a)  (3a)...........(a*b).....(n-1)*a   &#039;&#039;&#039; ( in this row, every element mod n)&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
....................................&lt;br /&gt;
&lt;br /&gt;
....................................&lt;br /&gt;
&lt;br /&gt;
......................................&lt;br /&gt;
&lt;br /&gt;
.....................................&lt;br /&gt;
 &lt;br /&gt;
(n-1) 0................................ &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, actually each row or column, to meet the rule :Existence of Negatives/Inverses. (About the rule, seen in the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
So if F(n) is a field, then &lt;br /&gt;
     there must exist k,m ∈N*, m&amp;lt;n&lt;br /&gt;
          to meet the equation:&lt;br /&gt;
                  m*a=k*n+1&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
   And we know that n=ab&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
     So m*a=k*a*b+1 (a≠1)&lt;br /&gt;
&lt;br /&gt;
     Hence m=k*b+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist, because m should be an integer.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11598</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11598"/>
		<updated>2012-09-12T18:51:46Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:12-240-Splash.png]]&lt;br /&gt;
[[12-240/Classnotes for Thursday September 13]]&lt;br /&gt;
[[12-240/Classnotes for Tuesday September 11]]&lt;br /&gt;
&lt;br /&gt;
In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number N which is not a prime number can not &amp;quot;form&amp;quot; a field. &lt;br /&gt;
&lt;br /&gt;
If you do not understand what the F(n) means, you can look through the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;Why all the numbers  which are not prime numbers can not form a field F(n)?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) &lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*  0  1  2  3  .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
1  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
2  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
3  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
4  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
.  .  .  .  .  .......................&lt;br /&gt;
&lt;br /&gt;
a 0  (a)  (2a)  (3a)...........(a*b).....(n-1)*a ( in this row, every element mod n) &lt;br /&gt;
&lt;br /&gt;
....................................&lt;br /&gt;
&lt;br /&gt;
....................................&lt;br /&gt;
&lt;br /&gt;
......................................&lt;br /&gt;
&lt;br /&gt;
.....................................&lt;br /&gt;
 &lt;br /&gt;
n-1.................................. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, actually each row or column, to meet the rule :Existence of Negatives/Inverses. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
So if F(n) is a field, then &lt;br /&gt;
  1.m*a=k*n+1   (k,m∈N*, m&amp;lt;n)   there must exist k,m.&lt;br /&gt;
  2.n=ab&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
==&amp;gt;&amp;gt;m*a=k*a*b+1 (a≠1)&lt;br /&gt;
&lt;br /&gt;
==&amp;gt;&amp;gt;m=k*b+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist, because m should be an integer.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11597</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11597"/>
		<updated>2012-09-12T18:48:30Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:12-240-Splash.png]]&lt;br /&gt;
[[12-240/Classnotes for Thursday September 13]]&lt;br /&gt;
[[12-240/Classnotes for Tuesday September 11]]&lt;br /&gt;
&lt;br /&gt;
In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number N which is not a prime number can not &amp;quot;form&amp;quot; a field. &lt;br /&gt;
&lt;br /&gt;
If you do not understand what the F(n) means, you can look through the file &amp;quot;12-240/Classnotes for Tuesday September 11&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) &lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*  0  1  2  3  .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
1  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
2  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
3  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
4  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
.  .  .  .  .  .......................&lt;br /&gt;
&lt;br /&gt;
a 0  (a)  (2a)  (3a)...........(a*b).....(n-1)*a ( in this row, every element mod n) &lt;br /&gt;
&lt;br /&gt;
....................................&lt;br /&gt;
&lt;br /&gt;
....................................&lt;br /&gt;
&lt;br /&gt;
......................................&lt;br /&gt;
&lt;br /&gt;
.....................................&lt;br /&gt;
 &lt;br /&gt;
n-1.................................. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, actually each row or column, to meet the rule :Existence of Negatives/Inverses. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
So if F(n) is a field, then &lt;br /&gt;
  1.m*a=k*n+1   (k,m∈N*, m&amp;lt;n)   there must exist k,m.&lt;br /&gt;
  2.n=ab&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
==&amp;gt;&amp;gt;m*a=k*a*b+1 (a≠1)&lt;br /&gt;
&lt;br /&gt;
==&amp;gt;&amp;gt;m=k*b+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist, because m should be an integer.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/&amp;diff=11592</id>
		<title>12-240/</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/&amp;diff=11592"/>
		<updated>2012-09-12T15:55:17Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: 12-240/ moved to 12-240/Fields&amp;#039; Further proof: Lack title&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#redirect [[12-240/Fields&#039; Further proof]]&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11591</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11591"/>
		<updated>2012-09-12T15:55:17Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: 12-240/ moved to 12-240/Fields&amp;#039; Further proof&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number N which is not a prime number can not &amp;quot;form&amp;quot; a field. We should ask why...&lt;br /&gt;
 &lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) &lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*  0  1  2  3  .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
1  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
2  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
3  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
4  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
a 0  (a)  (2a)  (3a)...........(a*b).....(n-1)*a ( in this row, every element mod n) &lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
 &lt;br /&gt;
n-1.................................. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, each row precisely to meet the rule. ( The rule... you know, I cannot find some notations.) &lt;br /&gt;
&lt;br /&gt;
If F(n) is a field, then &lt;br /&gt;
  1.m*a=k*n+1   (k,m∈N*, m&amp;lt;n)&lt;br /&gt;
  2.n=ab&lt;br /&gt;
 &lt;br /&gt;
==&amp;gt;&amp;gt;m=kb+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11589</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11589"/>
		<updated>2012-09-12T14:51:44Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number N which is not a prime number can not &amp;quot;form&amp;quot; a field. We should ask why...&lt;br /&gt;
 &lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) &lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*  0  1  2  3  .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
1  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
2  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
3  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
4  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
a 0  (a)  (2a)  (3a)...........(a*b).....(n-1)*a ( in this row, every element mod n) &lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
 &lt;br /&gt;
n-1.................................. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
There must be a &amp;quot;1&amp;quot; in this row, each row precisely to meet the rule. ( The rule... you know, I cannot find some notations.) &lt;br /&gt;
&lt;br /&gt;
If F(n) is a field, then &lt;br /&gt;
  1.m*a=k*n+1   (k,m∈N*, m&amp;lt;n)&lt;br /&gt;
  2.n=ab&lt;br /&gt;
 &lt;br /&gt;
==&amp;gt;&amp;gt;m=kb+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11557</id>
		<title>12-240/Fields&#039; Further proof</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=12-240/Fields%27_Further_proof&amp;diff=11557"/>
		<updated>2012-09-12T01:10:11Z</updated>

		<summary type="html">&lt;p&gt;Michael.Wang: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In the first class, Professor says something about particular fields. Forgive me, because I am an international student, if I can not express information precisely.&lt;br /&gt;
 &lt;br /&gt;
About: F(n) F(1) F(2) and F(3) are a field, but F(4) is not. Professor said that any number N which is not a prime number can not &amp;quot;form&amp;quot; a field. We should ask why...&lt;br /&gt;
 &lt;br /&gt;
Here is the proof. &lt;br /&gt;
&lt;br /&gt;
If we have a field F(n), and n=a*b (a,b,n∈ N*, a,b≠1) &lt;br /&gt;
&lt;br /&gt;
IN defination of multiplication &lt;br /&gt;
&lt;br /&gt;
*  0  1  2  3  .......... b.......n-1 &lt;br /&gt;
&lt;br /&gt;
0  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
1  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
2  .  .  .  .  ...................... &lt;br /&gt;
&lt;br /&gt;
3  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
4  .  .  .  .  ....................... &lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
a 0  (a)  (2a)  (3a)...........(a*b).....(n-1)*a ( in this row, every element mod n) &lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
&lt;br /&gt;
.&lt;br /&gt;
 &lt;br /&gt;
n-1.................................. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
see the (a+1)th row &lt;br /&gt;
&lt;br /&gt;
If F(n) is a field, then &lt;br /&gt;
  1.m*a=k*n+1   (k,m∈N*, m&amp;lt;n)&lt;br /&gt;
  2.n=ab&lt;br /&gt;
 &lt;br /&gt;
==&amp;gt;&amp;gt;m=kb+1/a &lt;br /&gt;
&lt;br /&gt;
unless a=1 &lt;br /&gt;
      m will not exist.&lt;br /&gt;
    so F(n), when n is not a prime number, is not a field.&lt;br /&gt;
&lt;br /&gt;
                  There is a large need for me to improve my format. Editing is welcomed.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   PS: But till now, there are still some questions existing.&lt;br /&gt;
       How can we prove that a prime number N can absolutely form a field? Is there any exception?&lt;br /&gt;
       I am still working on it.&lt;br /&gt;
                                                                 ----Michael.Wang&lt;/div&gt;</summary>
		<author><name>Michael.Wang</name></author>
	</entry>
</feed>