Formula to compute number of groups from given points with overlap

veda87
Messages
1
Reaction score
0
The problem is kind of easy to understand.

Given is some points, say 10 points. (I am using numbering for understanding)

0 1 2 3 4 5 6 7 8 9

Now group these such that the group size is 5 and there is no overlap
so, there can be 2 groups. the groups are (0 1 2 3 4) & (5 6 7 8 9)

Now group the above given points such that the group size is 5 and overlap is 1
so, there can be 3 groups. the groups are (0 1 2 3 4) & (4 5 6 7 8) & (8 9) //Note: don't worry that (8 9) group has only 2 points

Now group the above given points such that the group size is 5 and overlap is 3
so, there can be 3 groups. the groups are (0 1 2 3 4) & (3 4 5 6 7 ) & (6 7 8 9)

Similarly...

group size | overlap size | number of groups
5 | 0 | 2
5 | 1 | 3
5 | 2 | 3
5 | 3 | 4
5 | 4 | 6I am looking for some generalized formula to compute the number of groups

So, given the group size and overlap size, find the number of groups. Can anyone help me with finding a generalized formula
 
Mathematics news on Phys.org
This is combinatorics.
  • First define your problem statement properly: e.g. why isn't ##\{\,0,1,2,3,5\,\}\cup \{\,4,6,7,8,9\,\}## a solution for your first partition?
  • Next look up or derive the formulas you think will apply.
  • Finally prove these formulas by induction.
But the crucial point is the first one!
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
7
Views
2K
Replies
24
Views
2K
Replies
8
Views
1K
Replies
8
Views
2K
Replies
3
Views
1K
Back
Top