Print the first 10 Fibonacci numbers using R programming language.

Use python programming language only

Python Using recursion No loops Print asterisks If k > n, n is negative or zero, or indent is negative, the function does not print anything. It may use string multiplication and formatted strings such s * num for some string s and some integer num def printStars(k, n, indent):

All computers store the strings of O's and 1's of binary numbers in the same format. True False

Using python programming

A prime number is an integer number greater than 1 that has no positive divisors other than one and itself. The table below are examples of some primes numbers. 2 5 7 31 73 127 179 181 191 193 41 83 43 79 131 137 139 89 233 239 241 283 293 307 353 359 367 373 431 419 421 433 467 479 487 491 251 311 First 100 Prime Numbers Accept This Assignment Purpose #69568886 11 47 97 149 197 257 313 379 439 499 13 53 101 17 59 103 151 199 263 269 317 383 389 443 449 503 509 19 61 107 157 163 211 223 227 Enter an integer to test: $#y6@ Invalid integer value! Try again 67 109 167 405 271 277 331 337 347 401 397 457 461 521 523 Assignment Description Write a program that will prompt the user for an integer n that will be tested to determine if it is a prime number. The best approach is to start by assuming the integer n is a prime number (isPrime=True) and attempting to prove it is not prime by testing it to find a number i that divides it evenly using the modulo (remainder) operator (i.e. n%i==0)....

The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17 # we want the square root of 17 for exampleg = 4 # our guess is 4 initiallyerror = 0.0000000001 # we want to stop when we are this closewhile abs(n - (g**2)) > error: g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!