<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Math on Lomont.org</title>
		<link>https://www.lomont.org/tags/math/</link>
		<description>Recent content in Math on Lomont.org</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
		
		
		
			<lastBuildDate>Fri, 26 Jul 2024 07:50:18 -0400</lastBuildDate>
		
			<atom:link href="https://www.lomont.org/tags/math/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>MinimalTicTacToe</title>
				<link>https://www.lomont.org/posts/2024/minimaltictactoe/</link>
				<pubDate>Fri, 26 Jul 2024 07:50:18 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2024/minimaltictactoe/</guid>
				<description>&lt;!--summary--&gt;&#xD;&#xA;&lt;p&gt;Derivation of a minimal size tree for playing perfect tic tac toe&lt;/p&gt;</description>
			</item>
			<item>
				<title>Correct alpha and gamma for image processing</title>
				<link>https://www.lomont.org/posts/2023/correctalphagammaforimages/</link>
				<pubDate>Mon, 28 Aug 2023 18:40:19 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2023/correctalphagammaforimages/</guid>
				<description>&lt;p&gt;This is a note on the correct usage of alpha blending, pre-multiplied alpha, gamma correction, and linear colors for image processing.&lt;/p&gt;</description>
			</item>
			<item>
				<title>A better quadratic formula algorithm</title>
				<link>https://www.lomont.org/posts/2022/a-better-quadratic-formula-algorithm/</link>
				<pubDate>Sat, 27 Aug 2022 08:12:01 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2022/a-better-quadratic-formula-algorithm/</guid>
				<description>&lt;p&gt;A robust algorithm for computing roots of quadratic equations, much better than common code.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Rtk Gps Project</title>
				<link>https://www.lomont.org/posts/2020/rtk-gps-project/</link>
				<pubDate>Mon, 07 Dec 2020 20:25:57 -0500</pubDate>
				<guid>https://www.lomont.org/posts/2020/rtk-gps-project/</guid>
				<description>&lt;p&gt;I built a RTK-GPS gadget and wrote enough software to do basic GNS tasks such as finding distances, decoding GPS NMEA and RTCM messages, finding intersections, and doing boundary detection.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Chris Lomont&#39;s Riddle Pages</title>
				<link>https://www.lomont.org/riddles/how-many-prisoners/</link>
				<pubDate>Thu, 06 Jun 2019 07:55:47 -0400</pubDate>
				<guid>https://www.lomont.org/riddles/how-many-prisoners/</guid>
				<description>&lt;p&gt;Summary&lt;/p&gt;</description>
			</item>
			<item>
				<title>Chris Lomont&#39;s Riddle Pages</title>
				<link>https://www.lomont.org/riddles/prisoners-in-limbo/</link>
				<pubDate>Thu, 06 Jun 2019 07:55:47 -0400</pubDate>
				<guid>https://www.lomont.org/riddles/prisoners-in-limbo/</guid>
				<description>&lt;p&gt;Summary&lt;/p&gt;</description>
			</item>
			<item>
				<title>Computation: Theory, Methods, Limitations, and the Future</title>
				<link>https://www.lomont.org/talks/2019/quantum-computing/</link>
				<pubDate>Mon, 25 Feb 2019 12:58:12 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2019/quantum-computing/</guid>
				<description>&lt;p&gt;These slides are from a talk I gave on many aspects of computing, starting with classical computing (Hilbert&amp;rsquo;s 10th problem, Church and Turing, Godel, boolean functions, complexity theory, transistors, Moore&amp;rsquo;s law and demise), then going through physics (relativity, quantum mechanics, quantum field theory), and finally into quantum computing basics (qubits, superposition, entanglement, no cloning, basic gates) and quantum algorithms (Deutsch, Simon, Shor, Grover).&lt;/p&gt;&#xA;&lt;p&gt;Then I cover advanced quantum topics, such as quantum machines,quantum complexity theory, the Quantum-Church-Turing-Deutsch principle, graph isomorphism, quantum error correction, and quantum security. A final speculative section covers even weirder computation ideas (closed timelike curves, string computing) and how computing seems intertwined with the nature of reality (It from Bit, Simulation Hypothesis, Free Will Theorem).&lt;/p&gt;</description>
			</item>
			<item>
				<title>Intro to Wireless Communications</title>
				<link>https://www.lomont.org/talks/2018/intro-to-wireless/</link>
				<pubDate>Sat, 21 Jul 2018 12:59:10 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2018/intro-to-wireless/</guid>
				<description>&lt;p&gt;This talk is an intro to wireless communications, starting with the basic physics of EM waves and how they interact with materials, then how antennas work, then on to antenna properties and design. Next  modulation schemes are discussed, showing how data is encoded and transmitted over noisy channels via modulation, spread spectrum, time and frequency division, and other methods. Noise in the form of doppler, intermodulation, and other causes is covered. Information theory (channel capacity, Shannon entropy, error correction) is covered. Finally specific protocols are analyzed under this framework: FM, NTSC, remotes, WiFi, Bluetooth, ZigBee, satellite radio, GPS, and cellular formats.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Cryptography Best Practices 2018</title>
				<link>https://www.lomont.org/talks/2018/crypto-practices-2018/</link>
				<pubDate>Mon, 02 Apr 2018 12:58:39 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2018/crypto-practices-2018/</guid>
				<description>&lt;p&gt;This talk covers cryptography best practices as of April, 2018. Background on each area is covered, with each section ending with a best practices slide. Sections are Symmetric Encryption, Asymmetric Encryption, Key Lengths, Hashing/HMAC, Password usage, Key Exchange, Random number generation, Digital Signatures,&lt;/p&gt;</description>
			</item>
			<item>
				<title>The Cosmic Distance Ladder</title>
				<link>https://www.lomont.org/talks/2017/distance-ladder/</link>
				<pubDate>Sun, 19 Nov 2017 12:58:24 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2017/distance-ladder/</guid>
				<description>&lt;p&gt;The Cosmic Distance Ladder is how mankind has determined the distances to various astronomical objects, basically by deducing closer &amp;ldquo;rungs&amp;rdquo; on the ladder and using them to determine farther distances (higher rungs on the ladder).&lt;/p&gt;&#xA;&lt;p&gt;These notes are from Terry Tao, modified by me to suit my audience and to add other topics.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Walking Ant Probability Problem</title>
				<link>https://www.lomont.org/posts/2017/walking-ant/</link>
				<pubDate>Wed, 01 Nov 2017 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/walking-ant/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s a math puzzle.&lt;/p&gt;</description>
			</item>
			<item>
				<title>A Universal FRACTRAN Interpreter in FRACTRAN</title>
				<link>https://www.lomont.org/posts/2017/fractran/</link>
				<pubDate>Mon, 01 May 2017 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/fractran/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s FRACTRAN, a weird fraction based programming language, written in FRACTRAN.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Generating Uniform Random Numbers on [0,1]</title>
				<link>https://www.lomont.org/posts/2017/unit-random/</link>
				<pubDate>Sun, 05 Mar 2017 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/unit-random/</guid>
				<description>&lt;p&gt;How does one generate uniform random numbers in [0,1] using IEEE 754 floating point formats? It&amp;rsquo;s tricky.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Efficient divisibility testing</title>
				<link>https://www.lomont.org/posts/2017/divisibility-testing/</link>
				<pubDate>Tue, 21 Feb 2017 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/divisibility-testing/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s bit tricks for efficient divisibility testing.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Average segment length</title>
				<link>https://www.lomont.org/posts/2016/random-segment-length/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/random-segment-length/</guid>
				<description>&lt;p&gt;What&amp;rsquo;s the average length of a segment chosen uniformly by area on a unit square?&lt;/p&gt;</description>
			</item>
			<item>
				<title>How many prisoners?</title>
				<link>https://www.lomont.org/posts/2016/how-many-prisoners/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/how-many-prisoners/</guid>
				<description>&lt;p&gt;This is a nicely hard problem in the common prisoners and warden format.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Pick a Number</title>
				<link>https://www.lomont.org/posts/2016/pick-a-number/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/pick-a-number/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s a result that is completely non-intuitive.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Test site features</title>
				<link>https://www.lomont.org/posts/site-test/</link>
				<pubDate>Fri, 01 Jul 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/site-test/</guid>
				<description>&lt;p&gt;A post to test site features such as tables, math, code&amp;hellip;&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
