MATLAB Answers

can any one solve this ?

3 views (last 30 days)
moxtar on 18 Jun 2020
Commented: Rik on 19 Jun 2020
This question was flagged by Walter Roberson


Show 2 older comments
John D'Errico
John D'Errico on 19 Jun 2020
Please stop asking your exam questions on Answers. That you need an answer just means you need to study harder.
moxtar on 19 Jun 2020
this is online exam i am free to ask anyone to help me while solving
Rik on 19 Jun 2020
Question removed by zheer sabir retrieved from Google cache:

Sign in to comment.

Accepted Answer

Walter Roberson
Walter Roberson on 18 Jun 2020
Edited: Walter Roberson on 18 Jun 2020
Q5) Proving that something cannot be solved "computationally" is hard work, typically worth a lot more than 5 points. Even Abel and Ruffini in their famous proof about the general solution of quintic polynomials, were satisfied with the very much more modest proof that no solution to those particular kinds of equations was possible with "algebraic numbers".
Providing an answer to this question requires Graduate courses in Computing Theory, Number Theory, Complex Analysis, and Differential Equations.
It is much easier, much easier, to give examples for which there is no known symbolic solution, rather than to prove that it cannot be solved computationally. (Heck, we don't even know whether is rational, so there are big limits on what we know to be solvable computationally, )
Q6) Unless the "set of data" mentioned first is infinite in extent, then the discrete set of known data is the same as the set of data.
Q7) Explicit numerical solution of what equation? The one from Q5? But the one from Q5 is not certain to involve multidimensional equations.
Note: multidimensional differential equations are not the same as multivariate differential equations.
The list of questions look to me like a joke exam. Check under your desk for a piano.


moxtar on 18 Jun 2020
so you think this questions are cant be answered this questions are in online exam !!!
Walter Roberson
Walter Roberson on 19 Jun 2020
Q6 and Q7 are not clear enough to be answered.
Q5 is potentially answerable. The shortcut to proving that something cannot be solved computationally is typically a proof by way of contradiction, along the lines of the proof that the real numbers are uncountable, or along the lines of Turing's Halting Problem. However, it is not at all clear that any differential equation related to such matters is solvable by an efficient numeric method.
moxtar on 19 Jun 2020
thanks alot

Sign in to comment.

More Answers (0)