subject
Mathematics, 29.05.2020 12:57 carvarceuanmoss

I’ve actually been struggling with this:

For $n>0$, $\lbrace s_i\rbrace$ is said to simply solve $SRS(n)$ if for all $k=0,1,...,n-1$, it is true that $s_k
$s_k = 1 + \sum_{i=0}^{n-1} \text{Ch}_{k}(s_i)$ where $\text{Ch}_k$ is the indicator function for the singleton set containing $k$.

Prove or disprove that the only simple solution that exists for $n>5$, which aren’t multiples of 3, is

$s_0=s_{n-2}=s_{n-1}=1$

$s_1=n-3$

$s_2=3$

$s_i=2$ for $2
And that there are none for $n$ which are multiples of $3$

ansver
Answers: 1

Another question on Mathematics

question
Mathematics, 21.06.2019 14:40
Chose the graph below that represents the following system of inequality’s
Answers: 2
question
Mathematics, 22.06.2019 00:40
Cuántos triángulos forman un diamante
Answers: 1
question
Mathematics, 22.06.2019 01:20
Which of the following shows the graph of y=2e^x?
Answers: 2
question
Mathematics, 22.06.2019 03:00
Determine the lengths of the sides of the rectangle using the given area. give answers both exactly and approximately (to the nearest tenth). the area of the rectangle is 46 cm2.
Answers: 1
You know the right answer?
I’ve actually been struggling with this:

For $n>0$, $\lbrace s_i\rbrace$ is said to s...
Questions
question
Arts, 18.03.2021 19:10
question
Mathematics, 18.03.2021 19:10
Questions on the website: 13722365