Difference between revisions of "Proofs to Some Number Theory Facts"

(Created page with "There are some very useful facts in Number Theory that have no names. ==Fact 1== ===Statement=== ===Proof=== ===Uses=== ===Examples=== ===Problems=== ==Fact 2==...")
 
m
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
There are some very useful facts in [[Number Theory]] that have no names.  
+
There are some very useful facts in [[Number Theory]] that have no names. If you have a fact, feel free to add it to this page.
  
 
==Fact 1==
 
==Fact 1==
  
 
===Statement===
 
===Statement===
 +
For a prime number <math>p</math>, we have
 +
 +
<cmath>\dbinom{2p}{p} \equiv 2 \pmod {p}</cmath>
  
 
===Proof===
 
===Proof===
 +
We have the congruence
 +
 +
<cmath>(p-1)! \cdot \dbinom{2p}{p} = 2 \cdot (2p-1) \cdot (2p-2) \cdot \dots \cdot (p+1) \equiv 2 \cdot (p-1)! \equiv -2 \pmod {p}</cmath>
 +
 +
<cmath>\implies \dbinom{2p}{p} \equiv 2 \pmod {p}</cmath>
  
 
===Uses===
 
===Uses===
Line 12: Line 20:
  
 
===Problems===
 
===Problems===
 
  
 
==Fact 2==
 
==Fact 2==

Latest revision as of 22:03, 9 January 2025

There are some very useful facts in Number Theory that have no names. If you have a fact, feel free to add it to this page.

Fact 1

Statement

For a prime number $p$, we have

\[\dbinom{2p}{p} \equiv 2 \pmod {p}\]

Proof

We have the congruence

\[(p-1)! \cdot \dbinom{2p}{p} = 2 \cdot (2p-1) \cdot (2p-2) \cdot \dots \cdot (p+1) \equiv 2 \cdot (p-1)! \equiv -2 \pmod {p}\]

\[\implies \dbinom{2p}{p} \equiv 2 \pmod {p}\]

Uses

Examples

Problems

Fact 2

Statement

Proof

Uses

Examples

Problems

Fact 3

Statement

Proof

Uses

Examples

Problems

Fact 4

Statement

Proof

Uses

Examples

Problems

Fact 5

Statement

Proof

Uses

Examples

Problems

Fact 6

Statement

Proof

Uses

Examples

Problems

Fact 7

Statement

Proof

Uses

Examples

Problems

See Also

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