/sci/ - Science & Math » Thread #12316120

3MiB, 4032x3024, 20201107_085436.jpg

View Same Google iqdb SauceNAO

anyone seen this before

Anonymous Sat 07 Nov 23:16:06 2020 No.12316120 View Reply Original Report

Quoted By: >>12316375

Just wanted to find out if this pattern in Pascal's triangle has been discovered.

Anonymous

Anonymous Sun 08 Nov 2020 00:28:07 No.12316375 Report

Quoted By:

>>12316120
TAKE YOUR MEDS NOW QUICK!

Anonymous

Anonymous Sun 08 Nov 2020 17:36:31 No.12318377 Report

Quoted By:

[1(n^x),2(n^x),1(n^x)]

Anonymous

Anonymous Sun 08 Nov 2020 17:50:51 No.12318427 Report

Quoted By: >>12318744

The NN^x part looks like the binomial theorem.

Anonymous

Anonymous Sun 08 Nov 2020 19:32:58 No.12318744 Report

Quoted By:

>>12318427
It is. But the pattern holds for larger repeating n= 0-9 to some power x. Pascal is hypothesized as a subset of n.....n^x sets

Anonymous

Anonymous Sun 08 Nov 2020 19:40:06 No.12318755 Report

Quoted By: >>12318783

a number is prime if it can divide every number with its row number except 1.

Anonymous

Anonymous Sun 08 Nov 2020 19:48:33 No.12318783 Report

Quoted By:

>>12318755
Fermats little theorem is simply a row sum divisibility test for higher dimensional pascal triangles. When you add certain set of numbers together with different weights it becomes unlikely for reminders to be the same.

Anonymous

Anonymous Sun 08 Nov 2020 20:07:43 No.12318866 Report

Quoted By:

[1(n^2),2(n^2),1(n^2)]=nn^2
[1(n^3),3*(n^3),3(n^3),1(n^3)]=nn^3
......

This pattern is what I am asking about. If it has been seen before and extended to n.....n^x

Capcode	All Only User Posts Only Moderator Posts Only Admin Posts Only Developer Posts
Show Posts	All Only With Images Only Without Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

Your latest searches