infinite turning points without trig…possible?












1












$begingroup$


Is it possible to make a function with INFINITE turning points using ONLY



REAL exponentials (and logs)

REAL powers of x

powers,roots, sums, products, quotients, compositions etc of the above



(NO trigs, piecewise, mod)



My feeling is not on the grounds that such a function could be broken down into smaller units each of which will only have a finite number of TP and as such a combination of finite TP cannot produce infinite TP. Can anyone suggest a formal approach which I can use as a starting point



Thanks for your views.










share|cite|improve this question











$endgroup$








  • 4




    $begingroup$
    $f(x) = 0.hphantom{}$
    $endgroup$
    – Ennar
    Jan 5 at 23:11










  • $begingroup$
    @Ennar That's clearly cheating. Any other examples?
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:18






  • 2




    $begingroup$
    @Matt Samuel, sure if you'll let piecewise defined functions. But if you insist on $f = f_1circldots circ f_n$, where $f_i$ is elementary, non-constant, non-trigonometric, then no, by induction.
    $endgroup$
    – Ennar
    Jan 5 at 23:20












  • $begingroup$
    @Ennar I think that last one is what the op is looking for.
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:21






  • 2




    $begingroup$
    As I said in an earlier comment $f(x) = x$ and $g(x) = -x$ both have exactly one root but $h(x) = f(x) + g(x) = 0$ has infinitely many roots. So first of all, you need to come up with a true conjecture.
    $endgroup$
    – Rob Arthan
    Jan 6 at 0:14


















1












$begingroup$


Is it possible to make a function with INFINITE turning points using ONLY



REAL exponentials (and logs)

REAL powers of x

powers,roots, sums, products, quotients, compositions etc of the above



(NO trigs, piecewise, mod)



My feeling is not on the grounds that such a function could be broken down into smaller units each of which will only have a finite number of TP and as such a combination of finite TP cannot produce infinite TP. Can anyone suggest a formal approach which I can use as a starting point



Thanks for your views.










share|cite|improve this question











$endgroup$








  • 4




    $begingroup$
    $f(x) = 0.hphantom{}$
    $endgroup$
    – Ennar
    Jan 5 at 23:11










  • $begingroup$
    @Ennar That's clearly cheating. Any other examples?
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:18






  • 2




    $begingroup$
    @Matt Samuel, sure if you'll let piecewise defined functions. But if you insist on $f = f_1circldots circ f_n$, where $f_i$ is elementary, non-constant, non-trigonometric, then no, by induction.
    $endgroup$
    – Ennar
    Jan 5 at 23:20












  • $begingroup$
    @Ennar I think that last one is what the op is looking for.
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:21






  • 2




    $begingroup$
    As I said in an earlier comment $f(x) = x$ and $g(x) = -x$ both have exactly one root but $h(x) = f(x) + g(x) = 0$ has infinitely many roots. So first of all, you need to come up with a true conjecture.
    $endgroup$
    – Rob Arthan
    Jan 6 at 0:14
















1












1








1





$begingroup$


Is it possible to make a function with INFINITE turning points using ONLY



REAL exponentials (and logs)

REAL powers of x

powers,roots, sums, products, quotients, compositions etc of the above



(NO trigs, piecewise, mod)



My feeling is not on the grounds that such a function could be broken down into smaller units each of which will only have a finite number of TP and as such a combination of finite TP cannot produce infinite TP. Can anyone suggest a formal approach which I can use as a starting point



Thanks for your views.










share|cite|improve this question











$endgroup$




Is it possible to make a function with INFINITE turning points using ONLY



REAL exponentials (and logs)

REAL powers of x

powers,roots, sums, products, quotients, compositions etc of the above



(NO trigs, piecewise, mod)



My feeling is not on the grounds that such a function could be broken down into smaller units each of which will only have a finite number of TP and as such a combination of finite TP cannot produce infinite TP. Can anyone suggest a formal approach which I can use as a starting point



Thanks for your views.







analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 6 at 0:43







Quadratica MPhil

















asked Jan 5 at 23:09









Quadratica MPhilQuadratica MPhil

274




274








  • 4




    $begingroup$
    $f(x) = 0.hphantom{}$
    $endgroup$
    – Ennar
    Jan 5 at 23:11










  • $begingroup$
    @Ennar That's clearly cheating. Any other examples?
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:18






  • 2




    $begingroup$
    @Matt Samuel, sure if you'll let piecewise defined functions. But if you insist on $f = f_1circldots circ f_n$, where $f_i$ is elementary, non-constant, non-trigonometric, then no, by induction.
    $endgroup$
    – Ennar
    Jan 5 at 23:20












  • $begingroup$
    @Ennar I think that last one is what the op is looking for.
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:21






  • 2




    $begingroup$
    As I said in an earlier comment $f(x) = x$ and $g(x) = -x$ both have exactly one root but $h(x) = f(x) + g(x) = 0$ has infinitely many roots. So first of all, you need to come up with a true conjecture.
    $endgroup$
    – Rob Arthan
    Jan 6 at 0:14
















  • 4




    $begingroup$
    $f(x) = 0.hphantom{}$
    $endgroup$
    – Ennar
    Jan 5 at 23:11










  • $begingroup$
    @Ennar That's clearly cheating. Any other examples?
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:18






  • 2




    $begingroup$
    @Matt Samuel, sure if you'll let piecewise defined functions. But if you insist on $f = f_1circldots circ f_n$, where $f_i$ is elementary, non-constant, non-trigonometric, then no, by induction.
    $endgroup$
    – Ennar
    Jan 5 at 23:20












  • $begingroup$
    @Ennar I think that last one is what the op is looking for.
    $endgroup$
    – Matt Samuel
    Jan 5 at 23:21






  • 2




    $begingroup$
    As I said in an earlier comment $f(x) = x$ and $g(x) = -x$ both have exactly one root but $h(x) = f(x) + g(x) = 0$ has infinitely many roots. So first of all, you need to come up with a true conjecture.
    $endgroup$
    – Rob Arthan
    Jan 6 at 0:14










4




4




$begingroup$
$f(x) = 0.hphantom{}$
$endgroup$
– Ennar
Jan 5 at 23:11




$begingroup$
$f(x) = 0.hphantom{}$
$endgroup$
– Ennar
Jan 5 at 23:11












$begingroup$
@Ennar That's clearly cheating. Any other examples?
$endgroup$
– Matt Samuel
Jan 5 at 23:18




$begingroup$
@Ennar That's clearly cheating. Any other examples?
$endgroup$
– Matt Samuel
Jan 5 at 23:18




2




2




$begingroup$
@Matt Samuel, sure if you'll let piecewise defined functions. But if you insist on $f = f_1circldots circ f_n$, where $f_i$ is elementary, non-constant, non-trigonometric, then no, by induction.
$endgroup$
– Ennar
Jan 5 at 23:20






$begingroup$
@Matt Samuel, sure if you'll let piecewise defined functions. But if you insist on $f = f_1circldots circ f_n$, where $f_i$ is elementary, non-constant, non-trigonometric, then no, by induction.
$endgroup$
– Ennar
Jan 5 at 23:20














$begingroup$
@Ennar I think that last one is what the op is looking for.
$endgroup$
– Matt Samuel
Jan 5 at 23:21




$begingroup$
@Ennar I think that last one is what the op is looking for.
$endgroup$
– Matt Samuel
Jan 5 at 23:21




2




2




$begingroup$
As I said in an earlier comment $f(x) = x$ and $g(x) = -x$ both have exactly one root but $h(x) = f(x) + g(x) = 0$ has infinitely many roots. So first of all, you need to come up with a true conjecture.
$endgroup$
– Rob Arthan
Jan 6 at 0:14






$begingroup$
As I said in an earlier comment $f(x) = x$ and $g(x) = -x$ both have exactly one root but $h(x) = f(x) + g(x) = 0$ has infinitely many roots. So first of all, you need to come up with a true conjecture.
$endgroup$
– Rob Arthan
Jan 6 at 0:14












0






active

oldest

votes












Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063303%2finfinite-turning-points-without-trig-possible%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063303%2finfinite-turning-points-without-trig-possible%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Wiesbaden

Marschland

Dieringhausen