|
|
| Author |
Message |
levine121323@yahoo.com
science forum beginner
Joined: 21 Jul 2006
Posts: 1
|
 Posted: Fri Jul 21, 2006 6:17 am Post subject:
a subset of natural number
|
|
|
Let A={a_i} and B={b_i} (i=[1,100]) be 2 sets natural numbers
(delivered randomly in range [1,10])
for example, i=8 then
A={1,2,5,6,7,8,5,6}
B={4,1,2,5,7,10,5,6}
I like to prove that there exists a repeated pattern of A in B that is
largest, in my example it is {1,2,5} |
|
| Back to top |
|
 |
David C. Ullrich
science forum Guru
Joined: 28 Apr 2005
Posts: 2250
|
| Posted: Fri Jul 21, 2006 10:44 am Post subject:
Re: a subset of natural number
|
|
|
On 20 Jul 2006 23:17:07 -0700, levine121323@yahoo.com wrote:
| Quote: | Let A={a_i} and B={b_i} (i=[1,100]) be 2 sets natural numbers
(delivered randomly in range [1,10])
for example, i=8 then
A={1,2,5,6,7,8,5,6}
B={4,1,2,5,7,10,5,6}
I like to prove that there exists a repeated pattern of A in B that is
largest, in my example it is {1,2,5}
|
First, you're not talking about sets, you're talking about
sequences.
Anyway, the existence of a largest repeated pattern from A in B
is obvious. Look at all the subsequences of A that appear in
B. There are only finitely many. One of them has maximal length.
(Maybe by "largest" you mean that it is _strictly_ longer than
any other repeated subsequence? You can't prove that because
it's easy to give examples where it's not true.)
************************
David C. Ullrich |
|
| Back to top |
|
|
Google
|
|
| Back to top |
|
|
|
|
The time now is Thu Jun 29, 2017 2:22 pm | All times are GMT
|
|
Copyright © 2004-2005 DeniX Solutions SRL
|
|
Other DeniX Solutions sites:
Electronics forum |
Medicine forum |
Unix/Linux blog |
Unix/Linux documentation |
Unix/Linux forums |
send newsletters
|
| |
|
Powered by phpBB © 2001, 2005 phpBB Group
|
|
FAQ
Search
Memberlist
Usergroups
Profile
Log in to check your private messages
Log in
Forum index
»
Science and Technology
»
Math
