|
Search: id:A058992
|
|
|
| A058992 |
|
Gossip Problem: there are n people and each of them knows some item of gossip not known to the others. They communicate by telephone and whenever one person calls another, they tell each other all that they know at that time. How many calls are required before each gossip knows everything? |
|
+0
1
|
|
| 0, 1, 3, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
B. Baker and R. Shostak; Gossips and Telephones, Discrete Mathematics 2 (1972) 191-193. Math. Rev. 46 # 68.
R. T. Bumby; A problem with telephones, SIAM J. Alg. Disc. Meth. 2 (1981) 13-18. Math. Rev. 82f:05083.
A. Hajnal, E. C. Milner and E. Szemeredi, A cure for the telephone disease. Canad. Math. Bull. 15 (1972), 447-450. Math. Rev. 47 #3184.
D. J. Kleitman and J. B. Shearer; Further Gossip Problems, Discrete Mathematics 30 (1980), 151-156. Math. Rev. 81d:05068.
R. Tijdeman, On a telephone problem. Nieuw Arch. Wisk. (3) 19 (1971), 188-192. Math. Rev. 49 #7151
|
|
LINKS
|
T. Sillke, References
T. Sillke, Proofs
|
|
FORMULA
|
a(n) = 2n - 4 for n >= 4.
|
|
CROSSREFS
|
Cf. A007456.
Sequence in context: A029902 A024511 A024705 this_sequence A051755 A092535 A135667
Adjacent sequences: A058989 A058990 A058991 this_sequence A058993 A058994 A058995
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
TORSTEN.SILLKE(AT)LHSYSTEMS.COM, Wed Jan 17 2001
|
|
|
Search completed in 0.002 seconds
|
