Do this question: Fill in the blanks so that the argument in part (b) has the same logical form as the argument in part a:   a.  If n is divisible by 6, then n is divisible by 3. If n is divisible by 3, then the sum of the digits of n is divisible by 3. Therefore, if n is divisible by 6, then the sum of the digits of n is divisible by 3. (b). If this function is ______________ then this function is differentiable. If this function is ______________ then this function is continuous. Therefore, if this function is a polynomial, then this function ______________. a. If all computer programs contain errors, then this program contains an error. This program does not contain an error. Therefore, it is not the case that all computer programs contain errors. b. If ______________, then ______________. Tom is not Python Programmer. Therefore, it is not the case that all software programmers in the company use Python for programming. do it without Ai

Need some help with this c++ problem In order to compute a power of two, you can take the next-lower power and double it. For example, if you want to compute 211 and you know that 210 = 1024, then 211 = 2 × 1024 = 2048. Based on this observation, write a recursive function int pow2(int n) where n is the exponent. If the exponent is negative, return -1. int pow2(int n) {        ..... }

1. Prove the following using an inductive argument: (2i-1)=n² i=1

Can I get help in racket please. Please do not solve in any other programs/language. When writing the following recursive functions, use only car/first, cdr/rest and cons functions. Do not use any built-in functions, except expt. 4. Write a recursive function, sumofSqr, that that will return the sum of the squares of the first N natural numbers. (sumofSqr 3) (sumofSqr 10) ===> 385 (sumofSqr 0) ===> 14 (12 + 22 + 32 ) ===> 0 5. Write a recursive function, mult5, at will return how many numbers in the list are multiples of 5. (mult5 '(60 22 13 25) ===> 2 (mult5 '(5) ===> 1 (mult5 '() ===> 0 6. Write a recursive function, getlast, that will return the last element in a list. If the list is empty, return the string "empty list". 7. Write a recursive function, countdown, that takes any non-negative integer start as its argument returns a list of all the positive integers less than or equal to start, in descending order: (countdown 5) ===> (5 4 32 1) (countdown 1) ===> (1) (countdown 0) ===>…

find a counterexample for the statement,

Write the negation of each of the following statements (hint: you may have to apply DeMorgan’s Law multiple times) Please show work