document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=908676>Question 908676</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Please help me solve this:<BR>\n" );
document.write( "1. In how many ways can 5 people be arranged on a bench?around a circular table?<BR>\n" );
document.write( "2. If two of them insist on sitting next to each other, how many arrangements are possible?\r<BR>\n" );
document.write( "\n" );
document.write( "Give two sets A, B and an application f:A -> B such that:<BR>\n" );
document.write( "a) f is bijective,<BR>\n" );
document.write( "b) is injective, but not surjective,<BR>\n" );
document.write( "c) f is surjective, but not injective,<BR>\n" );
document.write( "d) f is neither injective nor surjective.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #551277 by </B><A HREF=/tutors/aboutme.mpl?userid=stanbon><B>stanbon(75887)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=stanbon><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/images/nopicture.jpg><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=551277\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Please help me solve this:<BR>\n" );
document.write( " 1. In how many ways can 5 people be arranged on a bench?::: 5! = 120<BR>\n" );
document.write( "---<BR>\n" );
document.write( "around a circular table?:: 4! = 24<BR>\n" );
document.write( "--------------------------------------------<BR>\n" );
document.write( " 2. If two of them insist on sitting next to each other, how many arrangements are possible?<BR>\n" );
document.write( "Arrangements of the special 2:: 2 ways<BR>\n" );
document.write( "Arrangements of the 5 where 2 act as a unit: 4!<BR>\n" );
document.write( "Ans 4!*2 = 24*2 = 48 arrangements<BR>\n" );
document.write( "-----------------------------------------------------<BR>\n" );
document.write( " Give two sets A, B and an application f:A -> B such that:<BR>\n" );
document.write( "Use Google to see examples.<BR>\n" );
document.write( "Search for \"bijective function\".\r<BR>\n" );
document.write( "\n" );
document.write( " a) f is bijective,<BR>\n" );
document.write( " b) is injective, but not surjective,<BR>\n" );
document.write( " c) f is surjective, but not injective,<BR>\n" );
document.write( " d) f is neither injective nor surjective.<BR>\n" );
document.write( "===============<BR>\n" );
document.write( "Cheers,<BR>\n" );
document.write( "Stan H. <BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );