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
whats the adaptation

difference between genral and event procedures

The instructions of the logic functions are: and not, or and xor. These act on the bits of their operators. To make sure the result of the operations we revolve to the cmp and test

What constitutes ERP? ERP typically comprises a client server architecture, fourth generation language, RDBMS and graphical user interface in an open systems environment. It

Operating Systems: The operating system is the software that mediates between the applicationsĀ programs and a level of instructions nearer to the machine's operations. In othe

Can someone help me write a code for force = mass * acceleration.


what is HMtl stands for, meaning and purpose


i don''t understand how to create a program using double, int, float, short etc