Difference between revisions of "Slalom conjuncture"

(Created page with "<h1>The Slalom Conjuncture</h1> <h2>As discovered by Elbertpark</h2> <h3>Written by Elbertpark</h3> <h4>Idea made by Elbertpark...</h4> <h5>and so on</h5> <h1>What IS the Sla...")
 
m
 
(8 intermediate revisions by 4 users not shown)
Line 1: Line 1:
<h1>The Slalom Conjuncture</h1>
 
<h2>As discovered by Elbertpark</h2>
 
<h3>Written by Elbertpark</h3>
 
<h4>Idea made by Elbertpark...</h4>
 
<h5>and so on</h5>
 
  
<h1>What IS the Slalom Conjuncture?</h1>
+
 
<p>The Slalom Conjuncture was discovered during a math assignment. It states that if there is an odd square <math>n^2</math>, then this square has a maximum of <math>n^2 - 2n</math> factors.</p>
+
<p>The Slalom Conjecture was discovered during a math assignment. It states that if there is an odd square <math>n^2</math>, then this square has a maximum of <math>n^2 - 2n</math> factors starting from 3.</p>
  
 
Listed is a table of squares and factors up to 11.
 
Listed is a table of squares and factors up to 11.
Line 61: Line 56:
 
   </tr>
 
   </tr>
 
</table>
 
</table>
Note that most of the squares, even 4001, have only 3 factors.
+
Notice that most of the squares, even 4001, have only 3 factors.
<h1>Proof</h1>
+
 
Unfortunately, only Doggo and Gmaas have the logical, solid proof to this conjuncture. That is why this is a conjuncture.
+
<code> This article is a stub. Help us by expanding it.<code>
<h2>Broken proof</h2>
 
For now we can agree that because soon the squares will be growing exponentially, this conjuncture cannot be wrong... yet.
 

Latest revision as of 17:08, 15 July 2022


The Slalom Conjecture was discovered during a math assignment. It states that if there is an odd square $n^2$, then this square has a maximum of $n^2 - 2n$ factors starting from 3.

Listed is a table of squares and factors up to 11.

Number $n^2$ # of factors
1 1 1
3 9 3
5 25 3
7 49 3
9 81 5
11 121 3
... ... ...
81 6561 9
4001 16008001 3

Notice that most of the squares, even 4001, have only 3 factors.

This article is a stub. Help us by expanding it.