[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
VNSA-L digest 277
VNSA-L Digest 277
Topics covered in this issue include:
1) Re: Math problem: help
by Pham Thi Thanh Hong <smm68490@ait.ac.th>
2) Re: [THO*] Nhu*~ng cuo^.c ddi/ Tho+ Haiku cu?a Nha^.t
by AnHai Doan <anhai@cs.washington.edu>
3) Re: Math problem: help
by Pham Thi Thanh Hong <smm68490@ait.ac.th>
4) Re: Math problem: help
by Le Minh Trung <trung@ait.ac.th>
5) Re: Fwd from Anh PHan Thanh Lam: MIS] Ta`u, Ta^m, Ta`i
by Tran Minh Tien <tran@idefix.mpipks-dresden.mpg.de>
6) The NUMBER is 1687392
by Dung Trong Nguyen <nguyen@jaist.ac.jp>
7) Re: Math problem: help
by Dung Trong Nguyen <nguyen@jaist.ac.jp>
8) Help me :)))
by Tuan Bui <tbui@sgh.waw.pl>
9) Cause and effect
by huy.duong@ctsu.ox.ac.uk
10) HELP!!!: X.25
by Thanh Tung Truong <tung.truong@e-technik.tu-chemnitz.de>
11) Re: Help me :)))
by AnHai Doan <anhai@cs.washington.edu>
12) Re: The NUMBER is 1687392
by Pham Thi Thanh Hong <smm68490@ait.ac.th>
13) Confucianism's best product
by huy.duong@ctsu.ox.ac.uk
14) YES IT'S 9867312
by Dung Trong Nguyen <nguyen@jaist.ac.jp>
15) Small Talks about UNIFICATIONS
by Sonnet Nguyen <Sonnet.Nguyen@fuw.edu.pl>
16) [HELP] uudecode an email from VN
by "Thai Nguyen" <tinguyen@nortel.ca>
17) [FROM ADMIN] INTRODUCING A NEW VNSA ADMIN / MISC
by AnHai Doan <anhai@cs.washington.edu>
18) Tim` ba` con
by ianb@sun670.telecom.tandem.com (Ian Bui)
19) Re: [cult] Village
by Hong Lam Vu <vuh000@goofy.zdv.Uni-Mainz.de>
20) Re: Ti'nh ca'ch ngu+o+`i Vie^.t (half academic style)
by Hong Lam Vu <vuh000@goofy.zdv.Uni-Mainz.de>
----------------------------------------------------------------------
Topic No. 1
Date: Mon, 17 Mar 1997 13:43:28 +0700 (GMT+0700)
From: Pham Thi Thanh Hong <smm68490@ait.ac.th>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Re: Math problem: help
Message-ID: <Pine.OSF.3.94.970317131232.8458A-100000@alphaserv.ait.ac.th>
On Sun, 16 Mar 1997, Tuan V Nguyen wrote:
> Hello math folks,
>
> My son has a math problem, which I can not figure
> out yet, and I would be grateful for your help. The problem
> is:
>
> "Find the largest seven-digit number (say X), where X is
> divisible to every digit. Note that the seven digits are
> unique (no repetition.)"
>
>
> Thank you in advance for your help.
>
> Tuan
>
>
>
>
Hi Tuan,
Maybe because I did not get the whole idea of the problem, so I found its
solution as simple as follows (If it is not reasonable, you could use it
as a reference, OK.)
---------------
Solution
Because, it is the largest seven - digit number and those digits are
unique, so I can guest it is formed under a down trend as 9876543.
As assumption that it is divisable for each of digit, X must be divisable
for 2 and 5. This makes it has a 0 in the end. The number also must be
divisable to 9 (as the first digit in the series). It will have 1 in the
sixth digit (9+8+7+6+5+1+0=36; this number is divisable for 9).
Thus, X might be 9876510. This number is divisable for 7 as required
conditions. However, it is not divisable for 8. To find out the real
result, we substract a number that divisable for all 2,5,7, and 9 from
this number (630). This step will be repeated till the remain is
divisable for 8 and sequence of number satisfies the assumption of
different digit composed X.
Following this, we get a solution of 9874620
H
------------------------------
Topic No. 2
Date: Sun, 16 Mar 1997 23:25:20 -0800 (PST)
From: AnHai Doan <anhai@cs.washington.edu>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Re: [THO*] Nhu*~ng cuo^.c ddi/ Tho+ Haiku cu?a Nha^.t
Message-ID: <Pine.ULT.3.93.970316230331.10859B-100000@june.cs.washington.edu>
On Mon, 17 Mar 1997, Luong Ta wrote:
> Si~
> ===
> "Ve' so^' anh o*i"
> "Kho^ng to^i kho^ng mua"
> "Dda^y nga`n xa`i ddo*~"
> "To^i ba'n kho^ng xin.
> Ca?m o*n anh"
Hi, ca?m o+n anh Luong Ta dda~ dda(ng ma^'y ba`i tho+ ghi la.i ca?m xu'c
cu?a anh trong chuye^'n ddi VN vu+`a ro^`i. Ba`i tre^n la`m to^i nho+'
to+'i la^`n to^i xuo^'ng khu supermarket Lyon gi` ddo' cu?a ngu+o+`i VN
o+? San Jose, Cali. DDang a(n pho+? thi` co' mo^.t ca^.u be' ta^.t
nguye^`n bu+o+'c va`o dda(.t le^n mo^~i ba`n co' kha'ch a(n mo^.t ca'i
da^y ddeo chi`a kho'a. To^i kho^ng ca^`n da^y ddeo chi`a kho'a song to^i
bo? ra ba`n 1$ cho ca^.u be'. Khi ca^.u quay la.i tha^'y to^i kho^ng
la^'y da^y ddeo chia` kho'a thi` chi? ba?o ca?m o+n anh, ro^`i ca^`m da^y
ddi nhu+ng kho^ng la^'y tie^`n.
No'i chuye^.n kha'c. Tho+ anh ddo.c gio^'ng tho+ Haiku cu?a Nha^.t qu'a.
O+? dda^y co' ba'c na`o sa`nh tho+ Haiku la`m o+n post va` bi`nh va`i
ba`i hay cho anh em thu+o+?ng thu+'c. Xu+a to^i ra^'t thi'ch tho+ na`y,
nay que^n tie^.t ro^`i. Chi? co`n nho+' fuzzy-logic ddu+o+.c mo^.t ba`i,
dda.i loa.i nhu+ sau:
Cho+'m Xua^n
Khi ngoa'i la.i,
ta tha^'y,
Bo'ng ngu+o+`i a^'y
khua^'t trong su+o+ng mu`.
Nho+' dda.i dde^?, kho^ng chi'nh xa'c. Ba`i na`y ta? la.i ca?nh cu~ng
mo^.t buo^?i sa'ng cho+'m va`o xua^n nhu+ ba^y gio+`. Tro+`i se se la.nh,
vo+'i su+o+ng mu` phu? ki'n va.n va^.t. Cha`ng trai tie^~n co^ ga'i ddi
tre^n mo^.t con ddu+o+`ng mo`n xuye^n qua ca'nh ru+`ng. DDe^'n dda^`u
ru+`ng cha`ng du+`ng la.i chia tay co^ ga'i, ddi ma^'y bu+o+'c cho+.t
tha?ng tho^'t quay dda^`u la.i thi` chi? co`n tha^'y ta` a'o da`i cu?a
ngu+o+`i ye^u a^?n hie^.n trong su+o+ng.
Ba`i na`y ddu+o+.c ca'c ba'c ba'n tro+`i kho^ng va(n tu+. di.ch ba^.y ra
tho+ xuo^i nhu+ sau: :-)
Tie^~n ngu+o+`i sa'ng mai ddo'
O+? dda^`u ru+`ng ba.ch du+o+ng
Cho+.t ngoa'i la.i chi? tha^'y
Bo'ng ngu+o+`i mo+` trong su+o+ng.
Co`n co' ba`i gi` ve^` ca'i o^ da.o bo'ng vo+'i a'o to+i xu+a to^i cu~ng
thi'ch la('m ma` que^n ma^'t ro^`i.
Ke^? chuye^.n tho+ Haiku vo+'i mo^.t em Nha^.t em na`y cu+' tro`n ma('t ra
kho^ng hie^?u ta.i sao co' the^? di.ch tho+ Haiku ra tie^'ng n'c ngoa`i
ddu+o+.c. Theo em no' no'i thi` Haiku pha?i theo nhu+~ng lua^`n ddie^.u
ra^'t kinh ma` di.ch thi` ma^'t he^'t, va` se~ kho^ng co`n ca?m thu.
ddu+o+.c nhie^`u ca'i hay cu?a no' nu+~a.
Ha?i.
------------------------------
Topic No. 3
Date: Mon, 17 Mar 1997 16:25:39 +0700 (GMT+0700)
From: Pham Thi Thanh Hong <smm68490@ait.ac.th>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Re: Math problem: help
Message-ID: <Pine.OSF.3.94.970317161218.30555B-100000@alphaserv.ait.ac.th>
On Sun, 16 Mar 1997, Tuan V Nguyen wrote:
> Hello math folks,
>
> My son has a math problem, which I can not figure
> out yet, and I would be grateful for your help. The problem
> is:
>
> "Find the largest seven-digit number (say X), where X is
> divisible to every digit. Note that the seven digits are
> unique (no repetition.)"
>
>
> Thank you in advance for your help.
>
> Tuan
>
>
>
>
Hi Tuan, & Trung
Sorry for a wrong previous solution. This number is undivisable for 8. I
have tried another way to get solution as follows:
---------------
Solution
Because, it is the largest seven - digit number and those digits are
unique, so I can guest it is formed under a down trend as 9876543.
Firstly, we have to find a smalleast number that is divisable for every
digit. This must be 2520.
The maximum number that is divisable for 2520 under 9876543 is 9875880.
Because this number consists of triple 8, therefore, we must to find
another one which under this value.
By subtracting the amount of 2520 from the number of 9875880 till every
digit of X is different each other, we get the result of 9843120.
Thus, the expected number must be 9843120.
Test it again, OK.
H
------------------------------
Topic No. 4
Date: Mon, 17 Mar 1997 16:47:24 +0700
From: Le Minh Trung <trung@ait.ac.th>
To: vnsa-l@csd.uwm.edu
Subject: Re: Math problem: help
Message-ID: <332D132B.2B3B@ait.ac.th>
My son has a math problem, which I can not figure
out yet, and I would be grateful for your help. The problem
is:
"Find the largest seven-digit number (say X), where X is
divisible to every digit. Note that the seven digits are
unique (no repetition.)"
Thank you in advance for your help.
Tuan
Hi Tuan,
If the problem is: "Find the largest seven-digit number containing
different digits and is divisible to every digit (except 0, (:-))",
I confirm the second Hong'solution is correct, i.e. 9843120.
Prove: every seven-digit number bigger than 9843120 does not have the 2
properties above (:-))
Cheers,
--
Le Minh Trung
Asian Institute of Technology, STAR Program
P.O. Box 4 KlongLuang, Pathumthani 12120, Thailand
Internet: http://www.rsl.ait.ac.th/~trung/
Tel. (662) 524 5585 Fax. (662) 524 6147
------------------------------
Topic No. 5
Date: Mon, 17 Mar 1997 11:11:28 +0100 (MET)
From: Tran Minh Tien <tran@idefix.mpipks-dresden.mpg.de>
To: vnsa-l@csd.uwm.edu
Subject: Re: Fwd from Anh PHan Thanh Lam: MIS] Ta`u, Ta^m, Ta`i
Message-ID: <9703171011.AA19223@idefix.mpipks-dresden.mpg.de>
>
> Hi ba'c PTLa^m,
>
> Tui dda~ co' la^`n no'i vu. chie^'t tu+. chu+~ Ta^m ngoa`i ddi`nh la`ng
> ta. Ddu'ng nhu+ ba'c ta?: "Mo^.t va^`ng tra(ng khuye^'t ba sao giu+~a
> tro+`i", chu+~ Ta^m go^`m co' mo^.t da^'u phe^'t cong va` 3 da^'u pha^?y
> nga('n nhu+ da('u cha^'m, do ddo' co' nguo+`i cho ra(`ng mo^~i da^'u
> cha^'m a^'y tuo+.ng tru+ng cho mo^.t "ta`i", va`... "chu+~ Ta^m kia mo+'i
Cha` ca'c ba'c la`m to^i ddang buo^`n ngu? ti?nh ca? ngu+o+`i\.
Cu+' nhu+ to^i bie^'t thi` chu+~ "ta^m" ddu+o+.c che^' theo
"tu+o+.ng hi`nh", nghi~a la` qua? tim ra sao thi` ve~ nhu+ va^.y\.
Hoa`ng DDe^', Phu.c Hy ... pha?i la.y ca'c ba'c la`m tha^`y ma^'t\.
"Ba sao" la` sao Ta^m, mo^.t trong Nhi. tha^.p ba't tu'\. Nghe no'i
cu. Hoa`ng Xua^n Ha~n co`n ti'nh ddu+o+.c nga`y na`o la` nga`y
"Mo^.t va^`ng tra(ng khuye^'t ba sao giu+~a tro+`i".
Cheers, Tie^'n.
------------------------------
Topic No. 6
Date: Mon, 17 Mar 1997 19:21:25 JST
From: Dung Trong Nguyen <nguyen@jaist.ac.jp>
To: vnsa-l@csd.uwm.edu
Subject: The NUMBER is 1687392
Message-ID: <199703171021.TAA26197@mikan.jaist.ac.jp>
Pham Thi Thanh Hong <smm68490@ait.ac.th> wrote:
> Hi Tuan, & Trung
>
> Sorry for a wrong previous solution. This number is undivisable for 8. I
> have tried another way to get solution as follows:
>
> ---------------
> Solution
>
> Because, it is the largest seven - digit number and those digits are
> unique, so I can guest it is formed under a down trend as 9876543.
>
> Firstly, we have to find a smalleast number that is divisable for every
> digit. This must be 2520.
>
> The maximum number that is divisable for 2520 under 9876543 is 9875880.
> Because this number consists of triple 8, therefore, we must to find
> another one which under this value.
>
> By subtracting the amount of 2520 from the number of 9875880 till every
> digit of X is different each other, we get the result of 9843120.
>
> Thus, the expected number must be 9843120.
>
> Test it again, OK.
Hi Hong,
I think your number is not divisible to 0. No number can be.
This is mine (with a little help from my computer :))
1) There no 0, so 9 digits remain.
2) The least sinificant digit can't be odd number. If it is, the
number can not be divisible to 2, 4, 6 and 8 and we don't have enough
number. Because there no 0 and the least significant digit is event,
there no 5 in our number.
3) 8 number 1,2,3,4,6,7,8 and 9 remain.
4) If there no 9 in the number, 1+2+3+4+6+7+8 = 31, the number can not
be divisible to 3.
5) If number include 9. Because 1+2+3+4+6+7+8+9 = 40, there is only
one way to make the 7-digit number be divisible to 9 is excepting 4
from the set of digits.
8) So 7 digits 1,2,3,6,7,8,9 remain to used.
9) 1*2*3*6*7*8*9 = 18144
10) We must check out 496 numbers those have the form (n * 18144) in
the range (>=1016064 and <= 9997344) to get the valid and biggest
number. That number is 1687392, if the following program is bug-free
:)
d~
--cut here--------------------------------------------------------
#include <stdio.h>
#define MUL (2 * 3 * 6 * 7 * 8 * 9)
#define MAX ((10000000 / MUL) * MUL)
#define MIN ((1000000 / MUL + 1) * MUL)
int a[7];
ten_power(int n)
{
int i;
int t;
t = 1;
for (i = 0; i < n; i++)
t = t * 10;
return t;
}
digit(int n, int p)
{
n = n / ten_power(p);
return n % 10;
}
distinctive(int n)
{
int i;
for (i = 0; i < 7; i++)
a[i] = 0;
for (i = 0; i < 7; i++) {
int d;
int j;
d = digit(n, i);
if (d >= 1 && d <= 3) {
j = d - 1;
a[j]++;
} else if (d >= 6) {
j = d - 3;
a[j]++;
} else
return 0;
if (a[j] > 1)
return 0;
}
return 1;
}
main()
{
int n;
n = MAX;
while (n >= MIN) {
if (distinctive(n)) {
printf("%d\n", n);
exit(0);
}
n -= MUL;
}
printf("no solution\n");
exit(0);
}
--cut here----------------------------------------------------------
------------------------------
Topic No. 7
Date: Mon, 17 Mar 1997 19:23:51 JST
From: Dung Trong Nguyen <nguyen@jaist.ac.jp>
To: vnsa-l@csd.uwm.edu
Subject: Re: Math problem: help
Message-ID: <199703171023.TAA26343@mikan.jaist.ac.jp>
To+' vie^'t cho Va^n sau.
> > ba?o tro.ng,
> ===> dday la biet hieu moi a-?
ba?o tro.ng: take care
------------------------------
Topic No. 8
Date: Mon, 17 Mar 1997 13:11:48 +0100 (MET)
From: Tuan Bui <tbui@sgh.waw.pl>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Help me :)))
Message-ID: <Pine.GSO.3.95.970317130913.25721A-100000@akson>
Hi ma^'y anh admins ...!!!
Please help .. Co'ba/c nao`` del du`m em adress cu?a em trong
vnsa-l@csd..umd.edu du*o*.c kho^ng ,, trong na`y nhie^`u ba'c
vie6't hay la('m nhu*ng em la.i kho^ng co' tho*`i gian de^? coi
..
ne^n ba'c na`o la`m o*n del du`m em trong cai' system na`y ..
Kho^ng hieu^? sao em la.i na(m trong da^y :))
C'am o*n ca'c ba'c tru*o*'c :))
------------------------------
Topic No. 9
Date: Mon, 17 Mar 1997 13:13:41 GMT
From: huy.duong@ctsu.ox.ac.uk
To: vnsa-l@csd.uwm.edu
Subject: Cause and effect
Message-ID: <97031713134160@a2.ctsu.ox.ac.uk>
Dear anh Ai Viet and anh Tuan,
> I think Cause and Effect is the Raison D'E^tre of Statistics even it is
>not a problem of Statistics as Anh Huy said. The most beautiful thing of
>Statistics is that it changes the way we think of Causality.
I thought the raison d'etre of statistics was to deal with varivations
that seem random to us. Statistics quantifies what we don't know from our
measurements because of random variations.
Even if we knew what was cause and what was effect, or if we were not
interested in determine which was which, we would still need statistics, eg
measuring the mass of the electron. On the other hand, in the study of cause
and effect, eg what causes the planets to orbit the sun and what causes the
apple to fall, statistics does not play a fundamental role. So can you explain
your statements?
>The
>inter-dependence among organs in our body is so complicated
>that it is thought impossible to make any inference on
>causation. What we can say at most is association.
This is too strong. Surely you can say that breathing a high concentration
of CO a long time causes death rather that is only associated with it?
Huy
------------------------------
Topic No. 10
Date: Mon, 17 Mar 1997 15:53:34 -0800
From: Thanh Tung Truong <tung.truong@e-technik.tu-chemnitz.de>
To: vnsa-l@csd.uwm.edu
Subject: HELP!!!: X.25
Message-ID: <332DD97E.318C@e-technik.tu-chemnitz.de>
Hi all,
Can any one on the list point me to some good books/articles/on-line
resources on X.25 techniques and networks at beginner's level?
Also, I need information about X.25 in Vietnam.
Every hint / pointer is greately appreciated.
Cheers,
Thanh-Tung Truong
------------------------------
Topic No. 11
Date: Mon, 17 Mar 1997 07:12:18 -0800 (PST)
From: AnHai Doan <anhai@cs.washington.edu>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Re: Help me :)))
Message-ID: <Pine.ULT.3.93.970317070756.1431E-100000@june.cs.washington.edu>
On Mon, 17 Mar 1997, Tuan Bui wrote:
> ne^n ba'c na`o la`m o*n del du`m em trong cai' system na`y ..
> Kho^ng hieu^? sao em la.i na(m trong da^y :))
Hi ca'c ba'c o+? tru+o+`ng na`y ta.i Ba Lan,
Cha('c ba'c na`o co' du.ng y' to^'t ddi dda(ng ky' mo^.t loa.t da^n ti`nh
va`o VNSA. Nhu+ng ca'c ba'c la`m ma` kho^ng ho?i y' kie^'n account owner
thi` ha.i bo.n to^i qu'a. Ca?m o+n ca'c ba'c , nhu+ng mong ca'c ba'c
ddu+`ng la`m nhu+ va^.y nu+~a ma` admins mang tie^'ng. Ma` kho^ng hie^?u
sao ca'c ba'c o+? ddo' cho nhau du`ng account lung tung va^.y?
Ha?i.
------------------------------
Topic No. 12
Date: Mon, 17 Mar 1997 22:15:17 +0700 (GMT+0700)
From: Pham Thi Thanh Hong <smm68490@ait.ac.th>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Re: The NUMBER is 1687392
Message-ID: <Pine.OSF.3.94.970317220608.32475A-100000@alphaserv.ait.ac.th>
On Mon, 17 Mar 1997, Dung Trong Nguyen wrote:
>
> Hi Hong,
>
> I think your number is not divisible to 0. No number can be.
>
> This is mine (with a little help from my computer :))
>
> 1) There no 0, so 9 digits remain.
>
> 2) The least sinificant digit can't be odd number. If it is, the
> number can not be divisible to 2, 4, 6 and 8 and we don't have enough
> number. Because there no 0 and the least significant digit is event,
> there no 5 in our number.
>
> 3) 8 number 1,2,3,4,6,7,8 and 9 remain.
>
> 4) If there no 9 in the number, 1+2+3+4+6+7+8 = 31, the number can not
> be divisible to 3.
>
> 5) If number include 9. Because 1+2+3+4+6+7+8+9 = 40, there is only
> one way to make the 7-digit number be divisible to 9 is excepting 4
> from the set of digits.
>
> 8) So 7 digits 1,2,3,6,7,8,9 remain to used.
>
> 9) 1*2*3*6*7*8*9 = 18144
>
> 10) We must check out 496 numbers those have the form (n * 18144) in
> the range (>=1016064 and <= 9997344) to get the valid and biggest
> number. That number is 1687392, if the following program is bug-free
> :)
>
> d~
>
> --cut here--------------------------------------------------------
>
Hi Du~ng,
Based on your assumptions that no 5 and no 0 digits included in X, I found
another number that is bigger than yours. It also satisfies the
conditions of problems. That is 9867312. This number is divisable for
every digits included such as 9,8,7,6,3,2, and 1.
I don't know what is the right X number for this problem because the
unclear assumption of every digits (whether these digits composed X or
every possible digits?)
Ho^`ng.
------------------------------
Topic No. 13
Date: Mon, 17 Mar 1997 15:51:33 GMT
From: huy.duong@ctsu.ox.ac.uk
To: vnsa-l@csd.uwm.edu
Subject: Confucianism's best product
Message-ID: <97031715513321@a2.ctsu.ox.ac.uk>
Dear anh Ai Viet,
You mean the could have been a best product of Confucianism?
Huy
<<< Who knows. If Kho^?ng tu+? had been stiff enough, Nam tu+? should have
contributed something better than "Tam to`ng Tu+' Ddu+'c".
Cheers
Aiviet>>>
------------------------------
Topic No. 14
Date: Tue, 18 Mar 1997 01:28:14 JST
From: Dung Trong Nguyen <nguyen@jaist.ac.jp>
To: vnsa-l@csd.uwm.edu
Subject: YES IT'S 9867312
Message-ID: <199703171628.BAA16129@mikan.jaist.ac.jp>
> Based on your assumptions that no 5 and no 0 digits included in X, I found
> another number that is bigger than yours. It also satisfies the
> conditions of problems. That is 9867312. This number is divisable for
> every digits included such as 9,8,7,6,3,2, and 1.
YESSSSS. I've just returned to fix it, but it a little late :((( Thank
you ;-)
> 9) 1*2*3*6*7*8*9 = 18144
I'm terrible wrong here. We don't need 2 and 6 in the multiplication.
9) let it be 3 * 7 * 8 * 9 = 1512
10) We must check up down the numbers those have the form (n * 1512)
in the range (>10000000 and < 100000) until get the first valid
number. That number is 9867312 as you showed, please change my
program below.
> I don't know what is the right X number for this problem because the
> unclear assumption of every digits (whether these digits composed X or
> every possible digits?)
I don't understand well what you meant. I think the problem is clear
enough, and we have the right answer now, and Mr. Toan will be happy :))
Thank you again. Do you agree to share credit to solve this problem
with me? :)
Cheers,
d~
----------------------------cut here-----------------------------------
#include <stdio.h>
#define MUL (3 * 7 * 8 * 9) /* change is here */
#define MAX ((10000000 / MUL) * MUL)
#define MIN ((1000000 / MUL + 1) * MUL)
int a[7];
ten_power(int n)
{
int i;
int t;
t = 1;
for (i = 0; i < n; i++)
t = t * 10;
return t;
}
digit(int n, int p)
{
n = n / ten_power(p);
return n % 10;
}
distinctive(int n)
{
int i;
for (i = 0; i < 7; i++)
a[i] = 0;
for (i = 0; i < 7; i++) {
int d;
int j;
d = digit(n, i);
if (d >= 1 && d <= 3) {
j = d - 1;
a[j]++;
} else if (d >= 6) {
j = d - 3;
a[j]++;
} else
return 0;
if (a[j] > 1)
return 0;
}
return 1;
}
main()
{
int n;
n = MAX;
while (n >= MIN) {
if (distinctive(n)) {
printf("%d\n", n);
exit(0);
}
n -= MUL;
}
printf("no solution\n");
exit(0);
}
-------------------------------cut here-------------------------------
------------------------------
Topic No. 15
Date: Mon, 17 Mar 1997 19:28:54 +0100 (MET)
From: Sonnet Nguyen <Sonnet.Nguyen@fuw.edu.pl>
To: VNSA-l <vnsa-l@csd.uwm.edu>
Subject: Small Talks about UNIFICATIONS
Message-ID: <Pine.SUN.3.95.970317175311.5289A-100000@albert5>
Hi all,
Usually unification's theory is understood as a theory in Physics which
is able to describing all interactions in nature. ( As I we know today
in our universe are four fundamental kinds of interactions: strong, weak,
electromagnetic and gravitational. Many things have been done in this
direction and we almost have the strong-electro-weak theory. )
In fact, unification and decomposition are two tendentions which are
observed everywhere. The collapse of former Soviet Union (and maybe
Chine) and of many many imperiums in world's history. The unification of
european countries to unitied state of Europe, world's trading treaty,
etc...
Let me turn back to Science and unification's tendention in Science.
For example in mathematics, the fist step to unification was done by
Decard in 17-th century. Decard unified "geometry" and "algebra" and
created sth called by "analitical geometry". Riemann did a great deal to
unify "analysis" and "geometry". Indeed, Riemann also did many things
to unify "analysis" and "number theory". Remind here, for example:
Hadamard's Prime Number Theorem and still unsolved Riemann Hipothesis.
(i.e. about zeros of Zeta function. The solution of Riemann hipothesis
implies very very precise information about the distribution of prime
numbers.)
Prof. Hoang Phuong just want to unify VN-se medicine with mathematics.
S. Hawking want to unify EVERYTHING (remind that everything is a bad
conception!) and Mr. SN want to decompose EVERYTHING.
And what about Party?
Hmm, Let me think ....
enjoys,
SN
------------------------------
Topic No. 16
Date: 17 Mar 1997 13:50 EST
From: "Thai Nguyen" <tinguyen@nortel.ca>
To: vnsa-l@csd.uwm.edu
Subject: [HELP] uudecode an email from VN
Message-ID: <199703171919.NAA11593@batch1.csd.uwm.edu>
Hello,
I'd need a bit of help here. I received an email from VN which had been
uuencoded (that's what my email system told me) and I did a uudecode on it but
I've had a few problems. The uuencoded file starts with "begin 600 TMP8.$$$" so
the file uudecoded is TMP8.$$$. That's what I got but when I tried to read it
with vi TMP8.$$$, I had "TMP8.7522$ [New file]" and with cat TMP8.$$$, I got
" cat: cannot open TMP8.7522$: No such file". What's going on here? I've never
used uuencode and decode before so I might have missed something. I think the
guy in Ha Noi must have sent me the email with uucp. Thanx!!
------------------------------
Topic No. 17
Date: Mon, 17 Mar 1997 11:28:13 -0800 (PST)
From: AnHai Doan <anhai@cs.washington.edu>
To: vnsa-l@csd.uwm.edu
Subject: [FROM ADMIN] INTRODUCING A NEW VNSA ADMIN / MISC
Message-ID: <Pine.ULT.3.93.970317112155.7654J-100000@june.cs.washington.edu>
Subject: INTRODUCING A NEW VNSA ADMIN
Dear friends,
Within three months since its birth, VNSA has grown into one of the major
Internet forums serving the Vietnamese community abroad. This rapid growth
is welcomed by all of us, but at the same time makes the administrative
tasks handled by the three VNSA admins become ever more difficult and
time-comsuming.
It is obvious that in order to maintain and improve on the forum quality,
we need to expand the admin board. Towards this end, we the admins have
been searching around for new admins, and we are now happy to announce
that we have found the ideal forth admin in the person of Anh Vu~
Ho^`ng La^m (vuh000@goofy.zdv.Uni-Mainz.de), an active member of VNSA.
Anh La^m was a DHS in Hungary during the period 1986-1990s. He is
handsome, athletic, and still single. [Hai: He exerted his newfound admin
power to force me to put the above sentence in.] He is now studying
towards a M.A. degree in political science in Germany. He plans to go on
to obtain a Ph.D. degree, and later to work on Vietnam-related topics. Anh
La^m has been with VNSA since its start, and has been a very active
contributor of VNSA, both publicly and privately. Without him, VNSA could
not have been as strong as it is today.
Anh La^m shared our vision about VNSA as a friendly, open,
information-rich, intellectually challenging, and entertaining gathering
place for Vietnamese DHS/NCS. He also shares with us new, original ideas
that we believe will make VNSA become an even more exciting, entertaining,
and informative forum. We thus are very happy and grateful that he has
agreed to join our admin board, and to shoulder a part of our burdensome
admin work.
So, effective immediately, Anh La^m will be one of the four admins of
VNSA, with all the admin power and responsibilities. His e-mail address is
vuh000@goofy.zdv.Uni-Mainz.de, in case you want to send him comments,
support e-mails, requests, etc. Admin power is little, and his/her
responsibilities toward the forum and its members is enourmous. So please
welcome Anh La^m and support him, as well as us, in our joint effort to
build, maintain, and improve our common house: VNSA.
Thank you for your time and support.
VNSA Admins.
---------------------------------------------------------------------
Subject: FUTURE ADMIN MESSAGES MIGHT BE IN EITHER ENGLISH OR VIETNAMESE
Dear friends,
Taking into consideration the fact that some VNSA members might not
be fluent in English, and that some subtle points can be better conveyed
in Vietnamese than in English, we have revised VNSA policy to allow
writing admin message in Vietnamese. Of course, important admin messages
will be written such that all VNSA members can read and understand.
If you have trouble understanding an admin message, please send us
private e-mail for a clarification.
Thank you for your understanding and cooperation,
VNSA Admins.
--------------------------------------------------------------------------
------------------------------
Topic No. 18
Date: Mon, 17 Mar 1997 14:03:10 -0600
From: ianb@sun670.telecom.tandem.com (Ian Bui)
To: vnsa-l@csd.uwm.edu
Subject: Tim` ba` con
Message-ID: <9703172003.AA14860@kirk.tpmsdev>
To^i co' tha<`ng em ho. te^n Dda<.ng Minh Tri',
nga`y xu*a tu*`ng du ho.c be^n Nga. Nghe dda^u
no' co' o*? Minsk mo^.t tho*i` gian, cu~ng lam`
a<n buo^n ban' du*~ la<'m. Kho^ng bie^'t ma^y'
bac' co' ai bie^'t no' kho^ng. Cuo^'i na<m ngoai'
nghe noi' no' ddi.nh xin qua U'c ho.c MBA, kho^ng
bie^'t co' ddi ddu*o*.c hay chu*a#. Bac' nao` co'
bie^'t tin tu*'c gi` xin cho hay du`m.
To^i cu~ng co' mo^.t tha<`ng em ho. nu*~a te^n
Huy`nh Hu*~u Khang, ddu*o*.c ho.c bo^?ng o*?
tru*o*`ng gi` ddo' be^n U'c (kho^ng nho*' te^n)
ho.c nga`nh Economics/Computer Science. Ai bie^'t
to^ng ti'ch no' hie^.n o*? dda^u xin cho bie^'t
luo^n the^?.
Many thanks in advance,
Ian
------------------------------
Topic No. 19
Date: Mon, 17 Mar 1997 22:43:54 +0100 (MET)
From: Hong Lam Vu <vuh000@goofy.zdv.Uni-Mainz.de>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Re: [cult] Village
Message-ID: <Pine.OSF.3.95.970317220717.8858J-100000@berlioz.zdv.Uni-Mainz.DE>
Hi ba'c Ian, Aiviet and all the village,
Ba'c ho.c nga`nh gi` va^.y, k0 khe'o mi`nh la` ddo^`ng nghie^.p ga^`n
cu~ng ne^n. Tui cu~ng da^n social scientist dda^y.
>
> - VMLX cua? ta co' tru*o*'c hay sau tho*i` ky` Ha'n thuo^.c#?
Truo+'c. VMLX dduo+.c coi la` 1 dda(.c thu` cu?a pre-Chinese, pre-
Indian South East Asian civilization.
Tui co' hypothesis sau: trong khi kha'i nie^.m va(n minh (civilization)
o+? c'c no+i kha'c tre^n the^' gio+'i ga('n vo+'i tha`nh thi., thi` o+?
DNA no' ga('n vo+'i xo'm la`ng. Cho dde^'n nay hi`nh nhu+ kha?o co^?
ho.c va^~n chu+a ti`m duo+.c da^'u ti'ch tha`nh thi. co^? cu?a va(n minh
Ddo^ng So+n, tu+'c va(n minh DNA truo+'c Ha'n va` truo+'c A^'n. Va^.y thi`
ne^n cha(ng ddu+`ng hoa`i co^ng ddi ti`m 1 Jericho o+? VN ma` ne^n coi nh~
la`ng lo+'n do'ng vai tro` cu?a nh~ tha`nh thi. trong VM DNA. Cu~ng chi'nh
vi` da(.c ddie^?m na`y ma` 1 loa.t ca'i nhi`n ve^` civilisation quen du`ng
cho truo+`ng ho+.p Trung Ddo^ng, TQ, etc ne^n dduo+.c xe't la.i cho phu`
ho+.p vo+'i DNA. Dda(.t va^'n dde^` nhu+ the^' se~ gia?i thi'ch dduo+.c 1
loa.t hie^.n tuo+.ng cu?a xh DNA. Toa`n bo^. ca^'u tru'c xh DNA da(.t
tre^n 1 co+ ta^`ng (substrat) ma` mo^ hi`nh ca(n ba?n cu?a no' la` mo^
hi`nh xo'm la`ng. Nuo+'c cu~ng nhu+ 1 sie^u la`ng. Ba?n tha^n VNSA ta
cu~ng nhu+ 1 ca'i la`ng.
> - VMLX co' nhu*ng~ u*u khuye^t' ddie^m? nao`#?
Ba'c k0 ddu+a ra he^. quy chie^'u. U+u , khuye^'t ddie^?m pha?i dduo+.c
chie^'u va`o 1 he^. chua^?n nha^'t di.nh, dduo+.c gio+'i ha.n bo+?i tho+`i
va` kho^ng gian.
Vi' du. che^' ddo^. dda the^ co' the^? co' u+u ddie^?m trong 1 xh ma`
dda`n o^ng bi. che^'t ra^'t nhie^`u do dda'nh gia(.c, kie^'m so^'ng, etc,
nhu+ng la.i la` co' khuye^'t ddie^?m trong tho+`i dda.i ky~ nghe^. nhu+
hie^.n nay.
> - VMLX co`n kho^ng, hay dda~ hoa<.c ddang bie^'n da.ng#?
>
Co`n. No' va^~n ddo'ng vai tro` co+ ta^`ng cho toa`n bo^. ne^`n VH VN
hie^.n dda.i, tre^n do' phu? 1 lo+'p va(n minh Ha'n ho'a da`y co^.p ma`
mo?ng be^n tre^n la` va(n minh Ta^y phuo+ng.
Tui k0 thi'ch vu+'t bo? ha(?n VMLX dde^? thay ba(`ng ca'c ye^'u to^'
thua^`n Ta^y phuo+ng (i.e. hie^.n dda.i), ma` co' le~ cu~ng k0 la`m
dduo+.c (da^n DNA ngoan co^' la('m, ma^'y anh Muslims be^n Malaysia,
Indonesia kha'c ha(?n ma^'y anh Arabs, anh Nho VN cu~ng kha'c ha(?n
anh Nho Ta`u, Nha^.t, Ha`n).
Tuy nhie^n dda(.t va^'n dde^` whether modernisation = Westernization la` 1
ca'ch dda(.t va^'n dde^` misleading. Theo fuzzy logic, co' ho+i ta^y
phuo+ng ho'a, kha' TPH, ra^'t TPH, cu+.c ky` TPH, etc.. Va^'n dde^` co'
le~ la` TPH ca'i gi`, va` dde^'n dda^u, chu+' k0 pha?i la` to westernize
or not to westernize. BTW ca'ch dda(.t va^'n dde^` kie^?u Hamlet la` 1
da(.c sa('c Ta^y phuo+ng ma` gio+'i elite Ddo^ng phuo+ng bi. tie^m nhie^~m
ma` k0 bie^'t. Dde^` nghi. Dr Mahathir Mohammad va` Mr Lee Kuan Yew ha~y
tro+? ve^` "A' Ddo^ng ti'nh" ngay o+? ca'ch dda(.t va^'n dde^`.
Cheers,
Hong Lam
------------------------------
Topic No. 20
Date: Mon, 17 Mar 1997 23:14:45 +0100 (MET)
From: Hong Lam Vu <vuh000@goofy.zdv.Uni-Mainz.de>
To: Multiple recipients of list <vnsa-l@csd.uwm.edu>
Subject: Re: Ti'nh ca'ch ngu+o+`i Vie^.t (half academic style)
Message-ID: <Pine.OSF.3.95.970317224608.8858K-100000@berlioz.zdv.Uni-Mainz.DE>
Hi ba'c Hoa`ng et al,
>
> Objectives:
>
> - Ti`m ra mo^.t so^' ti'nh ca'ch co+ ba?n cu?a ngu+o+`i Vie^.t cu. the^? la`
> nhu+~ng -die^?m ma.nh, -die^?m ye^'u
>
> - Xa^y du+.ng mo^ hi`nh -de^? hie^?u ve^` nhu+~ng ti'nh ca'ch na`y tu+` -do'
> du+. -doa'n ve^` xu hu+o+'ng pha't trie^?n cu~ng nhu+ go'p pha^`n pha't huy
> -die^?m ma.nh, ha.n che^' -die^?m ye^'u.
>
Ma.nh, ye^'u la` nh~ kha'i nie^.m tuo+ng do^'i. 1 dda(.c ti'nh la` ma.nh
hay ye^'u phu. thuo^.c va`o ti`nh huo^'ng cu. the^?, va` va`o mu.c tie^u
cu. the^? Tui hie^?u y' ba'c no'i ma.nh ye^'u la` da'p u+'ng dde^'n dda^u
nhu ca^`u so^'ng co`n va` nga^?ng dda^`u cu?a da^n to^.c ta trong tho+`i
da.i nga`y nay. More below...
> Ultimate goal:
>
> Giu'p xa~ ho^.i Vie^.t Nam -du+o+.c pha't trie^?n, ngu+o+`i da^n Vie^t Nam
> -du+o+.c ha.nh phu'c.
>
Pha't trie^?n va` Ha.nh phu'c dde^`u la` nh~ kha'i nie^.m fuzzy. Ta chi?
na('m dduo+.c chu'ng ma` k0 dde^? bi. tuo^.t kho?i tay ne^'u ta ddi,nh
dduo+.c dda.i loa.i the^' na`o la` "pha't trie^?n" trong tho+`i da.i na`y,
va` dda so^' ng` Vie^.t ca?m tha^'y cu`ng quan nie^.m the^' na`o la`
"ha.nh phu'c".
Tuy nhie^n tui k0 ddo^`ng y' ca'ch dda(.t va^'n dde^` teleological the^'
ni. Ne^n dda(.t va^'n dde^` 1 ca'ch trung ti'nh ho+n, ra(`ng:
- Gia? su+? co' 1 set of characters significant more or less at Viets.
What are they?
- Ultimate goal la` chuye^.m na(`m ngoa`i khoa ho.c, k0 ca^`n ba`n dde^'n
o+? dda^y.
> Framework:
>
> - Bu+o+'c 1: Xa'c -di.nh ca'c ti'nh ca'ch kha? di~ -da so^' ngu+o+`i Vie^.t
> Nam co' nhu+ la` mo^.t pha^`n cu?a va(n ho'a -du+o+.c no^.i ta^m ho'a tha`nh
> ca'c tho'i quen (habits) -da(.c bie^.t la` tho'i quen ve^` suy nghi~ (thinking
> habits), ca'c gia' tri. ca' nha^n (personal values).
>
> - Bu+o+'c 2: Thu+? xa'c -di.nh ca'c determinants na`o trong va(n ho'a Vie^.t
> khie^'n hi`nh tha`nh ne^n ca'c habits va` ca'c values -do'.
>
> - Bu+o+'c 3: Thu+? gia? thuye^'t ve^` ca'c ye^'u to^' thuo^.c natural and
> social environments na`o hi`nh tha`nh ne^n ca'c determinants -do'.
Ta.m ddo^`ng y' vo+'i ba'c.
>
> Mo^.t so^' hypothesis (tu+` review literature va` suy nghi~ ca' nha^n)
>
> Cho bu+o+'c 1 va` 2:
>
> - Nhu+ mo^.t so^' da^n to^.c Cha^u A' da^n Vie^.t chi.u a?nh hu+o+?ng ma.nh
> bo+~i ta^.p the^?, superego ma.nh tu+` ca'c chua^?n mu+.c xa~ ho^.i co' ti'nh
> truye^`n tho^'ng (truye^`n tho^'ng nha^n nghi~a, truye^`n tho^'ng -doa`n ke^'t
> cho^'ng ngoa.i xa^m), ego ga^`n nhu+ la` group ego (tu+'c ca'i to^i bi. chi
> pho^'i ma.nh bo+~i y' kie^'n nhu+~ng ngu+o+`i xung quanh).
>
Pha^n bie^.t ego va` superego la` theo Freud.
Co`n theo Mead, thi` co' the Me and the Self.
Va^.y ta theo mo^ hi`nh na`o, hay eclectistic, etc..?
> - Trong ca'i khung -du+o+.c qui -di.nh cha(.t bo+~i social norms nhu+ va^.y
> da^n Vie^.t la.i ra^'t tu+. do. Nhie^`u quan sa't tha^'y gia'o du.c gia -di`nh
> o+? Vie^.t Nam theo chie^`u hu+o+'ng -di.nh guidelines cho con ca'i va` vu+`a
> buo^.c vu+`a -de^? con ca'i tu`y y' -di.nh ca'ch u+'ng xu+? sao cho.n ho+.p
> vo+'i hoa`n ca?nh, vo+'i chua^?n mu+.c xa~ ho^.i nha^'t ma` kho^ng buo^.c pha?i la`m
> theo mo^.t co^ng thu+'c cu+'ng nha('c na`o (qua gia'o du.c ca'ch
> u+'ng xu+? va` gia'o du.c ve^` ngo^n ngu+~ ma` tui go.i la` su+. tinh te^'). Ngu+o+`i
> Vie^.t -du+o+.c nha^.n xe't la` co' ti'nh na(ng -do^.ng cao nhu+ng trong mo^.t khung
> cha^.t. No'i theo psychoanalytic la` id pha't trie^?n ma.nh nhu+ng -do^`ng
> tho+`i superego cu~ng ma.nh. Conflict giu+~a id va` superego trong ta^m
> ly' ngu+o+`i Vie^.t -du+o+.c coi la` na(.ng. Trong hoa`n ca?nh co`n lie^n he^. vo+'i
> co^.ng -do^`ng thi` no' -du+o+.c ke^`m giu+~ mo^.t ca'ch hie^.u qua?. Id se~ chie^'m
> quye^`n chi pho^'i ha`nh vi khi hoa`n ca?nh cho phe'p vi` individual ego
> kho^ng -du? ma.nh. Tu+` -do' nhi`n tu+` ngoa`i va`o da^n Vie^.t the^? hie^.n nhie^`u
> -die^`u ra^'t ma^u thua^?n vi' nhu+ ra^'t nhu ho`a nhu+ng cu~ng co' nhu+~ng lu'c ra^'t
> ta`n nha^~n.
Very intersting!
Hong Lam
PS: Ddoa.n sau tui co`n cho+` ca? nha` chi? tri'ch da~.
>
> - Tu+` -da^u co' nhu+~ng -die^`u -da~ ne^u tre^n (bu+o+'c 3) tui co`n pha?i
> suy nghi~ va` -do.c the^m ra^'t nhie^`u cu~ng nhu+ nha^.n ca'c y' kie^'n
> -do'ng go'p tu+` ca'c ba'c. Hai -die^`u tui nghi~ la` quan tro.ng:
>
> (tri'ch la.i posting cu~)
>
> - Da^n Vie^.t (Kinh, Yu`n) thuo+? xa xu+a pha't trie^?n o+? -do^`ng ba(`ng
> la`m no^ng nghie^.p lu'a nu+o+'c ma` la`m no^ng nghie^.p ai co' tinh te^'
> mo+'i to^`n ta.i -du+o+.c, rie^'t ro^`i cho.n lo.c ra ti'nh ca'ch. Tui nghi~
> ca'i chuye^.n kho^ng chi.u -du+o+.c su+. a'p -da(.t cu?a ngu+o+`i kha'c -da~
> co' tu+` tho+`i ra^'t xa xu+a ro^`i. Cu~ng na(`m trong xu hu+o+'ng chung cu?a
> ca'c da^n to^.c trong vu`ng, su+. tinh te^' khie^'n con ngu+o+`i ca?m nha^.n
> ve^` the^' gio+'i, ve^` con ngu+o+`i ga^`n nhu+ la` mo^.t da~i lie^n tu.c ho+n
> la` ro+`i ra.c, tu+ duy subjective ho+n objective, tha^'y ca'i gi` lu.c cu.c
> lo`n ho`n la` chi.u ho^?ng -du+o+.c.
>
> - Kho^ng may cho da^n Vie^.t Nam so^'ng o+? mo^.t vi. tri' -di.a ly' cu+?a
> ngo~ giu+~a Ba('c vo+'i Nam cu?a Cha^u A' mo^.t pha^`n theo -du+o+`ng bo^. va`
> quan tro.ng ho+n theo -du+o+`ng bie^?n ne^n cu+' bi. he^'t da^n na`y muo^'n
> chie^'m -de^'n da^n kha'c muo^'n chie^'m (va` chie^'m). Tu+` ca'i ti'nh ca'ch
> 1 tre^n bo+~i kho^ng chi.u -du+o+.c ngu+o+`i kha'c ne^n co^' ga('ng cho^'ng
> la.i, suy nghi~ sa'ng ta.o ra nhie^`u ca'ch cho^'ng la.i va` cho^'ng -du+o+.c.
> (Mo^.t ta`i lie^.u pha^n ti'ch ti'ch ca'ch ngu+o+`i Vie^.t cu?a nu+o+'c ngoa`i
> no'i ca'i chie^'n tranh du ki'ch chi'nh la` do Tra^`n Hu+ng -Da.o sa'ng ta.o
> kho^ng pha?i o^ng Mao Tra.ch -Do^ng). Su+. tinh te^' trong -die^`u kie^.n
> chie^'n tranh cho^'ng la.i ke? -di.ch ma.nh ho+n da^~n -de^'n su+. -doa`n
> ke^'t va` truye^`n tho^'ng -doa`n ke^'t. Chie^'n tranh vo+'i ke? -di.ch ma.nh
> ho+n cu~ng la`m ta(ng da^`n su+. tinh te^'.
>
> (He^'t -doa.n tri'ch)
>
>
> Hie^.n ta.i no'i chung ca'c y' cu?a tui co`n ro+`i ra.c ma(.c du` intuition
> cho tha^'y du+o+`ng nhu+ co' mo^.t -die^?m chung na`o -do' giu+~a ta^'t ca?
> nhu+~ng -die^`u -da~ -de^` ca^.p. "Ngu+o+`i trong qua'ng, ngu+o+`i ngoa`i
> sa'ng" xin ta^'t ca? ca'c ba'c go'p the^m y' kie^'n. Ra^'t mong, ra^'t mong !
>
> Tru+o+ng Tro.ng Hoa`ng
>
>
>
>
>
>
------------------------------
End of VNSA-L Digest 277
************************