Find all functions that satisfy $f(x+f(y))=f(x)-y$Recurrence relations on a continuous domainFind all the functions which satisfy a given functional equationWhat is the family of functions that satisfiesFind all real functions $f:mathbb R to mathbb R$ satisfying the equation $f(x^2+y.f(x))=x.f(x+y)$Find all functions $f$ such that $f(x-f(y)) = f(f(x)) - f(y) - 1$The functional equation $ f(x-f(y))=f(f(y))+xf(y)+f(x)-1$Functions $f:mathbb R to mathbb R$ which satisfy $f(x^2+f(y))=y+(f(x))^2$Additive Cauchy functional equation with quotient of functions $fracf(x+y)g(x+y) + B = fracf(x)g(x) + fracf(y)g(y) $Do I Need To Find All Functions Satisfying A Given Equation In Such Cases?Finding all functions that verify a functional equation

School performs periodic password audits. Is my password compromised?

Giving a career talk in my old university, how prominently should I tell students my salary?

Short scifi story where reproductive organs are converted to produce "materials", pregnant protagonist is "found fit" to be a mother

If nine coins are tossed, what is the probability that the number of heads is even?

How to educate team mate to take screenshots for bugs with out unwanted stuff

Numerical value of Determinant far from what it is supposed to be

I am the person who abides by rules, but breaks the rules. Who am I?

Writing text next to a table

Is there a way to make cleveref distinguish two environments with the same counter?

Will expression retain the same definition if particle is changed?

Converting from "matrix" data into "coordinate" data

I reported the illegal activity of my boss to his boss. My boss found out. Now I am being punished. What should I do?

Idiom for feeling after taking risk and someone else being rewarded

How do we create new idioms and use them in a novel?

What does the Digital Threat scope actually do?

How do you make a gun that shoots melee weapons and/or swords?

How do I increase the number of TTY consoles?

I can't die. Who am I?

How can I portion out frozen cookie dough?

Is divide-by-zero a security vulnerability?

How to copy the rest of lines of a file to another file

Rationale to prefer local variables over instance variables?

What sort of fish is this

Was it really inappropriate to write a pull request for the company I interviewed with?



Find all functions that satisfy $f(x+f(y))=f(x)-y$


Recurrence relations on a continuous domainFind all the functions which satisfy a given functional equationWhat is the family of functions that satisfiesFind all real functions $f:mathbb R to mathbb R$ satisfying the equation $f(x^2+y.f(x))=x.f(x+y)$Find all functions $f$ such that $f(x-f(y)) = f(f(x)) - f(y) - 1$The functional equation $ f(x-f(y))=f(f(y))+xf(y)+f(x)-1$Functions $f:mathbb R to mathbb R$ which satisfy $f(x^2+f(y))=y+(f(x))^2$Additive Cauchy functional equation with quotient of functions $fracf(x+y)g(x+y) + B = fracf(x)g(x) + fracf(y)g(y) $Do I Need To Find All Functions Satisfying A Given Equation In Such Cases?Finding all functions that verify a functional equation













6












$begingroup$


here is the problem enter image description here



Here is my solution :



$x=y=0$ gives $f(f(0))=f(0)$



$x=0; y=f(0)$ gives $f(f(f(0)=0=f(0)$ (because $f(f(0))=f(0) iff f(f(f(0)))=f(f(0))=f(0)$)



$x=0$ gives $f(f(y))=-y$



$x=0 ; y=f(y)$ gives $f(-y)=-f(y)iff f(-f(y))=y$



so $y=-f(y)$ gives $f(2x)=2f(x)$



now we can prove by induction that $f(nx)=nf(x)$



it is true for $n=2$



let's suppose that it is true for $n$



we have $f(nx+f(-f(x))=f(nx)+f(x)iff f((n+1)x)=(n+1)x$



so it is true now we have $f(x)=xf(1)$



plugging this in the first equation gives $f(1)^2=-1$ which is impossible



I just want to know if my solution is right



In the official solution they prove that $f$ is bijective (which is true because $f(f(y))=-y$ ;) ) then they use cauchy function , they find that $f(x)=cx$ , plugging this in the first equation gives an impossible result.










share|cite|improve this question











$endgroup$











  • $begingroup$
    @vadim123 Because from the first line, $f(f(0)) = f(0)$.
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Looks right; you meant "which is impossible" near the bottom :)
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Ok updated .....
    $endgroup$
    – user600785
    yesterday















6












$begingroup$


here is the problem enter image description here



Here is my solution :



$x=y=0$ gives $f(f(0))=f(0)$



$x=0; y=f(0)$ gives $f(f(f(0)=0=f(0)$ (because $f(f(0))=f(0) iff f(f(f(0)))=f(f(0))=f(0)$)



$x=0$ gives $f(f(y))=-y$



$x=0 ; y=f(y)$ gives $f(-y)=-f(y)iff f(-f(y))=y$



so $y=-f(y)$ gives $f(2x)=2f(x)$



now we can prove by induction that $f(nx)=nf(x)$



it is true for $n=2$



let's suppose that it is true for $n$



we have $f(nx+f(-f(x))=f(nx)+f(x)iff f((n+1)x)=(n+1)x$



so it is true now we have $f(x)=xf(1)$



plugging this in the first equation gives $f(1)^2=-1$ which is impossible



I just want to know if my solution is right



In the official solution they prove that $f$ is bijective (which is true because $f(f(y))=-y$ ;) ) then they use cauchy function , they find that $f(x)=cx$ , plugging this in the first equation gives an impossible result.










share|cite|improve this question











$endgroup$











  • $begingroup$
    @vadim123 Because from the first line, $f(f(0)) = f(0)$.
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Looks right; you meant "which is impossible" near the bottom :)
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Ok updated .....
    $endgroup$
    – user600785
    yesterday













6












6








6


1



$begingroup$


here is the problem enter image description here



Here is my solution :



$x=y=0$ gives $f(f(0))=f(0)$



$x=0; y=f(0)$ gives $f(f(f(0)=0=f(0)$ (because $f(f(0))=f(0) iff f(f(f(0)))=f(f(0))=f(0)$)



$x=0$ gives $f(f(y))=-y$



$x=0 ; y=f(y)$ gives $f(-y)=-f(y)iff f(-f(y))=y$



so $y=-f(y)$ gives $f(2x)=2f(x)$



now we can prove by induction that $f(nx)=nf(x)$



it is true for $n=2$



let's suppose that it is true for $n$



we have $f(nx+f(-f(x))=f(nx)+f(x)iff f((n+1)x)=(n+1)x$



so it is true now we have $f(x)=xf(1)$



plugging this in the first equation gives $f(1)^2=-1$ which is impossible



I just want to know if my solution is right



In the official solution they prove that $f$ is bijective (which is true because $f(f(y))=-y$ ;) ) then they use cauchy function , they find that $f(x)=cx$ , plugging this in the first equation gives an impossible result.










share|cite|improve this question











$endgroup$




here is the problem enter image description here



Here is my solution :



$x=y=0$ gives $f(f(0))=f(0)$



$x=0; y=f(0)$ gives $f(f(f(0)=0=f(0)$ (because $f(f(0))=f(0) iff f(f(f(0)))=f(f(0))=f(0)$)



$x=0$ gives $f(f(y))=-y$



$x=0 ; y=f(y)$ gives $f(-y)=-f(y)iff f(-f(y))=y$



so $y=-f(y)$ gives $f(2x)=2f(x)$



now we can prove by induction that $f(nx)=nf(x)$



it is true for $n=2$



let's suppose that it is true for $n$



we have $f(nx+f(-f(x))=f(nx)+f(x)iff f((n+1)x)=(n+1)x$



so it is true now we have $f(x)=xf(1)$



plugging this in the first equation gives $f(1)^2=-1$ which is impossible



I just want to know if my solution is right



In the official solution they prove that $f$ is bijective (which is true because $f(f(y))=-y$ ;) ) then they use cauchy function , they find that $f(x)=cx$ , plugging this in the first equation gives an impossible result.







functional-equations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited yesterday







user600785

















asked yesterday









user600785user600785

11310




11310











  • $begingroup$
    @vadim123 Because from the first line, $f(f(0)) = f(0)$.
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Looks right; you meant "which is impossible" near the bottom :)
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Ok updated .....
    $endgroup$
    – user600785
    yesterday
















  • $begingroup$
    @vadim123 Because from the first line, $f(f(0)) = f(0)$.
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Looks right; you meant "which is impossible" near the bottom :)
    $endgroup$
    – rogerl
    yesterday










  • $begingroup$
    Ok updated .....
    $endgroup$
    – user600785
    yesterday















$begingroup$
@vadim123 Because from the first line, $f(f(0)) = f(0)$.
$endgroup$
– rogerl
yesterday




$begingroup$
@vadim123 Because from the first line, $f(f(0)) = f(0)$.
$endgroup$
– rogerl
yesterday












$begingroup$
Looks right; you meant "which is impossible" near the bottom :)
$endgroup$
– rogerl
yesterday




$begingroup$
Looks right; you meant "which is impossible" near the bottom :)
$endgroup$
– rogerl
yesterday












$begingroup$
Ok updated .....
$endgroup$
– user600785
yesterday




$begingroup$
Ok updated .....
$endgroup$
– user600785
yesterday










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%2f3140572%2ffind-all-functions-that-satisfy-fxfy-fx-y%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%2f3140572%2ffind-all-functions-that-satisfy-fxfy-fx-y%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

Solar Wings Breeze Design and development Specifications (Breeze) References Navigation menu1368-485X"Hang glider: Breeze (Solar Wings)"e

Kathakali Contents Etymology and nomenclature History Repertoire Songs and musical instruments Traditional plays Styles: Sampradayam Training centers and awards Relationship to other dance forms See also Notes References External links Navigation menueThe Illustrated Encyclopedia of Hinduism: A-MSouth Asian Folklore: An EncyclopediaRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to Play10.1353/atj.2005.0004The Illustrated Encyclopedia of Hinduism: A-MEncyclopedia of HinduismKathakali Dance-drama: Where Gods and Demons Come to PlaySonic Liturgy: Ritual and Music in Hindu Tradition"The Mirror of Gesture"Kathakali Dance-drama: Where Gods and Demons Come to Play"Kathakali"Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceMedieval Indian Literature: An AnthologyThe Oxford Companion to Indian TheatreSouth Asian Folklore: An Encyclopedia : Afghanistan, Bangladesh, India, Nepal, Pakistan, Sri LankaThe Rise of Performance Studies: Rethinking Richard Schechner's Broad SpectrumIndian Theatre: Traditions of PerformanceModern Asian Theatre and Performance 1900-2000Critical Theory and PerformanceBetween Theater and AnthropologyKathakali603847011Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceBetween Theater and AnthropologyBetween Theater and AnthropologyNambeesan Smaraka AwardsArchivedThe Cambridge Guide to TheatreRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeThe Garland Encyclopedia of World Music: South Asia : the Indian subcontinentThe Ethos of Noh: Actors and Their Art10.2307/1145740By Means of Performance: Intercultural Studies of Theatre and Ritual10.1017/s204912550000100xReconceiving the Renaissance: A Critical ReaderPerformance TheoryListening to Theatre: The Aural Dimension of Beijing Opera10.2307/1146013Kathakali: The Art of the Non-WorldlyOn KathakaliKathakali, the dance theatreThe Kathakali Complex: Performance & StructureKathakali Dance-Drama: Where Gods and Demons Come to Play10.1093/obo/9780195399318-0071Drama and Ritual of Early Hinduism"In the Shadow of Hollywood Orientalism: Authentic East Indian Dancing"10.1080/08949460490274013Sanskrit Play Production in Ancient IndiaIndian Music: History and StructureBharata, the Nāṭyaśāstra233639306Table of Contents2238067286469807Dance In Indian Painting10.2307/32047833204783Kathakali Dance-Theatre: A Visual Narrative of Sacred Indian MimeIndian Classical Dance: The Renaissance and BeyondKathakali: an indigenous art-form of Keralaeee

Method to test if a number is a perfect power? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Detecting perfect squares faster than by extracting square rooteffective way to get the integer sequence A181392 from oeisA rarely mentioned fact about perfect powersHow many numbers such $n$ are there that $n<100,lfloorsqrtn rfloor mid n$Check perfect squareness by modulo division against multiple basesFor what pair of integers $(a,b)$ is $3^a + 7^b$ a perfect square.Do there exist any positive integers $n$ such that $lfloore^nrfloor$ is a perfect power? What is the probability that one exists?finding perfect power factors of an integerProve that the sequence contains a perfect square for any natural number $m $ in the domain of $f$ .Counting Perfect Powers