Find with proof the number of balanced strings of

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: W ! r W ¦ ¦ A–4 Let be the set of ordered triples elements of a finite set . Suppose that B–3 Given that , find, with proof, the largest possible value, as a function of (with ), of § ¢ £¡ A–3 Suppose that each of 20 students has made a choice of anywhere from 0 to 6 courses from a total of 6 courses offered. Prove or disprove: there are 5 students and 2 courses such that all 5 have chosen both courses or all 5 have chosen neither course. 1. B–2 Show that for every positive integer , jih g A–2 Let and be circl...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online