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
Different kinds of registers are general between most microprocessor designs. These are: Program Counter (PC) This register is utilized to hold the memory address of the next instr

THE SECOND GENERATION (1956-1965) This generation of computers were characterized by:     Considerable reduction in physical size     Increased reliability

to do a assignment regarding IPC in linux

Discuss the factors considered during output design

Question 1 Explain boundary fill and flood fill polygon filling algorithm Question 2 Draw and explain the block diagram of typical workstation Question 3 Explain the ras

Purpose of Code This is a short program to practice assembly language loops and if/else statements. You will use various jump commands and the cmp instruction.  The progra



Explain how ICT can be used for achievement of each of the following business objectives, illustrating your answer with examples: 1. Customer intimacy 2. Low-cost leadership

The various systems (computer, software and output devices) that are available have different limitations for output that is cartographic in nature. Some systems are CAD, GIS limit