Ask your own question, for FREE!
Mathematics 14 Online
OpenStudy (anonymous):

.

OpenStudy (anonymous):

ok now i have done wew xD

ganeshie8 (ganeshie8):

let me see if i understand the problem correctly so it seems you are definining a finite set with primes : \(P = \{p_1,~p_2,\ldots, p_n\}\)

OpenStudy (anonymous):

and be carfull x(n) is not constant

OpenStudy (anonymous):

yes @ganeshie8

OpenStudy (anonymous):

wanna example ?

ganeshie8 (ganeshie8):

i feel lost after that :O

OpenStudy (anonymous):

>.<

ganeshie8 (ganeshie8):

yes

myininaya (myininaya):

\[\left\{ 3+3,3+5,3+7,3+11,3+13,...,3+p_n \right\}\]

myininaya (myininaya):

like i think w to show any p_i bigger than 3 is going to be a subset of that set

myininaya (myininaya):

like for example if we had 5 and 5>3 \[\left\{ 5+7,5+11,5+13,5+17,... \right\}\]

myininaya (myininaya):

\[\left\{ 5+7,5+11,5+13,5+17,... ,5+p_n\right\}\]*

myininaya (myininaya):

but maybe not since 5+7 is not in the first set I mentioed

OpenStudy (anonymous):

ok here is an example :- P={3,5,7,......,31} S={ 6,8,10,....,54,58,60} then let x(n)=n-3 x(10)=7 (since 31 have position 10 ) so we have {6,8,......, 2(19) } subset of S @ganeshie8

ganeshie8 (ganeshie8):

So P is a set with first "n" odd primes ?

OpenStudy (anonymous):

yep

ganeshie8 (ganeshie8):

ok, makes sense :) i find the problem statement is challenging :P

OpenStudy (anonymous):

ehi made a typo at the second line xD hope u note

OpenStudy (anonymous):

oh i though it exited grrrrr

ganeshie8 (ganeshie8):

\(P\) is a set of first "n" odd primes \(S = \{a+b~ | ~a \in P~ \land~ b \in P\}\)

OpenStudy (anonymous):

yeahhh :D

ganeshie8 (ganeshie8):

i dont get why 8 is there in ur set \( \left \{ 6, \color{Red}{8},10,.....,2p_{x(n)}\right\} \)

ganeshie8 (ganeshie8):

8 = 2*4 and 4 is not a prime :/

OpenStudy (anonymous):

but 8=5+3 xD which is in S set hmm seems like u really dont get the question :| 2*p is the limit

OpenStudy (anonymous):

i dint define the set of term of 2*n

ganeshie8 (ganeshie8):

the problem was poorly phrased, so im still struggling to make sense of it

OpenStudy (anonymous):

:| then forget it

ganeshie8 (ganeshie8):

ugh im still reading/rereading the problem :/

ganeshie8 (ganeshie8):

i still don't get what we need to show here

ganeshie8 (ganeshie8):

\[\Large \Large \text {show that for any finite prime set } \Large P= \left \{ p_1,p2,....p_n \right\}~~~ \\ \Large ~~~ \text{s.t} P_1=3 ~\text{ and }~ p_i\leq p_{i+1} ~\forall i,i+1<n\in N\\ \Large \text{if we defined a set S s.t }\\ \Large S= \left \{ p_i+p_j :\forall i,j\leq n \right \} \\ \Large \text{ then , there exist x(n) a sequence of integers s.t } \\ \Large \left \{ 6,8,10,.....,2p_{x(n)} \right \}\subseteq S \text { note that }\\ \Large x(n) \in N \text{ and } x(n)<n\]

OpenStudy (anonymous):

i deleted that :|

OpenStudy (anonymous):

and no i dont wanna tell u , just leave it

ganeshie8 (ganeshie8):

?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!