<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Tomkup32</id>
	<title>Conservapedia - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Tomkup32"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/Special:Contributions/Tomkup32"/>
	<updated>2026-10-05T04:21:59Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Talk:Majoring_in_Mathematics&amp;diff=728234</id>
		<title>Talk:Majoring in Mathematics</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Talk:Majoring_in_Mathematics&amp;diff=728234"/>
		<updated>2009-12-09T15:58:39Z</updated>

		<summary type="html">&lt;p&gt;Tomkup32: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is an extremely rough outline for this new article.  I will continue to expand it over the next few weeks based on feedback about the appropriateness of the problems and other suggestions for improvements.  Please let me know what you think! --[[User:MarkGall|MarkGall]] 23:12, 4 October 2009 (EDT)&lt;br /&gt;
::well I was a math  major in college many years ago (before Rubic's cube!)  Suggest adding statistics. [[User:RJJensen|RJJensen]] 23:17, 4 October 2009 (EDT)&lt;br /&gt;
:::Ah, good idea.  At my undergrad school mathematics and statistics were separate programs, but I guess this isn't typical.  I'll throw in a new section.  I'm not much for statistics -- can anyone suggest some good problems? --[[User:MarkGall|MarkGall]] 23:20, 4 October 2009 (EDT)&lt;br /&gt;
&lt;br /&gt;
Tremendous work, Mark.  I'll try to add something for probability or statistics, which I studied.--[[User:Aschlafly|Andy Schlafly]] 23:22, 4 October 2009 (EDT)&lt;br /&gt;
:Great, thanks.  These are subjects in which I'm inexpert.  Now I'm inclined to move Probability/Statistics to a &amp;quot;field&amp;quot; along with algebra, analysis, etc.  Please add a nice problem or theorem if you have any in mind! --[[User:MarkGall|MarkGall]] 23:24, 4 October 2009 (EDT)&lt;br /&gt;
&lt;br /&gt;
Terrific analysis on what college mathematics is not.  That should be required reading for many seeking to major in math!--[[User:Aschlafly|Andy Schlafly]] 22:30, 15 October 2009 (EDT)&lt;br /&gt;
&lt;br /&gt;
Why is there no mention of the bible or theology in this article?  It should be mentioned, as it is in [[Axiom_of_Infinity]], that the notion of an infinite set is somewhat blasphemous. [[User:Tomkup32|Tomkup32]] 10:58, 9 December 2009 (EST)&lt;/div&gt;</summary>
		<author><name>Tomkup32</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=G%C3%B6del%27s_completeness_theorem&amp;diff=728229</id>
		<title>Gödel's completeness theorem</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=G%C3%B6del%27s_completeness_theorem&amp;diff=728229"/>
		<updated>2009-12-09T15:52:24Z</updated>

		<summary type="html">&lt;p&gt;Tomkup32: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Gödel's completeness theorem''' was proven by [[Kurt Gödel]], which states:&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&lt;br /&gt;
Any [[formula]] in first-order predicate [[calculus]] is true only if it [[sound]]s true.&lt;br /&gt;
&amp;lt;/blockquote&amp;gt; &lt;br /&gt;
&lt;br /&gt;
==Theological Implications==&lt;br /&gt;
&lt;br /&gt;
The nature of The Completeness Theorem has far-reaching implications in the field of Theistic Creation.  For instance, it is clear that God made the world, as only He could make first order logic complete.  The soundness of the statement &amp;quot;God exists and is all things to all men&amp;quot; is proven within first-order predicates, meaning that The Completeness Theorem provides a mathematical proof for the existence and omnipotence of God.  Kurt Gödel himself once claimed, &amp;quot;Even my surname is simply 'God,' with an added 'el' and an umlaut.&amp;quot;&amp;lt;ref&amp;gt;http://www.godelandtheology.org/quotes/quote54.htm&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Logic]][[category: mathematics]]&lt;/div&gt;</summary>
		<author><name>Tomkup32</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Talk:Fermat%27s_Last_Theorem&amp;diff=728193</id>
		<title>Talk:Fermat's Last Theorem</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Talk:Fermat%27s_Last_Theorem&amp;diff=728193"/>
		<updated>2009-12-09T14:26:47Z</updated>

		<summary type="html">&lt;p&gt;Tomkup32: /* Axiom of choice */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The first computer program I wrote - between high school and college - generated solutions to the Pythagorean Theorem. I guess I should have programmed it to count them, too. --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 21:25, 20 December 2007 (EST)&lt;br /&gt;
&lt;br /&gt;
== Axiom of choice ==&lt;br /&gt;
&lt;br /&gt;
Any proof which uses the [[axiom of choice]] can be transformed into a proof that doesn't.  Granted, it will be a somewhat more complicated proof, but it always works, and that's a fact.  That is the reason that AC is much less controversial these days than it was, in the early 1900s. &lt;br /&gt;
&lt;br /&gt;
There is a complete explanation of the process and the proof that it's reliable [http://web.unicam.it/matinf/aila/Scuola%20AILA/sulla%20varieta%20dei%20metodiAC_sem02.pdf here]. &lt;br /&gt;
&lt;br /&gt;
Also, the profoundly intuitive [http://en.wikipedia.org/wiki/Trichotomy_%28mathematics%29 trichotomy] is equivalent to AC, so be careful what you call controversial. [[User:BenjB|BenjB]] 20:29, 27 January 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Any proof which uses the axiom of choice can be transformed into one that doesn't&amp;quot;?!  Lol.  If C is the axiom of choice, then C (vacuously) proves C.  By your assertion, that proof can be 'transformed' into a proof not using C, which means you can prove C from ZF, which is a contradiction.  Really, lol.  [[User:Tomkup32|Tomkup32]] 09:26, 9 December 2009 (EST)&lt;/div&gt;</summary>
		<author><name>Tomkup32</name></author>
	</entry>
</feed>