FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister 
 ProfileProfile   PreferencesPreferences   Log in to check your private messagesLog in to check your private messages   Log inLog in 
Forum index » Science and Technology » Math » Combinatorics
hard task
Post new topic   Reply to topic Page 1 of 1 [1 Post] View previous topic :: View next topic
Author Message
klawesyn28@mail.com
science forum beginner


Joined: 18 Sep 2005
Posts: 25

PostPosted: Mon Sep 19, 2005 11:05 am    Post subject: hard task Reply with quote

I don't know how to solve this task:


Participants of math competition are solving six tasks. For each task
you can get one of marks - 6,5, 3 or 0 .
It transpired that for each pair of participants we can indicate two
tasks , that in each of them participant A got different mark from
participant B.
Delimit the highest number of participants for which this situation is
possible.


Could anybody help me?
Back to top
Google

Back to top
Display posts from previous:   
Post new topic   Reply to topic Page 1 of 1 [1 Post] View previous topic :: View next topic
The time now is Fri Jan 09, 2009 11:57 pm | All times are GMT
Forum index » Science and Technology » Math » Combinatorics
Jump to:  

Similar Topics
Topic Author Forum Replies Last Post
No new posts Hard analysis problem (epsilon deltas) Snis Pilbor Math 1 Thu Jul 13, 2006 2:07 am
No new posts Building a hard drive clean room? jho Chem 2 Fri Jun 30, 2006 10:35 pm
No new posts Hard probability questions Erin Undergraduate 7 Wed May 17, 2006 6:02 am
No new posts Quadratic that computers have a hard ... Matt Math 6 Fri May 05, 2006 11:06 am
No new posts Poisson process task: analysis and si... ijs@iitis.gliwice.pl Undergraduate 4 Sat Apr 29, 2006 3:02 pm

Credit Expert | Xecuter 3 Mod Chip | Free Advertising | Bankruptcy | Online Advertising
Copyright © 2004-2005 DeniX Solutions SRL
Other DeniX Solutions sites: Electronics forum |  Medicine forum |  Unix/Linux blog |  Unix/Linux documentation |  Unix/Linux forums


Powered by phpBB © 2001, 2005 phpBB Group
[ Time: 1.3493s ][ Queries: 16 (1.2819s) ][ GZIP on - Debug on ]