Answer:
Step-by-step explanation:


The base is same power can be add or subtract


Answer:
attempts are required to find a matching pair if the digital fingerprint is 64 bits long.
attempts are required to find a matching pair if the digital fingerprint is 128 bits long.
Step-by-step explanation:
Each bit has two options. So
How many attempts are required to find a matching pair if the digital fingerprint is 64 bits long?
So for each of the 64 bits, we have the following number of options.
2 - 2 - 2 - 2 -... - 2
So, in all, there are

options.
So,
attempts are required to find a matching pair if the digital fingerprint is 64 bits long.
128 bits long?
Using the same logic as the first question.

So,
attempts are required to find a matching pair if the digital fingerprint is 128 bits long.
Aruthmetic sequene is
an=a1+(n-1)d
where d=common difference between terms
adds 6 every time
d=6
first term is 8
a1=8
8+6(n-1)
distribute
8+6n-6
8-6+6n
2+6n is answer
Answer: Depends on the function but to figure this out you look for the growth factor in the equation is greater than 1
10+25+15=50
25/50
I can be simplified.
The greatest common factor is 25.
25/25=1
50/25=2
So the answer is 1/2.