Fermat's little theorem


p is a prime number and {a} can't be divided by p.

You use the strong induction to prove Fermat's little theorem.

∴

This is the 7th row of Pascal’s triangle.


Odd numbers are 1, and even numbers are 0.


This is fractal.


i
0
1
2
3
4
5
6
7

p
1
7
21
35
35
21
7
1


(p,i)≡0 mod p


(i≠0,7)

For example, (7,2)=7!/2!(7-2)!=5040/240=21

p!=p(p-1)!

∴

1^p≡1 mod p


This is apparent.

Therefore

2^p=(1+1)^p=1+(p,1)+(p,2)+・・・+(p,p-1)+1≡1+0+0+0+・・・+1=2 mod p

3^p=(1+2)^p=1+2(p,1)+2^2(p,2)+・・・+2^(p-1)(p,p-1)+2^p≡1+0+0+0+・・・+2=3 mod p

4^p=(1+3)^p=1+3(p,1)+3^2(p,2)+・・・+3^(p-1)(p,p-1)+3^p≡1+0+0+0+・・・+3=4 mod p

You can expand it because of Pascal’s triangle which is the binomial theorem.


(n,i)=n!/i!(n-i)!


Then you define a^(p-1).

5^16≡1 mod 17

This is also clear, so you can prove the strong induction.













コメント

コメントを投稿

このブログの人気の投稿

The Sylvester-Gallai Theorem

イメージ
The deformation is the mathematical concept. The Sylvester-Gallai Theorem is that a finite set of points in the plane have the proper line through any two of them, and it passes through a third point of the set. Moreover, it must be on the same line. P is the the noncollinear finite set. S(P) is the set of connecting lines in P. p∈P, s∈S(P) p and s are perpendicular, so they are not the ordinary line. (s*,p*) is the smallest distance, and s* is in the ordinary line. l∩P={p} l must be the ordinary line. This is the contradiction. l∩S(P) There is the cyclically intersection points (p,x1). x1,・・・xk is on l. Moreover it crosses S. This must be ordinary. You also see the extra dimensions. i lines are determined by P.
続きを読む

The Quantum Rhythm of the Primes: The Montgomery-Dyson Confluence

The history of mathematics is often viewed as a progression of isolated starlight—brilliant individuals working in silos of abstraction. However, the most profound breakthroughs usually occur when two distant stars collide. The story of Hugh Montgomery and Freeman Dyson is the premier example of such a collision, revealing that the heart of number theory and the chaotic vibrations of the physical world beat to the exact same drum. ​The Abstract Search for Order ​To understand the magnitude of this discovery, one must first look at the prime numbers . Primes are the "atoms" of mathematics, yet they appear along the number line with a frustratingly unpredictable rhythm. In 1859, Bernhard Riemann proposed that the secret to their distribution lay in the zeros of the Riemann Zeta Function . ​Riemann’s Hypothesis suggested these zeros sit on a single critical line. But even if they were on that line, their specific spacing remained a mystery. Were they clumped together like s...
続きを読む

Geometric Infinite Expansion of Squares and the Fractal Model of Prime Creation at the +1 Boundary

イメージ
This paper introduces a geometric framework that defines numbers not as dimensionless points, but as the areas of squares, emphasizing dimension and spatial extension. By modeling the interaction between the infinity of the integer space and the self-similar (fractal) expansion of squares . This is my formula which generate prime numbers. In geometric terms, this formula is rigorously illustrated as follows: 1. Core Formation: A closed square domain of area p^2 , with a side length equal to the prime p. 2. Asymmetric Expansion (Gnomon): Two rectangular domains of width (d−1) and length p, structurally appended to the horizontal and vertical boundaries, denoted by 2p(d−1). This process represents an infinite expansion algorithm wherein the square consumes the external integer space while strictly preserving its own self-similarity. Squares possess the highest structural affinity for fractals due to their capacity for infinite grid-like division and consolidation. As d progr...
続きを読む