Algorithm and Theorem on Student Activity Problems

V. Longani, S. Buada, D. Samana


In this paper Student Activity Problems are defined. The problems areabout joint activities among n 2 schools. There are p > n different activity rooms andeach school provide p students to join the activities. In each day, each student has tojoin an activity with a condition that in each room there are n students from n differentschools. It is required that each student participate all p activities in p days and eachhas a chance to work only once with every student from other schools. An algorithm isproposed for such arrangement and a related theorem is also given.

Full Text: PDF


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|