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

assembly programs

let me know if you can do this assignment and how long it takes

what is cai

My son has a project assignment he has problem with. The only thing is, it is due in 20 mins. can someone be able to help him? if so, how much is the fee?

Input devices of a digital computer: Input devices are used to read the instructions and data to be processed and output devices display the results obtained after executing t

how to start ms power point

Question 1 Classify and explain the different types of computers Question 2 List and explain the commonly used input devices Question 3 What is binary number system? Exp

Analogue and digital signals: Analogue (continuous) information is made available in virtually all aircraft equipment.  Figure 1 shows the analogue signal created by a variable