Let the function f from the positive integers to the positive integers be defined by f(x) = x*x (where the asterisk * denotes ordinary integer multiplication). Explain why this function f is or is not an onto function. Let sets A and B be defined as follows: A = {a1} and B = {b1, b2}. List as separate sets of ordered pairs all the one-to-one functions from A to B, or explain why there are no such functions. What is the value of the variable count after all the loops in the following pseudocode execute? count: For i= 1 to 2 For to 2 count:[(j*count)+j] End-for End-for
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 | 1 | 2 | 3 | 4 | 5 |