460 viewsDiscrete maths
0
0 Comments

Let Σ = {a,b,c,d,e} be an alphabet. We define an encoding scheme as follows: g(a) = 3,g(b) = 5,g(c) = 7,g(d) = 9,g(e) = 11.
Let pi denote the i-th prime number (p1 = 2 ). For a non-empty string s = a1…an, where each ai ∈ Σ, define f(s) = Πfrom(i=1to n)Pi^g(ai) .
For a non-empty sequence <sj,…,sn>of stings from Σ+, define h (<si…sn>) = Πfrom(i=1to n)Pfi (si). Which of the following numbers is the encoding, h, of a non-empty sequence of strings?
A. 2^7 3^7 5^7             B. 2^8 3^8 5^8           C. 2^9 3^9 5^9                D. 2^10 3^10 5^10

WP2Social Auto Publish Powered By : XYZScripts.com