We say that a real numberx∈[0,1) is computable if there exists an algorithm which, given〈n〉as input for an arbitrary natural numbern, computes (in a finite number of steps) thenth (binary) digit ofxafter the decimal point. this means that a computable number canbe approximated to any desired degree of precision. prove that there exist uncountably manyuncomputable numbers

if x = 1, then the answer is 3.5

(1, –1), (16, –4), (36, –6)

step-by-step explanation:

given that the function is

this can also be written as

we have to graph this function and check which list of points lie on the graph

see attachment for graph:

we find that the points lying are (1,-1) (16,-4) and (36,-6)

since square root is there we find that x can only be posiitve but y can be since square root both positive and negative.

x is the total time in minutes for the free response

you are given number of questions as 15 - m and time per item as 8 minutes

to find x multiply the two givens together:

x = 8 * (15-m) = 8(15-m)

perimeter of the base times height

step-by-step explanation: