We have a rope and want to cut the rope into four pieces to make a square. Given a rope of length ?�, what is the largest square (by area) that can be built given that a side of the square, ?�, can only be integer values? Units of measurement can be ignored. We are only interested in the numerical value of the solution. Function specifications Argument(s):

We have a rope and want to cut the rope into four pieces to make a square. Given a rope of length ?�, what is the largest square (by area) that can be built given that a side of the square, ?�, can only be integer values? Units of measurement can be ignored. We are only interested in the numerical value of the solution. Function specifications Argument(s):

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

Apply Python Programming to this problem:With a rotated conic as such: Ax^2 + Bxy + Cy^2 + Dx + Ey + F = 0, write a function classifyconic(x) which has a purpose to classify if the given parameter of a conic is elliptic, hyperbolic or parabolic. The given parameter is x = [A, B, C, D, E, F].Note: A parabolic rotated conic has a discriminant D = B^2 - 4AC that is equal to zero. An elliptical rotated conic has a discriminant less than zero. A hyperbolic rotated conic has a discriminant greater than zero.Consider these questions:What type of rotated conics are these equations?1. x^2 - 3xy - 2y^2 + 8x + 6y + F1 = 02. x^2 + 2xy + y^2 + 2x + 4y + F2 = 03. x^2 + 3xy + 4y^2 + 3x + 5y + F3 = 0
Write a function solver that takes a non-negative integer upper_bound as an argument, and prints all non-negative integers i line-by-line in ascending order such that i is at most upper_bound, and i+100 and i+268 are perfect squares. Note that the function solver prints the numbers instead of returning them, but you may want to define a helper function is_perfect_square to return whether a number is a perfect square.
Let l be a line in the x-yplane. If l is a vertical line, its equation is x = a for some real number a. Suppose l is not a vertical line and its slope is m. Then the equation of l is y = mx + b, where b is the y-intercept. If l passes through the point (x₀, y₀), the equation of l can be written as y - y₀ = m(x - x₀). If (x₁, y₁) and (x₂, y₂) are two points in the x-y plane and x₁ ≠ x₂, the slope of line passing through these points is m = (y₂ - y₁)/(x₂ - x₁). Instructions Write a program that prompts the user for two points in the x-y plane. Input should be entered in the following order: Input x₁ Input y₁ Input x₂
Consider the following function of two variables: ?(?,?)=1+?2?2�(�,�)=1+�2�2 Use SymPy for the following:a) Write a function `S` with a parameter ?� to evaluate the function ?(?)�(�) given by the following integral: ?(?)=∫1?2?(?,?)??�(�)=∫�21�(�,�)�� as a symbolic expression in ?�.b) Write a function `D(x,n)` which takes as arguments a symbol `x` and an integer ?� to evaluate the ?�-th derivative of ?(?)�(�) with respect to ?�.c) Finally write a function `T(a)` with one argument a given by a sympy.Rational to evaluate the integeral?(?)=∫?0?(?)??.�(�)=∫0��(�)��. The functions ?(?)�(�) and ?(?,?)�(�,�) should both return polynomials of the type `sympy.Poly`, variable `x` and domain `sympy.QQ`. The function ?(?)�(�) should return a sympy.Rational If ?� is not a not an integer greater than or equal to 0 then a ValueError should be raised in ?(?,?)�(�,�) Hint: Note that the the output of "sympy.integrate" is not a SymPy polynomial. Note that the function "sympy.diff" does not…
An object leaves point P1 with coordinates (−1,0) and travels with velocity v1=1 in a straight line to point P2 with coordinates (0,h) . It then travels with velocity v2=2 in a straight line from P2 to point P3 with coordinates (x , y ). Given x and y values there will be some optimal h value that minimizes the total travel time. Write a program in Scilab containing a function in the form function u = h(x,y) [your code goes here] endfunction u = h(1,2); disp(u); that calculates this optimal h value (to an accuracy of about 10^−6 ) given x and y values as arguments. Your function must work for any positive values of x and y.
The question describes a function S(k) which is defined as the sum of the positive divisors of a positive integer k, minus k itself. The function S(1) is defined as 1, and for any positive integer k greater than 1, S(k) is calculated as S(k) = σ(k) - k, where σ(k) is the sum of all positive divisors of k. Some examples of S(k) are given: S(1) = 1 S(2) = 1 S(3) = 1 S(4) = 3 S(5) = 1 S(6) = 6 S(7) = 1 S(8) = 7 S(9) = 4 The question then introduces a recursive sequence a_n with the following rules: a_1 = 12 For n ≥ 2, a_n = S(a_(n-1)) Part (a) of the question asks to calculate the values of a_2, a_3, a_4, a_5, a_6, a_7, and a_8 for the sequence. Part (b) modifies the sequence to start with a_1 = k, where k is any positive integer, and the same recursion formula applies: for n ≥ 2, a_n = S(a_(n-1)). The question notes that for many choices of k, the sequence a_n will eventually reach and remain at 1, but this is not always the case. It asks to find, with an explanation, two specific…
We have been working extensively with the predicate "eventually greater than" defined on pairs of functions f of g. Which of the following is equivalent to f(x) is not eventually greater than g(x)? (Select all that apply) Group of answer choices ¬((∃x0)(∀x)(x>x0→f(x)>g(x))) ((∃x0)(∀x)(x>x0→f(x)≤g(x))) (∀x)(∃x0)(x0>x→f(x0)≤g(x0)) (∀x)(∃x0)(x0>x→f(x0)≤g(x0))
1. Given the following data set: X: 0 2 4 6 9 11 12 15 17 19 22 25 Y: 5 6 7 6 9 8 7 10 12 12 15 10 (a) Write a Python program to fit a curve using:  Polynomial function of order 4  Cubic spline fit Plot both the data set and the approximating curve for the polynomial and spline functions. (b) In the Python program, add labels along the x and y axes, and put a title of your choice for each plot.
A triple (x, y, z) of positive integers is pythagorean if x2 + y2 = z2. Using the functions studied in class, define a function pyth which returns the list of all pythagorean triples whose components are at most a given limit. For example, function call pyth(10) should return [(3, 4, 5), (4, 3, 5), (6, 8, 10), (8, 6, 10)]. [Hint: One way to do this is to construct a list of all triples (use unfold to create a list of integers, and then a for-comprehension to create a list of all triples), and then select the pythagorean ones. def unfold[A, S](z: S)(f: S => Option[(A, S)]): LazyList[A] = f(z) match { case Some((h, s)) => h #:: unfold(s)(f) case None => LazyList() } code in scala
You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. You will then trace that function, showing how memory is used and provide any and all output. You then need to present a relationship, whose domain is some subset of the integers. Finally, you need to provide a prove that the relationship holds over the entire domain by using detailed Mathematical Induction prove. 1. You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. 2. Trace your function and call. Remember that you must keep track of memory for each function call and provide output. 3. Present a relationship with the domain some subset of the integers that is to be proven via Mathematical Induction. 4. Prove your relationship with the domain some subset…
IN PYTHON A tridiagonal matrix is one where the only nonzero elements are the ones on the main diagonal and the ones immediately above and below it.Write a function that solves a linear system whose coefficient matrix is tridiag- onal. In this case, Gauss elimination can be made much more efficient because most elements are already zero and don't need to be modified or added. As an example, consider a linear system Ax = b with 100,000 unknowns and the same number of equations. The coefficient matrix A is tridiagonal, with all elements on the main diagonal equal to 3 and all elements on the diagonals above and below it equal to 1. The vector of constant terms b contains all ones, except that the first and last elements are zero. You can use td to find that x1= −0.10557. The following code format should help: def td(l, m, u, b): '''Solve a linear system Ax = b where A is tridiagonal Inputs: l, lower diagonal of A, n-1 vector m, main diagonal of A, n vector u,…
In Python, write a function that produces plots of statistical power versus sample size for simple linear regression. The function should be of the form LinRegPower(N,B,A,sd,nrep), where N is a vector/list of sample sizes, B is the true slope, A is the true intercept, sd is the true standard deviation of the residuals, and nrep is the number of simulation replicates. The function should conduct simulations and then produce a plot of statistical power versus the sample sizes in N for the hypothesis test of whether the slope is different than zero. B and A can be vectors/lists of equal length. In this case, the plot should have separate lines for each pair of A and B values (A[1] with B[1], A[2] with B[2], etc). The function should produce an informative error message if A and B are not the same length. It should also give an informative error message if N only has a single value. Demonstrate your function with some sample plots. Find some cases where power varies from close to zero to…