functions, Basic Computer Science

each of the following functions has the form f(x ) = (ax+b) mod n. assume that each function has type N base n arrow N base n, so that we can think of f as a cipher for an alphabet represented by the numbers 0, 1, ......, n -1. Use (2.6) to determine whethereach function is a bijection, and , if so, construct its inverse. Then use (2.8) to determine whether the function has fixed points (i.e., letters that dont change), and , if so find them.
b. f(x) = 2x mod 6
d. f(x) = (3x+2) mod 6
f. f(x) = (5x+3) mod 12
Posted Date: 10/19/2012 9:43:08 PM | Location : United States







Related Discussions:- functions, Assignment Help, Ask Question on functions, Get Answer, Expert's Help, functions Discussions

Write discussion on functions
Your posts are moderated
Related Questions
Telecommunications network: "A telecommunications network, at its simplest, may be regarded as comprising a transmission network, an arrangement of transmission paths and swit


QUESTION (a) Consider the graph below, use the Flow Decomposition technique to list the cycles and paths produced.                                                (b) Pr

different types of software interfaces which falls in different categories

The Widening Web The idea, the whole world is agog now had accidental origins. Here is how it all began. In early 1969, the U.S. Defence department financed a network fo

I WANT TO CONNECT A PC WIYH MY PC THROUGH REMOTE DESKTOP. WHAT I DO TELL ME PLEASE

2. Mike sells on the average 15 newspapers per week (Monday – Friday). Find the probability that 2.1 In a given week he will sell all the newspapers [7] 2.2 In a given day he w

Uniform Path Cost Search-Artificial intelligence A breadth first search will search the solution with the shortest path length from the first state to the goal state. Though, t


Explain about MIDI audio