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
Write an alogorithm to calculate the right angled triangle

Network Control, Engineering and Management Network control in this sense involves traffic management, and the engineering of the networks to support varying traffic loads. In

how to get tamil information in internet

how to use excel..

find the regular expression of(a/?)(a/b)?

Problem a. Compare between file processing system and DBMS >>This is a comparison of DBMS with file processing system which the answer has to be searched from the GOOGLE an

Manipulate the following Boolean expression in such a way so that it can be implemented using exclusive-OR and AND gates only. AB''CD'' + A ''BCD'' + AB''C''D + A''BC''D

Design Problem 1. Implement a basic file system managed from within a file. The file system should have the following capabilities: i. List files stored along with their sizes.

Question 1 Explain different functions of an operating system. Explain the evolution of operating systems Question 2 Explain process creation and process termination Ques

QUESTION (a) Convert each of the following expressions to prefix and postfix. (i) (A+B)*(C+D) (ii) A-B/(C*D^E) (^ denotes exponentiation) (b) The following algorithm c