(a)Count the number of length n permutations conisting
of a single cycle, when written in cycle notation. (Explain your
answer.)
(b)How many permutations of length 2n have a cycle of
length n + 1? (Explain your answer.)
Assume the following for a stock and a call and a put option
written on the stock.
EXERCISE PRICE = $20
CURRENT STOCK PRICE = $20
VARIANCE = .25
TIME TO EXPIRATION = 3 MONTHS
RISK FREE RATE = 3%
Use the Black Scholes procedure to determine the value of the
call option and the value of a put.
Compute all possible cycles, length of the cycle, and number of
cycles in the following cases:
(a) mult by 3 mod 17
(b) mult by 13 mod 17
(c) mult by 9 mod 17
(d) mult by 16 mod 17
Determine the values of m and n when the following average distance from the Sun to the Earth is written in scientific notation: 150,000,000,000 m.
Enter m and n, separated by commas
Assume the following information for a stock and a European call
option written on the stock ,Exersice price 80,current stock price
70,the variance is0.4,time to expiration 0.5 semi annum ,risk free
rate of return 0.07.Detaermin the time premium using Binomial
,assume it is a two period call option.
1.Note: The following code is written only in main -- you assume
there is an array bag and you are not adding any methods to that
bag.
Write the main program to create two array bags of type string.
Place 5 strings of your choice in the first bag and 5 strings (of
your choice) in the second bag. Your program must:
a) determine if there are any strings in the first bag that
appears in the second bag as...
Which of the following recursive sequences is not
well-defined?
a0 = 4, an = an-12 +
an-2
a0 = 0, an = an-1 + 1
a0 = 2, an = 2an-1 + 1
a0 = 3, a1 = 4, an =
an-1 + an-2