QI: The Collatz conjecture function is defined for a positive integer m as follows. (COO1) g(m) = 3m+1 if m is odd = m/2 if m is even =1 if m=1 The repeated application of the Collatz conjecture function, as follows: g(n), g(g(n)), g(g(g(n))), ... e.g. If m=17, the sequence is 1. g(17) = 52 2. g(52) = 26 3. g(26) = 13 4. g(13) = 40 5. g(40) = 20 6. g(20) = 10 7. g(10) = 5 8. g(5) = 16 9. g(16) = 8 10. g(8) = 4 11. g(4) = 2 12. g(2) = 1 Thus if m=17, apply the function 12 times in order to reach m=1. Use Recursive Function.

QI: The Collatz conjecture function is defined for a positive integer m as follows. (COO1) g(m) = 3m+1 if m is odd = m/2 if m is even =1 if m=1 The repeated application of the Collatz conjecture function, as follows: g(n), g(g(n)), g(g(g(n))), ... e.g. If m=17, the sequence is 1. g(17) = 52 2. g(52) = 26 3. g(26) = 13 4. g(13) = 40 5. g(40) = 20 6. g(20) = 10 7. g(10) = 5 8. g(5) = 16 9. g(16) = 8 10. g(8) = 4 11. g(4) = 2 12. g(2) = 1 Thus if m=17, apply the function 12 times in order to reach m=1. Use Recursive Function.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter2: Basic Linear Algebra

Section: Chapter Questions

Problem 15RP

See similar textbooks

Similar questions

Create a geometric series to model a geometric series. using friend functions overload the ~ operator to find tbe nth term of the series. likewise, overload the"! " operator using a friend function to find the sum of geometric series.
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))
Please help me with these question. SHow all you work. Thank you 1. Prove that∀k ∈ N, 1k + 2k + · · · + nk ∈ Θ(nk+1). 2. Suppose that the functions f1, f2, g1, g2 : N → R≥0 are such that f1 ∈ Θ(g1) and f2 ∈ Θ(g2).Prove that (f1 + f2) ∈ Θ(max{g1, g2}).Here (f1 + f2)(n) = f1(n) + f2(n) and max{g1, g2}(n) = max{g1(n), g2(n)}
In R-Studio Problem 2. Find a large set of integers (with at least 10000 observations) representing a sample drawn from real life (i.e., do not generate the numbers using some random number generator). First, explain what the integers correspond to in real life. Then, investigate the distribution of the integers, and also the first and last digits of the integers in this sample (For example, if the data has [34 65], plot the distribution of these numbers and also distribution of [3,6] and [4 ,5] separately). Does any of these digits follow a uniform distribution? Is this expected? If one of them does not follow a uniform distribution, what distribution does it follow? Can you explain why? [You can analyze the image age dataset provided by IMDB Wiki, which contains the ages of actors and actresses whose photos are present in the IMDB database. The data contains 459868 age values in years, ranging from 1 to 99 years.]
5. Let R = {1, 3, π, 4, 1, 9, 10}, S = {{1}, 3, 9, 10}, T = {1, 3, π}, and U = {{1, 3, π}, 1}. Which of thefollowing are true? For those that are not, why not? (d) 1 ⊆ U(e) {1} ⊆ T(f) {1} ⊆ S(g) {1} ∈ S
For each of the following functions, indicate the class (g(n)) the function belongs to. (Use the simplest g(n) possible in your answers.) Please show work to prove the assertions.
Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) = x ^2. The composition of fog (-2) is --
For doing the lab activity: 1) Apply Recursive function technique to solve Problem 1 and 2. (Do not use iterative method) 2) Use map, filter, reduce and lambda functions to solve the problem 3. 1.Evaluate Binomial Coefficient. nCr=n! / (r! *(n-r)!) 2. Fibonacci Numbers (Sequence): 0, 1, 1, 2, 3, 5, 8 …
SUCCESSIVE-OVER-RELAXATION Method TROUBLESHOOTING: Fix the errors in the code below and run the script with your modified code function [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % Solves Ax = b by Gauss-Seidel method with relaxation. % USAGE: [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % INPUT: % func = handle of function that returns improved x using % x = starting solution vector % maxIter = allowable number of iterations (default is 500) % epsilon = error tolerance (default is 1.0e-9) % OUTPUT: % x = solution vector % numIter = number of iterations carried out % omega = computed relaxation factor if nargin < 4; epsilon = 1.0e-9; end if nargin < 3; maxIter = 500; end k = 10; p = 1; omega = 1; for numIter = 1:maxIter xOld = x; x = feval(func,x,omega); dx = sqrt(dot(x - xOld,x - xOld)); if dx < epsilon; return; end if numIter == k; dx1 = dx; end if numIter == k + p omega = 2/(1 + sqrt(1 - (dx/dx1)ˆ(1/p))); end end error(’Too many iterations’)
justify whether each of the following functions is injective, surjective, bijective, or none of these categories: (N is the set of natural numbers, and Σ∗ is the set of all strings over Σ.) (a) h : Σ∗ → Σ∗, where Σ = {a, b}, and h(w) = wR
Only in c++. With correct detail answer will upvoted else downvote. There are one feline, k mice, and one opening on an arrange line. The feline is situated at the point 0, the opening is situated at the point n. All mice are situated between the feline and the opening: the I-th mouse is situated at the point xi (0<xi<n). At each point, numerous mice can be found. In one second, the accompanying occurs. To begin with, precisely one mouse moves to one side by 1. On the off chance that the mouse arrives at the opening, it stows away (for example the mouse will no more move to any point and won't be eaten by the feline). Then, at that point (after that the mouse has completed its turn) the feline moves to one side by 1. In the event that at the new feline's position, a few mice are found, the feline eats them (they can not move after that). The activities are performed until any mouse hasn't been covered up or isn't eaten. At the end of the day, the primary move is made by a…
Use the program truth.m and a modified version of propos.m to prove or disprove the following. [(p ∧ q) ⊕ (r → s)] ⇔ [(p ∧ r) ∨ (q → s)] If it is not valid, give a counterexample; otherwise, explain why it is valid. propos.m function prop=propos(p) global num if p<0 num=3 else prop(1)=~p(1) | p(3); prop(2)=~(~p(1) | p(3)); prop(3)=p(2)&~(~p(1) | p(3)); end %Program truth.m% Construct the truth table for proposition(s) in propos.mclearformat compactglobal numpropos(-1);tot=2^num;separt=888;disp(' Basic variables 888 Proposition value(s)')for i=1:totq=i-1;for j=1:numr=rem(q,2);p(num+1-j)=r;q=(q-r)/2;endprop=propos(p);disp([p separt prop])end