<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/">
	<channel>
		<title>Proof-based math puzzles</title>
		<link>https://www.lotterypost.com/thread/346308</link>
		<atom:link href="https://www.lotterypost.com/rss/topic/346308" rel="self" type="application/rss+xml" />
		<description>Lottery Post Forum Topic: Proof-based math puzzles</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Reply #5</title>
			<link>https://www.lotterypost.com/thread/346308/7338646</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/346308/7338646</guid>
			<pubDate>Thu, 10 Aug 2023 00:57:18 GMT</pubDate>
			<dc:creator>db101</dc:creator>
			<description><![CDATA[<p>Clever solution Joe, but now you must prove the AM-GM inequality. (just kidding</p>]]></description>
			<category>db101</category>
		</item>
		<item>
			<title>Reply #4</title>
			<link>https://www.lotterypost.com/thread/346308/7338177</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/346308/7338177</guid>
			<pubDate>Wed, 09 Aug 2023 16:30:38 GMT</pubDate>
			<dc:creator>Wavepack</dc:creator>
			<description><![CDATA[<p>Very nice, except for one thing. You&#x27;ve so far shown that the minimum = 10. Next, you need to choose a=b=c=d=e, which in the expression, evaluates to 10.</p>]]></description>
			<category>Wavepack</category>
		</item>
		<item>
			<title>Reply #3</title>
			<link>https://www.lotterypost.com/thread/346308/7338160</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/346308/7338160</guid>
			<pubDate>Wed, 09 Aug 2023 16:05:47 GMT</pubDate>
			<dc:creator>cottoneyedjoe</dc:creator>
			<description><![CDATA[<p>For 2) split the sum (a+d)/sqrt(bc) + (a+c)/sqrt(de) + (b+e)/sqrt(cd) + (b+d)/sqrt(ae) + (c+e)/sqrt(ab) into two sums<br /><br />(a/sqrt(bc) + b/sqrt(cd) + c/sqrt(de) + d/sqrt(ae) + e/sqrt(ab)) +<br /><br />(a/sqrt(de) + b/sqrt(ae) + c/sqrt(ab) + d/sqrt(bc) + e/sqrt(cd))<br /><br />Now invoke the Arithmetic Mean Geometric Mean inequality, which states that for any set of n non-negative real numbers {x1, x2, ..., xn}, their sum is greater than or equal to n times the nth root of their product, with equality only when</p>]]></description>
			<category>cottoneyedjoe</category>
		</item>
		<item>
			<title>Reply #2</title>
			<link>https://www.lotterypost.com/thread/346308/7336095</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/346308/7336095</guid>
			<pubDate>Tue, 08 Aug 2023 14:18:32 GMT</pubDate>
			<dc:creator>db101</dc:creator>
			<description><![CDATA[<p>Very nice solution.</p>]]></description>
			<category>db101</category>
		</item>
		<item>
			<title>Reply #1</title>
			<link>https://www.lotterypost.com/thread/346308/7336030</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/346308/7336030</guid>
			<pubDate>Tue, 08 Aug 2023 11:48:26 GMT</pubDate>
			<dc:creator>Wavepack</dc:creator>
			<description><![CDATA[<p>1) Since the density of primes decreases as the integers increase, our best chance of proving this existence for all N is to make sure the starting odd number is large enough. We want a starting number such that the next N numbers are factorable/composite. The best way to do this is to make the starting number minus three a composite of factors of offsets from the starting number. Let S = starting number = (2N+1)! + 3 .<br /><br />Candidate set of consecutive odd numbers = {(2N+1)! + 3, (2N+1)! + 5, .... &#x5b;&#xa0;<a href="https://www.lotterypost.com/thread/346308/7336030">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>Wavepack</category>
		</item>
		<item>
			<title>Proof-based math puzzles</title>
			<link>https://www.lotterypost.com/thread/346308</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/346308</guid>
			<pubDate>Tue, 08 Aug 2023 05:42:19 GMT</pubDate>
			<dc:creator>db101</dc:creator>
			<description><![CDATA[<p>Someone showed me these problems with clever solutions, so I thought why not share them here. These are not meant to be solved by calculator or computer but by logic and math principles.<br /><br />1) For every positive integer N, is it always possible to find a set of N consecutive odd numbers such that none of them are prime? Why or why not?<br /><br />2) Let a, b, c, d, and e be positive real numbers. What is the minimum value of (a+d)/sqrt(bc) + (a+c)/sqrt(de) + (b+e)/sqrt(cd) + (b+d)/sqrt(ae) + (c+e)/sqr... &#x5b;&#xa0;<a href="https://www.lotterypost.com/thread/346308">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>db101</category>
		</item>
	</channel>
</rss>

