{"id":361943,"date":"2024-05-21T01:24:17","date_gmt":"2024-05-21T01:24:17","guid":{"rendered":"http:\/\/savepearlharbor.com\/?p=361943"},"modified":"-0001-11-30T00:00:00","modified_gmt":"2024-05-21T01:24:17","slug":"","status":"publish","type":"post","link":"https:\/\/savepearlharbor.com\/?p=361943","title":{"rendered":"<span>Why x^0 = 1 visually<\/span>"},"content":{"rendered":"<div><!--[--><!--]--><\/div>\n<div id=\"post-content-body\">\n<div>\n<div class=\"article-formatted-body article-formatted-body article-formatted-body_version-2\">\n<div xmlns=\"http:\/\/www.w3.org\/1999\/xhtml\">\n<p>The traditional definition for the operation of exponentiation to a natural power (or a positive integer) had introduced approximately as follows:<\/p>\n<blockquote>\n<p><a href=\"https:\/\/en.wikipedia.org\/wiki\/Exponentiation\" rel=\"noopener noreferrer nofollow\"><strong>Exponentiation<\/strong><\/a> is an arithmetic operation originally defined as <em>the result of multiple multiplications a number by itself<\/em>.<\/p>\n<\/blockquote>\n<p> At first glance, this definition is difficult to generalize for integer powers less than one  <\/p>\n<pre><code>    ... x^3  = x*x*x x^2  = x*x x^1  = x x^0  = ????? x^-1 = ?????     ...<\/code><\/pre>\n<p>but if we remember that the operation of multiplication has an inverse &#8212; division, then an extension arises for negative powers<\/p>\n<pre><code>    ... x^3  = x*x*x x^-3 = 1\/(x*x*x) = 1\/x\/x\/x     ...<\/code><\/pre>\n<p>therefore<\/p>\n<pre><code>    ... x^3  = x*x*x x^2  = x*x x^1  = x x^0  = ? x^-1 = 1\/x x^-2 = 1\/x\/x x^-3 = 1\/x\/x\/x     ...<\/code><\/pre>\n<p>But the question still remains open for <code>0<\/code>: on the one hand, in <code>?<\/code> place <code>1<\/code> fits, but on the other hand, this definition remains not entirely symmetrical for positive and negative values&#8230;<\/p>\n<p>Therefore, upon careful examination, it is quite natural to want to slightly modify and improve the original<\/p>\n<pre><code>    ... x^3  = 1*x*x*x x^2  = 1*x*x x^1  = 1*x x^0  = 1 x^-1 = 1\/x x^-2 = 1\/x\/x x^-3 = 1\/x\/x\/x     ...<\/code><\/pre>\n<p>In this representation, the definition seems to acquire harmony coupled with completeness:<\/p>\n<blockquote>\n<p><strong>Raising a number X to an integer power N<\/strong> is an arithmetic operation defined as <em>the result of multiple [<\/em><strong><em>N<\/em><\/strong><em> by mod times] multiplications or divisions <\/em><strong><em>one<\/em><\/strong><em> by number <\/em><strong><em>X<\/em><\/strong>.<\/p>\n<\/blockquote>\n<figure class=\"full-width\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/habrastorage.org\/r\/w1560\/getpro\/habr\/upload_files\/255\/b43\/5e2\/255b435e2b8c14791ef0c82246fa05c1.png\" alt=\"\u0425\u043e\u0434 \u043c\u044b\u0441\u043b\u0435\u0439\" title=\"The way of thinking\" width=\"740\" height=\"440\" data-src=\"https:\/\/habrastorage.org\/getpro\/habr\/upload_files\/255\/b43\/5e2\/255b435e2b8c14791ef0c82246fa05c1.png\"\/><\/p>\n<div><figcaption>The way of thinking<\/figcaption><\/div>\n<\/figure>\n<p><a href=\"https:\/\/sharplab.io\/#v2:C4LgTgrgdgNAJiA1AHwAICYCMBYAUH1TATgAoAiQgAgEkBbABwBsBTW5qYAQ2AEsB7KGQCUAbjx4AZnzCUSAN04yelALyUADCMrKAPJQDMWnokRC8AbzyVrlQqVFWbdkgBIy5ngF8AeiQC06EKqlOYAstwAFgB0AAp8AO4kPDCUAUKewmK4NrbEru5evn6YQWphkbEJSSnF6ZmO1s5uHj4k6qUh4cDRcYnJGnUO2U55zYUkJcHl3ZV9KSUZQzlNBa2BU109Vf2Bi1me4rjOQwR5ZADCEADOwHy0NAwsbBzc\/IInuFIy8orawZp\/PSGbQmMy4SzDRp5JYjUhjVppKa9aqpXb1SG5OGrIqTMrI\/q1PYNTH5Fq+dpI7YpdpEjErMkTDrmfHzQZZZajbEkdZ4qmUNFDA74I6YABslDgfAgACMWJRkZKZXKAB4pHgcSj0BIpRWy5iUK7MZhwYKYOBgiE5BQyBSMCD6tSG43smzEngSWRa+KUPTtYk5L6ya1\/NQA5QAPk1CSMfj8QVt9soAHo1MqXdZmIxDf6bIGfkp\/kYfVH4kZQZQE\/qAFSp9OUYmoADsFc4duY+yAA=\" rel=\"noopener noreferrer nofollow\">A slightly more general case*<\/a> in programming language C#<\/p>\n<pre><code class=\"cs\">static double Pow(double x, int pow, double seed = 1d) {     var value = seed;          if (pow &lt; 0)         for (var i = 0; i > pow; i--) value \/= x;     else         for (var i = 0; i &lt; pow; i++) value *= x;          return value; }<\/code><\/pre>\n<p><em> * in a general case the <\/em><code>seed<\/code><em> may be different from <\/em><code>1<\/code><\/p>\n<p>In this form, the definition can easily and naturally be extended to the case of <code>0^0<\/code>, which has long been the subject of heated debate in the mathematical community.<\/p>\n<p>It naturally follows from this that <code>0^0 = 1<\/code>.<\/p>\n<p>Indeed, if we never multiply one by zero, then the result will be the original <code>1<\/code>, but if we multiply it even once, we will already get <code>0<\/code>.<\/p>\n<hr\/>\n<p>If you think about it carefully, it is impossible to strictly prove the identity <code>X^0 = 1<\/code>, and the reason is that we ourselves define functions in such a way that they have properties convenient for applied calculations.<\/p>\n<p>That is, when trying to prove the identity <code>X^0 = 1<\/code> using various methods, in fact, we are only demonstrating that we have defined the exponentiation function in precisely such a way as to have those specified useful properties through which the \u201cproof\u201d itself is carried out. That is, an implicit vicious circle arises.<\/p>\n<p>To the question:<\/p>\n<ul>\n<li>\n<p>Why is <code>X^0 = 1<\/code>?<\/p>\n<\/li>\n<\/ul>\n<p>The honest answer is:<\/p>\n<ul>\n<li>\n<p><code>X^0 = 1<\/code> is by definition!<\/p>\n<\/li>\n<\/ul>\n<p>Here it is appropriate to ask:<\/p>\n<ul>\n<li>\n<p>But why was this definition chosen?<\/p>\n<\/li>\n<\/ul>\n<p>To which an acceptable answer:<\/p>\n<ul>\n<li>\n<p>Because it is harmonious in many ways (see illustrations above) and has a number of remarkable properties that are very relevant in practical calculations.<\/p>\n<\/li>\n<\/ul>\n<p>If, say, we define <code>X^0<\/code> differently, then the property of multiplying powers with identical bases <code>X^M * X^N = X^(M+N)<\/code> (namely <code>X^0 * X^N = X^N<\/code>) will partially break down, which will only complicate calculations without any meaningful value.  <\/p>\n<hr\/>\n<p>Similarly, it is easy to consider the integer multiplication function through addition and subtraction with zero-based seed<\/p>\n<pre><code>    ... x*3  = 0 + x + x + x x*2  = 0 + x + x x*1  = 0 + x x*0  = 0 x*-1 = 0 - x x*-2 = 0 - x - x x*-3 = 0 - x - x - x     ...<\/code><\/pre>\n<pre><code class=\"cs\">static double Mul(double x, int scale, double seed = 0d) {     var value = seed;          if (pow &lt; 0)         for (var i = 0; i > scale; i--) value -= x;     else         for (var i = 0; i &lt; scale; i++) value += x;          return value; } <\/code><\/pre>\n<blockquote>\n<p><strong>Multiplying a number X to an integer number N<\/strong> is an arithmetic operation defined as <em>the result of multiple [<\/em><strong><em>N<\/em><\/strong><em> by mod times] additions or subtractions <\/em><strong><em>one<\/em><\/strong><em> by number <\/em><strong><em>X<\/em><\/strong>.  <\/p>\n<\/blockquote>\n<p>The identity <code>X*0 = 0<\/code> follows organically from the definition.<\/p>\n<p>In fact, if you don\u2019t add anything to zero and don\u2019t subtract anything from zero, then <code>0<\/code> will eventually remain!<\/p>\n<p>You can even look at the functions of addition and subtraction in a similar way through the functions of increment and decrement, but the number itself will act as the seed.<\/p>\n<p>Addition<\/p>\n<pre><code>    ... x +  3  = x + 1 + 1 + 1 x +  2  = x + 1 + 1 x +  1  = x + 1 x +  0  = x x +(-1) = x - 1 x +(-2) = x - 1 - 1 x +(-3) = x - 1 - 1 - 1     ...<\/code><\/pre>\n<pre><code class=\"cs\">static double Add(double x, int shift) {     var value = x;          if (pow &lt; 0)         for (var i = 0; i > shift; i--) value -= 1;     else         for (var i = 0; i &lt; shift; i++) value += 1;          return value; } <\/code><\/pre>\n<p> Subtraction<\/p>\n<pre><code>    ... x -  3  = x - 1 - 1 - 1 x -  2  = x - 1 - 1 x -  1  = x - 1 x -  0  = x x -(-1) = x + 1 x -(-2) = x + 1 + 1 x -(-3) = x + 1 + 1 + 1     ...<\/code><\/pre>\n<pre><code class=\"cs\">static double Sub(double x, int shift) {     var value = x;          if (pow &lt; 0)         for (var i = 0; i > shift; i--) value += 1;     else         for (var i = 0; i &lt; shift; i++) value -= 1;          return value; }<\/code><\/pre>\n<p>And for completeness, we should remember the factorial function and redefine it for <code>0<\/code>. With negative arguments it becomes more difficult, since infinite products arise from the general formula, for which traditional calculation methods are already largely undefined.<\/p>\n<pre><code>n!  = 1 * [(n - 0)(n - 1)(n - 2)...321]<\/code><\/pre>\n<pre><code>    ... 3!  = 1 * (321) 2!  = 1 * (2*1) 1!  = 1 * (1) 0!  = 1     ...<\/code><\/pre>\n<hr\/>\n<p>Thanks for reading! <\/p>\n<p>Hope that considered examples will help to the reader become familiar with the identity <code>X^0 = 1<\/code>.<\/p>\n<hr\/>\n<p>MIRRORS OF THE ARTICLE<\/p>\n<p>EN: <a href=\"https:\/\/gitlab.com\/Makeloft-Studio\/Rainbow\/-\/wikis\/WHY-X%5E0-=-1-VISUALLY\" rel=\"noopener noreferrer nofollow\">gitlab<\/a>, <a href=\"https:\/\/habr.com\/ru\/articles\/778212\/\" rel=\"noopener noreferrer nofollow\">habr<\/a><\/p>\n<p>RU: <a href=\"https:\/\/gitlab.com\/Makeloft-Studio\/Rainbow\/-\/wikis\/%D0%9F%D0%9E%D0%A7%D0%95%D0%9C%D0%A3-X%5E0-=-1-%D0%9D%D0%90%D0%93%D0%9B%D0%AF%D0%94%D0%9D%D0%9E\" rel=\"noopener noreferrer nofollow\">gitlab<\/a>, <a href=\"https:\/\/habr.com\/ru\/articles\/778198\/\" rel=\"noopener noreferrer nofollow\">habr<\/a><\/p>\n<\/p>\n<\/div>\n<\/div>\n<\/div>\n<p><!----><!----><\/div>\n<p><!----><!----><br \/> \u0441\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u043e\u0440\u0438\u0433\u0438\u043d\u0430\u043b \u0441\u0442\u0430\u0442\u044c\u0438 <a href=\"https:\/\/habr.com\/ru\/articles\/778212\/\"> https:\/\/habr.com\/ru\/articles\/778212\/<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<div><!--[--><!--]--><\/div>\n<div id=\"post-content-body\">\n<div>\n<div class=\"article-formatted-body article-formatted-body article-formatted-body_version-2\">\n<div xmlns=\"http:\/\/www.w3.org\/1999\/xhtml\">\n<p>The traditional definition for the operation of exponentiation to a natural power (or a positive integer) had introduced approximately as follows:<\/p>\n<blockquote>\n<p><a href=\"https:\/\/en.wikipedia.org\/wiki\/Exponentiation\" rel=\"noopener noreferrer nofollow\"><strong>Exponentiation<\/strong><\/a> is an arithmetic operation originally defined as <em>the result of multiple multiplications a number by itself<\/em>.<\/p>\n<\/blockquote>\n<p> At first glance, this definition is difficult to generalize for integer powers less than one  <\/p>\n<pre><code>    ... x^3  = x*x*x x^2  = x*x x^1  = x x^0  = ????? x^-1 = ?????     ...<\/code><\/pre>\n<p>but if we remember that the operation of multiplication has an inverse &#8212; division, then an extension arises for negative powers<\/p>\n<pre><code>    ... x^3  = x*x*x x^-3 = 1\/(x*x*x) = 1\/x\/x\/x     ...<\/code><\/pre>\n<p>therefore<\/p>\n<pre><code>    ... x^3  = x*x*x x^2  = x*x x^1  = x x^0  = ? x^-1 = 1\/x x^-2 = 1\/x\/x x^-3 = 1\/x\/x\/x     ...<\/code><\/pre>\n<p>But the question still remains open for <code>0<\/code>: on the one hand, in <code>?<\/code> place <code>1<\/code> fits, but on the other hand, this definition remains not entirely symmetrical for positive and negative values&#8230;<\/p>\n<p>Therefore, upon careful examination, it is quite natural to want to slightly modify and improve the original<\/p>\n<pre><code>    ... x^3  = 1*x*x*x x^2  = 1*x*x x^1  = 1*x x^0  = 1 x^-1 = 1\/x x^-2 = 1\/x\/x x^-3 = 1\/x\/x\/x     ...<\/code><\/pre>\n<p>In this representation, the definition seems to acquire harmony coupled with completeness:<\/p>\n<blockquote>\n<p><strong>Raising a number X to an integer power N<\/strong> is an arithmetic operation defined as <em>the result of multiple [<\/em><strong><em>N<\/em><\/strong><em> by mod times] multiplications or divisions <\/em><strong><em>one<\/em><\/strong><em> by number <\/em><strong><em>X<\/em><\/strong>.<\/p>\n<\/blockquote>\n<figure class=\"full-width\">\n<div><figcaption>The way of thinking<\/figcaption><\/div>\n<\/figure>\n<p><a href=\"https:\/\/sharplab.io\/#v2:C4LgTgrgdgNAJiA1AHwAICYCMBYAUH1TATgAoAiQgAgEkBbABwBsBTW5qYAQ2AEsB7KGQCUAbjx4AZnzCUSAN04yelALyUADCMrKAPJQDMWnokRC8AbzyVrlQqVFWbdkgBIy5ngF8AeiQC06EKqlOYAstwAFgB0AAp8AO4kPDCUAUKewmK4NrbEru5evn6YQWphkbEJSSnF6ZmO1s5uHj4k6qUh4cDRcYnJGnUO2U55zYUkJcHl3ZV9KSUZQzlNBa2BU109Vf2Bi1me4rjOQwR5ZADCEADOwHy0NAwsbBzc\/IInuFIy8orawZp\/PSGbQmMy4SzDRp5JYjUhjVppKa9aqpXb1SG5OGrIqTMrI\/q1PYNTH5Fq+dpI7YpdpEjErMkTDrmfHzQZZZajbEkdZ4qmUNFDA74I6YABslDgfAgACMWJRkZKZXKAB4pHgcSj0BIpRWy5iUK7MZhwYKYOBgiE5BQyBSMCD6tSG43smzEngSWRa+KUPTtYk5L6ya1\/NQA5QAPk1CSMfj8QVt9soAHo1MqXdZmIxDf6bIGfkp\/kYfVH4kZQZQE\/qAFSp9OUYmoADsFc4duY+yAA=\" rel=\"noopener noreferrer nofollow\">A slightly more general case*<\/a> in programming language C#<\/p>\n<pre><code class=\"cs\">static double Pow(double x, int pow, double seed = 1d) {     var value = seed;          if (pow &lt; 0)         for (var i = 0; i > pow; i--) value \/= x;     else         for (var i = 0; i &lt; pow; i++) value *= x;          return value; }<\/code><\/pre>\n<p><em> * in a general case the <\/em><code>seed<\/code><em> may be different from <\/em><code>1<\/code><\/p>\n<p>In this form, the definition can easily and naturally be extended to the case of <code>0^0<\/code>, which has long been the subject of heated debate in the mathematical community.<\/p>\n<p>It naturally follows from this that <code>0^0 = 1<\/code>.<\/p>\n<p>Indeed, if we never multiply one by zero, then the result will be the original <code>1<\/code>, but if we multiply it even once, we will already get <code>0<\/code>.<\/p>\n<hr\/>\n<p>If you think about it carefully, it is impossible to strictly prove the identity <code>X^0 = 1<\/code>, and the reason is that we ourselves define functions in such a way that they have properties convenient for applied calculations.<\/p>\n<p>That is, when trying to prove the identity <code>X^0 = 1<\/code> using various methods, in fact, we are only demonstrating that we have defined the exponentiation function in precisely such a way as to have those specified useful properties through which the \u201cproof\u201d itself is carried out. That is, an implicit vicious circle arises.<\/p>\n<p>To the question:<\/p>\n<ul>\n<li>\n<p>Why is <code>X^0 = 1<\/code>?<\/p>\n<\/li>\n<\/ul>\n<p>The honest answer is:<\/p>\n<ul>\n<li>\n<p><code>X^0 = 1<\/code> is by definition!<\/p>\n<\/li>\n<\/ul>\n<p>Here it is appropriate to ask:<\/p>\n<ul>\n<li>\n<p>But why was this definition chosen?<\/p>\n<\/li>\n<\/ul>\n<p>To which an acceptable answer:<\/p>\n<ul>\n<li>\n<p>Because it is harmonious in many ways (see illustrations above) and has a number of remarkable properties that are very relevant in practical calculations.<\/p>\n<\/li>\n<\/ul>\n<p>If, say, we define <code>X^0<\/code> differently, then the property of multiplying powers with identical bases <code>X^M * X^N = X^(M+N)<\/code> (namely <code>X^0 * X^N = X^N<\/code>) will partially break down, which will only complicate calculations without any meaningful value.  <\/p>\n<hr\/>\n<p>Similarly, it is easy to consider the integer multiplication function through addition and subtraction with zero-based seed<\/p>\n<pre><code>    ... x*3  = 0 + x + x + x x*2  = 0 + x + x x*1  = 0 + x x*0  = 0 x*-1 = 0 - x x*-2 = 0 - x - x x*-3 = 0 - x - x - x     ...<\/code><\/pre>\n<pre><code class=\"cs\">static double Mul(double x, int scale, double seed = 0d) {     var value = seed;          if (pow &lt; 0)         for (var i = 0; i > scale; i--) value -= x;     else         for (var i = 0; i &lt; scale; i++) value += x;          return value; } <\/code><\/pre>\n<blockquote>\n<p><strong>Multiplying a number X to an integer number N<\/strong> is an arithmetic operation defined as <em>the result of multiple [<\/em><strong><em>N<\/em><\/strong><em> by mod times] additions or subtractions <\/em><strong><em>one<\/em><\/strong><em> by number <\/em><strong><em>X<\/em><\/strong>.  <\/p>\n<\/blockquote>\n<p>The identity <code>X*0 = 0<\/code> follows organically from the definition.<\/p>\n<p>In fact, if you don\u2019t add anything to zero and don\u2019t subtract anything from zero, then <code>0<\/code> will eventually remain!<\/p>\n<p>You can even look at the functions of addition and subtraction in a similar way through the functions of increment and decrement, but the number itself will act as the seed.<\/p>\n<p>Addition<\/p>\n<pre><code>    ... x +  3  = x + 1 + 1 + 1 x +  2  = x + 1 + 1 x +  1  = x + 1 x +  0  = x x +(-1) = x - 1 x +(-2) = x - 1 - 1 x +(-3) = x - 1 - 1 - 1     ...<\/code><\/pre>\n<pre><code class=\"cs\">static double Add(double x, int shift) {     var value = x;          if (pow &lt; 0)         for (var i = 0; i > shift; i--) value -= 1;     else         for (var i = 0; i &lt; shift; i++) value += 1;          return value; } <\/code><\/pre>\n<p> Subtraction<\/p>\n<pre><code>    ... x -  3  = x - 1 - 1 - 1 x -  2  = x - 1 - 1 x -  1  = x - 1 x -  0  = x x -(-1) = x + 1 x -(-2) = x + 1 + 1 x -(-3) = x + 1 + 1 + 1     ...<\/code><\/pre>\n<pre><code class=\"cs\">static double Sub(double x, int shift) {     var value = x;          if (pow &lt; 0)         for (var i = 0; i > shift; i--) value += 1;     else         for (var i = 0; i &lt; shift; i++) value -= 1;          return value; }<\/code><\/pre>\n<p>And for completeness, we should remember the factorial function and redefine it for <code>0<\/code>. With negative arguments it becomes more difficult, since infinite products arise from the general formula, for which traditional calculation methods are already largely undefined.<\/p>\n<pre><code>n!  = 1 * [(n - 0)(n - 1)(n - 2)...321]<\/code><\/pre>\n<pre><code>    ... 3!  = 1 * (321) 2!  = 1 * (2*1) 1!  = 1 * (1) 0!  = 1     ...<\/code><\/pre>\n<hr\/>\n<p>Thanks for reading! <\/p>\n<p>Hope that considered examples will help to the reader become familiar with the identity <code>X^0 = 1<\/code>.<\/p>\n<hr\/>\n<p>MIRRORS OF THE ARTICLE<\/p>\n<p>EN: <a href=\"https:\/\/gitlab.com\/Makeloft-Studio\/Rainbow\/-\/wikis\/WHY-X%5E0-=-1-VISUALLY\" rel=\"noopener noreferrer nofollow\">gitlab<\/a>, <a href=\"https:\/\/habr.com\/ru\/articles\/778212\/\" rel=\"noopener noreferrer nofollow\">habr<\/a><\/p>\n<p>RU: <a href=\"https:\/\/gitlab.com\/Makeloft-Studio\/Rainbow\/-\/wikis\/%D0%9F%D0%9E%D0%A7%D0%95%D0%9C%D0%A3-X%5E0-=-1-%D0%9D%D0%90%D0%93%D0%9B%D0%AF%D0%94%D0%9D%D0%9E\" rel=\"noopener noreferrer nofollow\">gitlab<\/a>, <a href=\"https:\/\/habr.com\/ru\/articles\/778198\/\" rel=\"noopener noreferrer nofollow\">habr<\/a><\/p>\n<\/p>\n<\/div>\n<\/div>\n<\/div>\n<p><!----><!----><\/div>\n<p><!----><!----><br \/> \u0441\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u043e\u0440\u0438\u0433\u0438\u043d\u0430\u043b \u0441\u0442\u0430\u0442\u044c\u0438 <a href=\"https:\/\/habr.com\/ru\/articles\/778212\/\"> https:\/\/habr.com\/ru\/articles\/778212\/<\/a><br \/><\/br><\/br><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-361943","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/361943","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=361943"}],"version-history":[{"count":0,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/361943\/revisions"}],"wp:attachment":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=361943"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=361943"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=361943"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}