functions, Basic Computer Science

Assignment Help:
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

Related Discussions:- functions

Rom, what is rom

what is rom

471, #que411stion..

#que411stion..

Paper system, Paper System : When setting up a computer system you need to...

Paper System : When setting up a computer system you need to ask yourself 'Does the system you plan to operate work manually, i.e., on paper?' It is a popular misconception that t

RMO CSMS marketing subsystem, I need to write a narrative n overview of the...

I need to write a narrative n overview of the diagram and an analysis of the actors

Describe the binary search algorithm, QUESTION 1 Describe the binary se...

QUESTION 1 Describe the binary search algorithm using an example of your own. QUESTION 2 (a) By showing all your workings, give a big-O estimate for f(x) = (x + 1)lo

Development of personnel computer operating system, Development of Personne...

Development of Personnel Computer Operating System: The next important breakthrough in computer use occurred in 1982, with the introduction of the IBM personal computer. The I

Finite Automata, (S**)*=S*** is this set bigger than S*??

(S**)*=S*** is this set bigger than S*??

Twisted pair cable, what are daily uses of twisted pair cable in network

what are daily uses of twisted pair cable in network

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd