tag:blogger.com,1999:blog-111191102017-10-16T14:56:21.998-04:00Some MathGlobal resource of innovative mathematical ideas.James Harrishttps://plus.google.com/104012861017102472975noreply@blogger.comBlogger269125tag:blogger.com,1999:blog-11119110.post-90585151718966056662017-10-16T09:41:00.001-04:002017-10-16T09:53:14.874-04:00Notice to governmentsHave come across a problem in mathematics in an important prestigious field, which is number theory. And was able to <a href="http://somemath.blogspot.com/2013/02/publishing-contradiction.html" target="_blank">demonstrate with publication</a> in a formally peer reviewed mathematical journal. The problem is severe enough that the response from the mathematical community was to avoid, including that the chief editor tried to delete the paper out of the electronic publication.<br /><br />What I did was show that you can present a mathematical argument, correct under ALL mathematical rules established, which gives an incorrect conclusion.<br /><br />That was back in 2004. When the mathematical community did not act with the appropriate response realized had a bigger problem and endeavored since then to verify my own argument, and was able to so do with secondary means. I found <a href="http://somemath.blogspot.com/2015/11/non-polynomial-factorization-short.html" target="_blank">another way</a> to prove the same thing.<br /><br />Relevance to national governments: <i>mathematicians working for you who are number theorists may not be actually qualified for their positions. This problem can allow them to have invalid research which appears correct by established measures.</i><br /><br />You can check. These people are NOT actually effective, of course. But with a problem that has been in the field since the late 1800's they have <i>built a support structure</i> around themselves.<br /><br />They should not hold security clearances. They should not be relied upon for any mathematical research your government needs.<br /><br />It is your job as governments to determine when these things are true. Good luck.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-10430226182112298812017-10-16T09:21:00.000-04:002017-10-16T14:56:22.012-04:00When apparent success is easyMy own personal understanding of the implications of some of my discoveries is of course important to me, but also have begun to address more my global responsibility. And that global responsibility pushes more care and certainty, which can explain years in working through to be sure of the foundations. Which also worked out great for me, in making more discoveries.<br /><br />Now though can explain things rather simply, and is my duty to explain simply implications of one of my most important results, which only requires considering a general factorization in the complex plane:<br /><br />P(x) = (g<sub>1</sub>(x) + 1)(g<sub>2</sub>(x) + 2)<br /><br />where P(x) is a primitive quadratic with integer coefficients, g<sub>1</sub>(0) = g<sub>2</sub>(0) = 0, but g<sub>1</sub>(x) does not equal 0 for all x.<br /><br />It is trivial to be able to find the g's as algebraic integers, and then step beyond them to other numbers, which are also possible solutions for the g's, which cannot be fractions or like fractions in any way. Which are themselves integer-like, but not previously catalogued.<br /><br />However, mathematical arguments not recognizing this reality, can appear to prove things NOT true, while looking correct if this reality is ignored.<br /><br />That in mathematics, as most math students are usually taught, is a ticket to just about anything.<br /><br />You can with such a problem, potentially appear to prove whatever you want, and my suspicion, since this problem arrived in the late 1800's is that it lead to a shift in the mathematical field towards dominance by people who increasingly exploited it, whether they realized it or not.<br /><br />Human beings have a knack for finding easier success. Applied mathematicians of course would not be able to exploit it.<br /><br />If there were not some awareness then my publication of a contradiction back in 2004 would NOT have lead to a math journal imploding, but to a hue and cry, as mathematicians recognized the problem. Instead I've faced what I consider astute use of social things. But for instance, <a href="https://somemath.blogspot.com/2005/07/definition-of-mathematical-proof.html" target="_blank">my post</a> giving first a functional definition of mathematical proof, and later updated with a formalized one, was a reaction to mathematicians in the press, diminishing mathematical proof.<br /><br />There IS a lot of naive I think especially in academic circles with mathematicians who grew up before the web about how well these stories travel. And have been curious about some of the things I suspect or think I notice that are being tried. With a relentless look to the press from certain people with relief as if that is all that matters.<br /><br />But I do not need the press. Wouldn't mind their help, but don't have to have it.<br /><br />My duty is to the discipline. Am stepping carefully as I lock down understanding. And my decisions will follow.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-40525178791256322712017-10-15T10:39:00.000-04:002017-10-15T10:39:51.236-04:00Sum two squares and 5Used my BQD Iterator to highlight the basic result that EVERY power of 10 can be written as sum of two squares, where noticed the squares were even, after the first one where had to use the trivial result that 1 is a square. Well got to wondering--what if divide those powers of 2 off? Here is the result:<br /><br /><b>4<sup>2</sup> + 3<sup>2</sup> = 5<sup>2</sup></b><br /><br /><b>13<sup>2</sup> + 9<sup>2</sup> = 2(5<sup>3</sup>)</b><br /><br /><b>7<sup>2</sup> + 24<sup>2</sup> = 5<sup>4</sup></b><br /><br /><b>79<sup>2</sup> + 3<sup>2</sup> = 2(5<sup>5</sup>)</b><br /><br /><b>44<sup>2</sup> + 117<sup>2</sup> = 5<sup>6</sup></b><br /><br /><b>307<sup>2</sup> + 249<sup>2</sup> = 2(5<sup>7</sup>)</b><br /><br />Here's the full original list for two squares to powers of 10:<br /><br /><b>1<sup>2</sup> + 3<sup>2</sup> = 10</b><br /><br /><b>8<sup>2</sup> + 6<sup>2</sup> = 10<sup>2</sup></b><br /><br /><b>26<sup>2</sup> + 18<sup>2</sup> = 10<sup>3</sup></b><br /><br /><b>28<sup>2</sup> + 96<sup>2</sup> = 10<sup>4</sup></b><br /><br /><b>316<sup>2</sup> + 12<sup>2</sup> = 10<sup>5</sup></b><br /><br /><b>352<sup>2</sup> + 936<sup>2</sup> = 10<sup>6</sup></b><br /><br /><b>2456<sup>2</sup> + 1992<sup>2</sup> = 10<sup>7</sup></b>James Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-66856161833363066412017-10-14T07:17:00.000-04:002017-10-15T07:44:38.749-04:00More power 10 sum two squaresFrom my research is now known that every power of 10 can be written as the sum of two squares. Which I think is cool. Thought would post more about it. From last iteration given in my <a href="http://somemath.blogspot.com/2017/08/sum-two-squares-to-power-of-10.html" target="_blank">previous post on subject</a> I have:<br /><br /><b>316<sup>2</sup> + 12<sup>2</sup> = 10<sup>5</sup></b><br /><br />Where have the rule, from my BQD Iterator.<br /><br />If: u<sup>2</sup> + 9v<sup>2</sup> = 10<sup>a</sup><br /><br />Then: (u - 9v)<sup>2</sup> + 9(u + v)<sup>2</sup> = 10<sup>a+1</sup><br /><br />Noticed that 316, which is an approximation of sqrt(10) times 100, and figure is because other square happened to be small, so am curious, about 10<sup>7</sup> now.<br /><br />So will do two more iterations. And can use u = 316 or -316, and v = 4 or -4, so will fiddle with things, which I did. Of course just showing what I decided works ok for my purposes.<br /><br />(352)<sup>2</sup> + 9(312)<sup>2</sup> = 10<sup>6</sup><br /><br />Which is: <b>352<sup>2</sup> + 936<sup>2</sup> = 10<sup>6</sup></b><br /><br />Next will use u = 352, and v = 312:<br /><br />(-2456)<sup>2</sup> + 9(664)<sup>2</sup> = 10<sup>7</sup><br /><br />Which is: <b>2456<sup>2</sup> + 1992<sup>2</sup> = 10<sup>7</sup></b><br /><br />And didn't go way I thought it might. Had to fiddle with signs and deliberately trying to get a small square again, just ended up getting both sides multiplied by 100. Math does not care what I want. It is interesting to see the math adjust to what you TRY to get it to do. That sense of the math is something. Like there is this intelligence, which I guess, yes it is. It is just perfectly logical.<br /><br />Guessing though if kept going would find cases where with odd exponent for 10, would again see an approximation of square root of 10 in there. Well, curiosity is satisfied, for now.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-70343786518322272812017-10-12T07:33:00.000-04:002017-10-12T14:29:19.264-04:00When explanation rulesWith over 13 years to consider since <a href="http://somemath.blogspot.com/2013/02/publishing-contradiction.html" target="_blank">publication of my paper</a> is not surprising have well-worked explanations now for significance.<br /><br />What I discovered is if you start by declaring the ring of algebraic integers, have a beginning statement in that ring and take valid algebraic steps from it, you can still reach a conclusion--not true in the ring of algebraic integers!!! Which I now say is like, declaring evens and then dividing 6 by 2 to get 3.<br /><br />It is a coverage problem, which reveals finally after more than a century since was first believed that roots of monic polynomials with integer coefficients could encapsulate ALL integer-like number that mathematics had remained more subtle than many realized.<br /><br />My original argument relied on a cubic, but simplified to a quadratic with same result. And even better, found a different path to the same conclusion with the generalized factorization in the complex plane:<br /><br />P(x) = (g<sub>1</sub>(x) + 1)(g<sub>2</sub>(x) + 2)<br /><br />where P(x) is a primitive quadratic with integer coefficients, g<sub>1</sub>(0) = g<sub>2</sub>(0) = 0, but g<sub>1</sub>(x) does not equal 0 for all x.<br /><br />Being able to go to the field of complex numbers removed needing to worry about problems with ring of algebraic integers, and definitively reveals the same conclusions as before. A key post is <a href="http://somemath.blogspot.com/2015/11/non-polynomial-factorization-short.html" target="_blank">here</a> which steps through the short argument.<br /><br />So two paths revealing something easily explained in a paragraph, and so much drama around the result, back in 2004. From an academic perspective, with the logical conclusion that NO paper should be declared in the ring of algebraic integers, would guess is a nightmare. Brings into question any mathematical paper declared in that ring. But am NOT an academic. Am a mathematical discoverer, but not a mathematician. So have certain dispassion there.<br /><br />Is not my only discovery where there has been a sad delay either. Also over a decade ago found a simple approach to counting prime numbers, talk it a lot on the blog, but discuss things fully <a href="https://somemath.blogspot.com/2012/11/differential-equation-and-prime-counting.html" target="_blank">here</a>, which will reference for this post, giving key points. And my approach tweaks older ideas giving a vastly simpler sieve form:<br /><br class="Apple-interchange-newline" />P(x,n) = [x] - 1 - sum for j=1 to n of {P([x/p_j],j-1) - (j-1)}<br /><br />where if n is greater than the count of primes up to and including sqrt(x) then n is reset to that count.<br /><br />But more importantly, the fully mathematized form relies on a difference equation, from which a partial differential equation is readily found. But to make the summation with the difference equation give the correct prime count it has to be limited. You have to deliberately stop it from going to primes above sqrt(x), which of course goes away with the continuous function!<br /><br class="Apple-interchange-newline" />P'<sub>y</sub>(x,y) = -(P(x/y,y) - P(y, sqrt(y))) P'(y, sqrt(y))<br /><br />And our connection between the count of prime numbers and a differential form is complete.<br /><br />Since with the continuous function you're no longer stopping it deliberately, it would keep going, subtracting more, and have a REASON for lagging the count of primes.<br /><br />And that is what's seen with what we can assume are approximations, with x/ln x, for instance 100/ln 100 equals approximately 21.71, which lags behind the prime count of 25. And 1000/ln 1000 is approximately 144.76 which lags behind the count of primes up to 1000, which is 168. Guessing then it would never catch it.<br /><br />Does help to be curious though. Am not talking things fresh here, but things have been talking for YEARS. And I wanted to talk both cases because earlier mathematicians had something important--curiousity.<br /><br />They weren't looking for some way to pursue an academic career.<br /><br />There was a time when mathematicians were hungry for knowledge.<br /><br />They were people who really wanted to know things like, how do you cover all integer-like numbers? Gauss had intrigued them with a+bi where 'a' and 'b' are integers. How far could you go? And they DID try. Just turns out mathematics can be wonderfully subtle. Took doing some things different to figure out what I did.<br /><br />And with prime numbers, Euler, Gauss and yes, Riemann among others <i>were curious</i>!!!<br /><br />They wondered WHY prime counts could possibly have this seeming connection with continuous functions.<br /><br />And now we know. Our people in our times have known for years now.<br /><br />But I guess there is no academic career potential there for others, or things would have gone differently, eh? I disdain such things. So what good is the knowledge then, to the modern mathematician?<br /><br />Where did that basic curiosity go?<br /><br />Could talk more things, but feel like have made my point. That I could fill this post with more major discoveries is simply further indictment of a system that lost its way. When mathematicians forgot that the point, is in discovery.<br /><br />I love discovery. The people who do? Will always be the ones who move things forward, for a planet of humans, who need knowledge.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-4359187018943225392017-10-10T07:13:00.001-04:002017-10-10T08:28:38.644-04:00Sharing knowledge benefitFound myself finally citing my own paper proudly and has been a journey of over a decade from that wild story around my one publication, to being able to talk confidently the value of publication as did in a <a href="http://somemath.blogspot.com/2017/10/publication-does-matter.html" target="_blank">recent post</a>.<br /><br />There I noted that in sharing truths, we open opportunity to find greater truths.<br /><br />Of course a person could share for recognition, and readily note that some might think I do, when in the past yeah, maybe more so than now, as I got it. Why push harder for what I already have?<br /><br />If you think I do not, then you may be looking to certain members of the mathematical community, whom I think <a href="http://somemath.blogspot.com/2017/10/some-consequences.html" target="_blank">may be dedicated to hiding a flaw</a> that may mean they shouldn't actually be considered mathematicians.<br /><br />Um, why would I expect recognition from them or care if I got it? Oh, power of a position, maybe?<br /><br />And I did realize that yes, people may be looking at the POSITION even if informed that the person in the position may be behaving a certain way because the truth would remove the position. To me is like a Catch-22 and years ago I shied away from it, and did a mental shrug.<br /><br />And as for objective evidence, so far last 7 days according to Google Analytics have had visits from 13 countries. US is main one, and not going to list the rest. There is just a constant of countries for me for about a decade. First noticed 2007? Or 2008? And not just for this blog either.<br /><br />Can watch that jump when I have a new major discovery. Which has happened enough times over around a decade is not remarkable for me. Didn't even bother to closely watch this time with my latest, figuring out my own way to calculate the modular inverse. So no, no problem with recognition.<br /><br />Oh, does give me the advantage can simply share math things here. Have the reach of a major journal, without the hassles.<br /><br />Is weird actually. Word I also like to use for how have felt often is, unsettled. Global attention is something you have to learn to process.<br /><br />People look to the establishment next though, am sure. So I get the recognition all over the globe can watch in web stats, but just not the official from a handful of people I don't think much of anyway.<br /><br />The web is the new thing that helped me so much, but so much still is being learned, and I can see web stats where others can just see a quiet blog. Which I like.<br /><br />Sharing for opportunity to learn more though is a concept that has inspired me. Yes, have been sharing that way for some time but hadn't written it out, just that way.<br /><br />We know what we know as humans because of knowledge shared. And now I take it less for granted than I did before.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-67925269244672040832017-10-09T08:21:00.000-04:002017-10-10T08:31:02.913-04:00Five months since modular inverse discoveryNo doubt my discovery of a third primary way to find the modular inverse, where other two have Euclid's name on one and Euler's on the other, impacted my thinking. And was a surprise for me as had decided to end my basic research phase, well satisfied with how things had gone.<br /><br />Here's the post, though have put it up quite a bit since then: <a href="http://somemath.blogspot.com/2017/05/modular-inverse-innovation.html" target="_blank">Modular inverse innovation</a><br /><br />That THRILL of discovery is hard to describe. And I realized that yeah, society does believe that researchers in a field know and have it with discoveries in their area. And is very motivating, I assure you.<br /><br />But what if you don't have it?<br /><br />Well, my guess is, you will find it hard to understand, what you do not know.<br /><br />For some who may think they are mathematical discoverers, like me, math is about recognition from peers, and is a social experience <i>only</i>.<br /><br />For me though will not contain my enthusiasm as yeah, still excited over it. At times just ponder, and wonder.<br /><br />Shows value of a great math education--where guess mine was better than I realized till recently--where smart teachers let young people discover things along the way, versus just dictating knowledge to them.<br /><br />The thrill of discovery is amazing. Those who have it? Just wish all to feel it who can.<br /><br />I have MY own way to calculate the modular inverse.<br /><br />When you feel that thrill, yeah is motivating. Can be addictive too.<br /><br />That perspective is helping me more as shift from a more competitive view, and realize DO need to help others understand that potential.<br /><br />What can YOU discover? The math is there to find. Believe that.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-89486881748125448522017-10-08T07:41:00.003-04:002017-10-08T07:46:27.677-04:00Publication does matterMuch easier to talk value of publication in a peer reviewed mathematical journal now, versus over a decade ago, when I was published in what I like to call a wacky story. The chief editor tried to literally pull the paper after publication by simply deleting out from the electronic file, and <a href="https://www.emis.de/journals/SWJPAM/vol2-03.html" target="_blank">claimed it was withdrawn</a>, when I never withdrew it.<br /><br />The paper is "Advanced Polynomial Factorization", published in the Southwest Journal of Pure and Applied Mathematics, Issue 2, December 2003, pp. 6–8.<br /><nobr>Submitted: July 25, 2003. Published: December 31 2003</nobr><br /><nobr><br /></nobr><nobr>Copied from my post, where also is a link to paper: <a href="http://somemath.blogspot.com/2013/02/publishing-contradiction.html" target="_blank">Publishing a contradiction</a></nobr><br /><br />And EMIS simply put up a copy of my original, and is worth talking why publication matters which to me is NOT for recognition.<br /><br /><b>To me the value of publication is in sharing truths which open opportunity to finding greater truths.</b><br /><br />Where that opportunity is like an open door, and for me was a joy in going through it, where have simplified that original argument, gained a greater understanding of mathematics in the process, and found a path to even greater knowledge.<br /><br />We share best for each other, and human progress has occurred because of vast quantities of valuable shared information. That some person merely kept hidden away, which disintegrated in time never to be seen? Is not part of our shared human story. But that is a choice one can make.<br /><br />Maybe the reaction I got was telling, back then. Some howled in fury, maybe helping push that chief editor. Others decried the supposed horrible impact on the math discipline, oh horror, as if. And many dismissed the math journal process as a broken joke.<br /><br />So yeah, much easier to talk calmly and with objectivity, with experience, after over a decade. Math and emotion do not go well together, I like to say.<br /><br />When two anonymous reviewers--as the now defunct journal used two--did the right thing, looking at correctness over social implications. And EMIS has done the right thing, preserving information rather than putting on a social filter.<br /><br />And society is better for people who understand the value of process and opportunity given, rather than simply looking to take opportunity away.<br /><br />The math does not change, regardless.<br /><br />Share best for opportunity to learn more, in my opinion. And the journal process will do just fine, as long as keeps opening doors revealed from shared truths, to further greater knowledge.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-63454673199598208132017-10-07T11:37:00.000-04:002017-10-07T17:43:53.357-04:00Some consequencesSome of my research forces troubling conclusions with regard to mathematical community, especially number theorists, where is useful to step through relevant math again.<br /><br />For instance now have noted ability to determine much from a generalized factorization.<br /><br />In the complex plane:<br /><br />P(x) = (g<sub>1</sub>(x) + 1)(g<sub>2</sub>(x) + 2)<br /><br />where P(x) is a primitive quadratic with integer coefficients, g<sub>1</sub>(0) = g<sub>2</sub>(0) = 0, but g<sub>1</sub>(x) does not equal 0 for all x.<br /><br />And I went in the direction of multiplying both sides by some integer k, introducing new functions to gain symmetry, and showed could find those functions as algebraic integer roots:<br /><br />k*P(x) = (f<sub>1</sub>(x) + k)(f<sub>2</sub>(x) + k)<br /><br />Where show all in <a href="http://somemath.blogspot.com/2015/11/non-polynomial-factorization-short.html" target="_blank">this post</a>, but primary point is that in so doing, could prove a coverage problem with the ring of algebraic integers. And it's not even complicated. Is like if you SAY you only want to use evens, and then have a mathematical argument where you claim that 2 is coprime to 6, because you've excluded 3 which is odd. But of course that's specious, as SAYING to use only even numbers does not change the actual reality.<br /><br />Across number theory this problem may emerge if there is a claim of a unit factor in ring of algebraic integers. Where algebraically with a more complete ring, without this problem, that is clearly not the case. And I had a more complex argument showing the same thing with cubics and an entirely different approach which was published in a math journal. Talked a bit about <a href="http://somemath.blogspot.com/2015/08/my-math-paper-and-recent-discussion-here.html" target="_blank">here</a>.<br /><br />The problem of course is you may have some number theorist who may have research which is invalidated by this result, when he thought he had valuable contributions to human knowledge. And that could be key to his social status, I hypothesize. And maybe there were enough people like that where they decided to run from the math, and survive in their positions.<br /><br />Given the amount of time that has passed since I first pointed out the problem, with a published paper, where the journal chief editor tried to pull after publication and journal shut down, maybe he was one of them. And if were me, like to think I'd want the truth, but is not me. I'm the discoverer.<br /><br />Looking across human systems it actually would have been more remarkable if they'd accepted the truth. Which is kind of sad that what they did instead is not surprising, and is continuing.<br /><br />Of course you may have students being taught by people without real mathematical accomplishment, so how can they guide to any? And learning erroneous approaches which means can have invalid mathematical arguments on which they build their OWN careers, when house of cards will collapse eventually.<br /><br />Or, can simply say, best guess is an unknown number of these number theorists could be simply frauds. And it's not like they can teach what they do not know, you know? Discovery IS hard. The coverage problem gives an opening for people who might never experience that adulation, acceptance, and social status, any other way, because real mathematics can be just WAY hard.<br /><br />Also it's just sad. Have pointed to number authority recently as math can be very enjoyable, and satisfying with RESULTS where in number theory, yeah you can do cool things with real ones.<br /><br />Like check this out:<br /><br />(<b>92<sup>2</sup> + 96<sup>2</sup> + 144<sup>2</sup></b>)(<b>7048<sup>2</sup> + 688<sup>2</sup> + 1032<sup>2 </sup>+ 1720<sup>2 </sup>+ 2408<sup>2</sup></b>) = <b>p<sup>2</sup> + 1231</b><b>q<sup>2</sup></b><b> </b><br /><br />Where p = 1507976, and q = 4920 are solutions. And I actually relied on this result for a post about number examples I like to stare at, where post with it is, <a href="http://somemath.blogspot.com/2015/01/distinct-square-products.html" target="_blank">here</a>.<br /><br />Why does society allow deliberate and continuing error from powerful, influential people at high levels in very important positions?<br /><br />I think that is a GREAT question. Consequences are so HUGE. For me though? Not so much. I just kept discovering, after all. For the discoverer? Is just more information. Knowledge obtained.<br /><br />My place in history, after all, is guaranteed. Rest of you? Are competing for some kind of a place.<br /><br />Where for lots of you? Just is not going to happen.<br /><br />Just not competing very well. For many of you, this result alone guarantees that nothing you do in mathematics, assuming having that mathematical audience, will be taken seriously without wondering where were you, in this tragedy of the mathematical world?<br /><br />While I've been talking it, for years.<br /><br />Oh yeah, took some time for me to get perspective. And weird thing? These kind of stories spread FAST, so lots of people must know by now. But then they do nothing much. Which is weird to me I guess. But watching with other stories in other areas, apparently are waiting for an appropriate authority to handle?<br /><br />Which to me? Is kind of interesting. So yeah, some of you math people? They DO know. The Public.<br /><br />And when they look at you? What do you think they're thinking?<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-30389475371778424012017-08-12T09:07:00.002-04:002017-08-30T09:51:13.191-04:00Some number examplesFor some reason really like when have examples with numbers in posts and some are actually my favorites and thought to collect a few linking back to post, in a post.<br /><br />Like <a href="http://somemath.blogspot.com/2015/01/looking-at-sum-of-squares-product.html" target="_blank">here</a> is one:<br /><br /><b>(46<sup>2</sup> + 48<sup>2</sup> + 72<sup>2</sup>)(172<sup>2</sup> + 258<sup>2 </sup>+ 430<sup>2 </sup>+ 602<sup>2</sup> + 1762<sup>2</sup>) = </b><br /><b><br /></b><b> 615<sup>2 </sup>+ 3075<sup>2</sup> + 14145<sup>2</sup> + 15990<sup>2</sup> + 188497<sup>2</sup> </b><b> = 77<sup>4</sup>*2<sup>10</sup></b><br /><br />Just like to stare at it for some reason.<br /><br />Seem to like sums of lots of squares. Continuing, like <a href="https://somemath.blogspot.com/2015/01/square-sum-of-five-squares.html" target="_blank">here</a> is two more sums of 5 squares to a square:<br /><br /><b>4<sup>2</sup> + 6<sup>2 </sup>+ 10<sup>2 </sup>+ 14<sup>2 </sup>+ </b><b>86<sup>2</sup></b><b> = 88<sup>2</sup></b><br /><br />and<br /><b><br /></b><b>86<sup>2</sup> + 129<sup>2 </sup>+ 215<sup>2 </sup>+ 301<sup>2 </sup>+ 881</b><b><sup>2</sup> </b><b>= 968<sup>2</sup></b><br /><br />And <a href="https://somemath.blogspot.com/2017/06/summing-seven-squares-to-square.html" target="_blank">here</a> went ahead and summed 7 to get a square:<br /><br /><b>34967<sup>2</sup> + 752<sup>2</sup> + 1128<sup>2 </sup>+ 1880<sup>2 </sup>+ 2632<sup>2</sup> + 4136<sup>2</sup> + 4888<sup>2</sup> = 35721<sup>2</sup></b><br /><div><br /></div>Where am using BQD Iterator for all of these. But is mathematical tool I have which makes such things easy. Those are ones just from my own research.<br /><br />An example from even earlier though, where rely on previous known result is <a href="https://somemath.blogspot.com/2011/09/two-conics-equation-size.html" target="_blank">here</a> where was talking size of what I now call the unary form of the two conics equation:<br /><b><br /></b><b>60*255110030<sup>2</sup> + 255110029<sup>2</sup> = 1992473029<sup>2</sup></b><br /><br />That is related to something, talk it <a href="https://somemath.blogspot.com/2011/11/neat-trick.html" target="_blank">here</a> and for reference: <b>29718<sup>2</sup> - 61*3805<sup>2</sup> = -1</b><br /><br />Liking that the easier solution, which is historically known so know from other sources and didn't figure it out myself, fits nicely there.<br /><br />Putting in one place is useful to me for staring at them purposes.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-19562486929134291092017-08-11T07:49:00.001-04:002017-09-01T05:39:30.837-04:00Some math discoveries listedSometime this month, as don't remember exact day, will be 15 years since found my prime counting function. And thought along with that special event would just list some of my mathematical discoveries. Will not link to anything as everything is on blog somewhere.<br /><br />So first, yeah found my own prime counting function fastest for its size in its compact sieve form, but more importantly leads to a difference equation when fully mathematized, which has to be constrained to get it to count primes. But THAT difference equation importantly leads to a partial differential equation.<br /><br />So world was given a clear and direct explanation for how prime counts can connect to continuous functions.<br /><br />That is so cool. Is so weird though, how close some were to the simple explanation before, without finding it. Their methods for counting primes were SO close. Oh well, left for me to find.<br /><br />Too much emotion in area explains delay from official figures acknowledging.<br /><br />Emotion and mathematics? Do not go well together.<br /><br />Should I admit a sort of grim satisfaction whenever go looking for current research on Riemann Hypothesis? Hardly matters for me, of course. Yeah, like I said, emotion and mathematics do not go well together.<br /><br />And celebrate 15 years this month since first found my prime counting function.<br /><br />Moving on.<br /><br />Developed my own mathematical discipline using what I call tautological spaces, as rely on complex identities.<br /><br />Entire field call modular symbology, and it realizes the first true modular algebra.<br /><br />And is my best example of my use of abstract reductionism. Oh, before called modular algebra symbology, but like it shorter! So will switch to that now. There is so much related it dominates this blog.<br /><br />Oh yeah, so in that area found my own way to solve for the modular inverse!<br /><br />That is FINALLY for the human species a third way, with other two there is Euclid's name on one and Euler's name on the other. Is now barely over three months since found that so still absorbing the thrill.<br /><br />And found an axiom related to primes, decided to call prime residue axiom.<br /><br />Biggest thing though, is found my own numbers. That one takes SO much explaining will leave it like that, but big part was finding my own ring which call the object ring.<br /><br />And that I think covers enough of the highlights to satisfy my mood.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-6472486504564717692017-08-05T14:15:00.001-04:002017-08-31T09:08:18.316-04:00Web rules and my Diophantine reducerOne of my more informative results can help elucidate how the web has changed things with sharing even highly refined information, like consider if wanted to reduce:<br /><br />x<sup>2</sup> + 2xy + 3y<sup>2</sup> = 4 + 5x + 6y<br /><br />Can use my method for reducing to get: [-4(x+y) + 10]<sup>2</sup> + 2s<sup>2</sup> = 166<br /><br />Which is an example have used since 2011, where s = 9, and x+y = 2, is one solution, from which you can find: x = 4, y = -2 as one solution. And another gives: x = 5, y = - 2<br /><br />Kind of cool, huh? Same y works for two different values for x. And really glad the equation had integer solutions! And easy ones too. Is obvious why I picked it am sure. And s has an explicit solution as a function of x and y, but I don't use it, as just helps by giving two linear equations to solve for x and y, but DO talk about it in <a href="http://somemath.blogspot.com/2015/08/infinity-and-binary-quadratic.html" target="_blank">this post</a>.<br /><br />And copied example from <a href="http://somemath.blogspot.com/2011/05/reducing-binary-quadratic-diophantines.html" target="_blank">this post</a> showing my way to reduce what are called binary quadratic Diophantine equations and have also seen called two variable quadratic Diophantine equations.<br /><br />For me reducing is for show.<br /><br />But there are people who need to reduce these types of equations for am sure lots of reasons, so linking to my method is about usefulness. However, why link to something worse than other techniques? To do so would be illogical, and against common sense.<br /><br />In fact have noted my method improves upon methods for reducing learned are from Gauss. But with his techniques you also need to check something called a discriminant. With my approach that is worthless effort, and I make no mention of such a thing.<br /><br />Turns out you don't need it.<br /><br />But what do you think is in some math textbook, eh? And am a HUGE fan of Gauss, but if he were alive today doubt he'd be surprised that his authority is not taken lightly. Who knows when academics will update.<br /><br />Innovation tends to lead in dramatic ways which is more fun and rapid. People who NEED will just go to the best thing available, when know it is. Getting established? Is more of a process which to me is tedious and depends on others, whose motivations can vary.<br /><br />Web makes all that irrelevant from MY perspective.<br /><br />Web can just connect information DIRECTLY to the people who need it.<br /><br />With such older research of mine the web is very efficient in linking to it. And I can check search engines based on my own results to see if search results will get to them, and do it routinely.<br /><br />Usually Google wins, and will check against Bing more than others. However, at times with more recent research have seen Bing win. And I think Google is making more effort to rely on establishment authority, rather than just on web authority, which is a hypothesis to explain that result.<br /><br />Over time though, best results will win, and notice that is true regardless of the web.<br /><br />And academics lagging best methods is not new I don't think. The web though can simply link to best, though I think often is being done on various views of authority! Which I think is interesting.<br /><br />Picked one of my most dramatic examples but can help explain other areas too. Right now have several results could have used, but I like this one as is connected to some serious practical things.<br /><br />World doesn't sit and wait on academics. And never has. But web has made things easier.<br /><br />So yeah, one thing I do routinely is check search engines to see better how they operate based on what happens with my own research results, when can check those objectively against what is known, where usually can.<br /><br />Figuring out web rules is of interest to me.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-26860084532211751222017-08-02T15:43:00.002-04:002017-08-09T07:16:20.228-04:00Prime difference and marking fifteen yearsThings have worked out really well for me from a discovery perspective. And it is important should note this month will mark 15 years since found my prime counting function, which in its most mathematized form counts using a difference equation. I think at times have used the word mathematicized. Did I make that up? Guess so, as spell check doesn't like it.<br /><br />And don't know when this month though so may as well make a post now. Just remember was August 2002, and guess could try to check? But is some post on Usenet and do NOT wish to dig through there.<br /><br />On here as checking published posts now, see <a href="http://somemath.blogspot.com/2005/06/counting-primes.html" target="_blank">this post</a> as first one, which was posted June 2005. And first post on blog is March 2005, so took a few months to get to it. Of course this was second thing I had for my math? Before had something before Blogger and was paying for a website so was very happy when could switch to something free. That is, talking webpages. For a LONG time was just arguing on Usenet and eventually through Google Groups at some point. I say a long time but think was from 1996?<br /><br />There are SO many posts on this blog talking my prime counting function where think have labeled most, so if curious can go through.<br /><br />That prime counting function was first result which really was just deriving something kind of because felt like it. Specifically asked myself to figure something out and few weeks later had it, really just from scratch.<br /><br />My prime counting function is also my most stand-alone result. It doesn't derive from any other research I'd done, and it is very compartmentalized though can get sort of broad. So there is a sieve form, and a fully mathematical form, where yeah guess that is supposed to be called fully mathematized. And there is the difference equation itself which has to be constrained for it to give the count of prime numbers. Then there is the partial differential that follows from the difference equation. And that is all really just one package all to itself.<br /><br />Was also first result where there was just no doubt as wasn't using techniques I'd invented or wondering how something so simple could be missed. Oh, was a bit before I had the partial differential equation that follows, but had it by the time created this blog under its old name. And that is <a href="http://somemath.blogspot.com/2005/06/partial-differential-prime-counting.html" target="_blank">this post</a>, which was also June 2005. Updated that post at some point to use delta symbol.<br /><br />So cool. Has been SO amazing on the discovery side. Changed my life for sure.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-34770391064355336112017-08-01T07:40:00.001-04:002017-10-14T13:56:05.735-04:00Sum two squares to power of 10Number authority is from the knowledge embedded in numbers which is infinite and absolute. Like consider:<br /><br /><b>1<sup>2</sup> + 3<sup>2</sup> = 10</b><br /><br /><b>8<sup>2</sup> + 6<sup>2</sup> = 10<sup>2</sup></b><br /><br /><b>26<sup>2</sup> + 18<sup>2</sup> = 10<sup>3</sup></b><br /><br /><b>28<sup>2</sup> + 96<sup>2</sup> = 10<sup>4</sup></b><br /><br /><b>316<sup>2</sup> + 12<sup>2</sup> = 10<sup>5</sup></b><br /><br />So yeah, <i>every</i> power of 10 out to infinity is a sum of two squares, which doesn't seem useful to me, just curious. What can it tell me? Such things I enjoy pondering though yeah, also just like looking at numbers as you may have noticed.<br /><br />Am just using a specific of a more general result as 10 is such a big deal to many, including me.<br /><br />The numbers KNOW and we can find things out, if we want. So much depends though, on asking questions. The numbers know infinite information. We can find some things out.<br /><br />If it doesn't interest you, ok.<br /><br />For me such things DO interest, and this result follows from a simple rule.<br /><br />If: u<sup>2</sup> + 9v<sup>2</sup> = 10<sup>a</sup><br /><br />Then: (u - 9v)<sup>2</sup> + 9(u + v)<sup>2</sup> = 10<sup>a+1</sup><br /><br />Which is just using my BQD Iterator. And notice that u and v can be positive or negative, while I like to show positive as is easier and looks prettier. Copied much from <a href="https://somemath.blogspot.com/2016/12/summing-squares-to-powers.html" target="_blank">an earlier post</a> where you can go there to read more.<br /><br />And there are LOTS of posts on my BQD Iterator, and you can find a list of those I've labeled by clicking on label beneath this post.James Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-35205173933955020192017-07-24T11:50:00.001-04:002017-07-27T10:17:02.379-04:00When truth is your hammerReadily admit I will turn to absolute proof and even <a href="http://somemath.blogspot.com/2017/06/number-authority.html" target="_blank">number authority</a> itself, when need reassurance. And when you wield truth in a certain way it can be necessary to hammer through against people who rely more on feeling than fact, as we humans can be recalcitrant at times. And there are people who think truth is a moving target or most amazing to me, some think truth is about human opinion.<br /><br />So yeah I <a href="http://somemath.blogspot.com/2017/06/summing-seven-squares-to-square.html" target="_blank">posted this</a> thing recently:<br /><br /><b><br class="Apple-interchange-newline" />34967<sup>2</sup> + 752<sup>2</sup> + 1128<sup>2 </sup>+ 1880<sup>2 </sup>+ 2632<sup>2</sup> + 4136<sup>2</sup> + 4888<sup>2</sup> = 35721<sup>2</sup></b><br /><br />_____________________________<br /><br />An absolute truth it doesn't care what you think of it, or me.<br /><br />And I'd summed five squares before and the math is easy, but it just felt good. And I like to stare at it when get philosophical or, yeah need that reassurance.<br /><br />Human beings will come and go.<br /><br />Here in this time, when some may think that they have a will that can overcome mathematical proof.<br /><br />Let them try.<br /><br />When you are someone like me who wields truth as a hammer when necessary, or has the infinity results, then you can look at others with curiosity, to see what they believe.<br /><br />Try to break the hammer, see what happens.<br /><br />I'm curious. I, at least, am human. But in the end?<br /><br />The math is not human. The math knows you. But you do not control the math.<br /><br />The math does not care what you believe.<br /><br />Possibly some of you as well will feel that urge to wield truth.<br /><br />Do you have what it takes? Few can handle the truth at certain levels, who can find the most powerful infinity results and present to their world.<br /><br />I could. I have.<br /><br />This post was SO much fun. Yeah am a fan of comic books. But I read them a little differently than others am sure, now. And the movies? Are so much more fun, for me.<br /><br />Takes someone like me.<br /><br />Can you stand with truth as your best protector?<br /><br />Or would you bend in fear?<br /><br />I know.<br /><br />For me maybe is more fun this way anyway, as suits my flair for the dramatic.<br /><br />Coming up on 15 years since I discovered my prime counting function as just one example. Can you imagine? Could you simply stand for truth?<br /><br />Challenge demands a certain person. Reality? Knows.<br /><br />The math knows. The math chose. Reality bends not for you.<br /><br />The future demands the one who will get it done.<br /><br />There are more results out there--an infinity of them. Reality will choose those who will get it done.<br /><br />Can you stand for truth? Come what may?<br /><br />Readily admit as much as I LOVE discovery of my own, more and more wonder, where can these ideas lead that others might find?<br /><br />Truth is out there.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-65525126284817617012017-07-20T07:50:00.000-04:002017-08-01T16:35:43.245-04:00Progression, abstraction and two conics equationWorth noting the progression to my latest result, which has a lot to do with reducing the general equation for what I like to call a binary quadratic Diophantine equation which is also called a two variable one:<br /><br />c<sub>1</sub>x<sup>2</sup> + c<sub>2</sub>xy + c<sub>3</sub>y<sup>2</sup> = c<sub>4</sub> + c<sub>5</sub>x + c<sub>6</sub>y<br /><br />Here x and y are the two unknowns to be figured out. The base result comes from <a href="http://somemath.blogspot.com/2008/09/quadratic-diophantine-result.html" target="_blank">this post</a> from September 2008. But checking published posts, was referenced talking a general method for reducing binary quadratic Diophantine equations on this blog in <a href="http://somemath.blogspot.com/2011/05/reducing-binary-quadratic-diophantines.html" target="_blank">this post</a> in May 2011.<br /><br />And copying from <a href="http://somemath.blogspot.com/2012/12/concepts-in-binary-quadratic.html" target="_blank">this post</a>, where also note that with my method for reducing can get to the general reduced form:<br /><br class="Apple-interchange-newline" />u<sup>2</sup> - Dv<sup>2</sup> = C<br /><br />Where u and v are unknowns. And while I've talked about with C=1 as the two conics equation before, the more general also gives two so that is just the unary case. Letters don't matter of course and like to show as:<br /><br />x<sup>2</sup> - Dy<sup>2</sup> = F<br /><br />where all variables are non-zero integers. And yeah a LOT of abstraction, in that progression, where now you can solve for x and y modularly. Looks like I <a href="http://somemath.blogspot.com/2012/09/generalizing-modular-solution.html" target="_blank">figured that out</a> in September of 2012.<br /><br />With a non-zero integer N for which a residue m exists where--m<sup>2</sup> = D mod N, and r, any residue modulo N for which Fr<sup>-1</sup> mod N exists then a solution is:<br /><br />2x = r + Fr<sup>-1</sup> mod N and 2my = Fr<sup>-1</sup> - r mod N<br /><br />And <a href="http://somemath.blogspot.com/2017/05/modular-inverse-innovation.html" target="_blank">use that to solve</a> for the modular inverse.<br /><b><br class="Apple-interchange-newline" /> r<sup>-1</sup> = (n-1)(r + 2my<sub>0</sub>) - 2md mod N</b><br /><br />Where y<sub>0</sub> is chosen as is m, with m not equal to r, and n and d are to be determined. They are found from:<br /><br /><b>2mdF<sub>0</sub> = [F<sub>0</sub>(n-1) - 1](r + 2my<sub>0</sub>) mod N</b><br /><br />and<br /><br /><b>F<sub>0</sub> = r(r+2my<sub>0</sub>) mod N</b><br /><br />---------------------------------------------------<br /><br />And felt an urge to put all together to kind of see that progression from the most general form, to abstraction to the more basic two conics form, and then to a solution for the modular inverse.<br /><br />So you end up going from something to do with binary quadratic Diophantine equations to something more general than them.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-18228959391801258072017-07-19T08:03:00.002-04:002017-07-19T20:19:15.996-04:00Correct matters mostWhen found mathematical results have an absolute aspect you can find difficult to find elsewhere, like maybe only in logic. When you have the correct mathematical result, it is absolutely true. And have given <a href="http://somemath.blogspot.com/2014/10/example-showing-truth-logic-and.html" target="_blank">an example</a> of absolute proof.<br /><br />However emotion can lead us astray as human beings and have been lead astray in the past by my emotions and did not like it when found out! Where could be SO confident and certain, when thought had a correct mathematical argument only to finally have that wrong belief dramatically collapse when finally could see my error.<br /><br />That elicits a terrible feeling and I do not like it. I try not to repeat such failure.<br /><br />The joy in believing you have something important is not worth it, if it is not even correct, as such a thing is completely empty.<br /><br />Correct matters most, as only when absolutely correct do you have the mathematical proof, as proof is perfect.<br /><br />To check against emotion I now employ a process which I think helps protects others as well, as while not good to lead one's self astray, so much worse to lead others! Which means I try to focus objectively, consider results as facts only when well established, and refrain from emotional appeals.<br /><br />So please do not be surprised at a steady process which does not involve trying to convince you, but is sharing of mathematical ideas and process as well, so that truth can be determined.<br /><br />For those who appreciate truth, working for the truth should be a privilege.<br /><br />Am lucky in that most of what I have requires only what are generally called elementary methods. I like that phrase. Elementary methods.<br /><br />Numbers have fascinated me in special ways for as long as I can remember. Like friends with personalities who are anxious to tell you cool things. And they never lie. But can lie to myself if I'm not careful so yeah, focus on--correct matters most.<br /><br />And explanation helps.<br /><br />Labels below this post consider various areas around the social aspect of presenting mathematics from celebrity, to what I call the social problem, and also instructional. Click on a label for more posts in that area! And thank you for your interest.<br /><br />I try not to try to convince you, but I do appreciate your time and attention.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-72713491360587420022017-06-12T14:07:00.000-04:002017-08-12T09:08:56.564-04:00Number authorityFind that I DO turn to numbers routinely. And the authority you feel when the numbers behave as mathematics requires is like no other to me.<br /><br />The math does not care. But the math is never wrong.<br /><br />And there is a comfort in that which I think turns into a sense of protection. So the math may not care but you can find shelter in truth.<br /><br />So yes, will turn to numbers in comfort and love the conversation with the math even knowing the math does not care. But the math can talk to you. And you can talk to the math, and ask questions!<br /><br />And if you ask the right questions, the math can give you the truth.<br /><br />Without a doubt to me is one of the greatest phrases. And in mathematics truth can be found--without a doubt.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-86854519522198338142017-06-12T11:48:00.002-04:002017-08-03T12:39:00.190-04:00Summing seven squares to a squareDiscovered a simple technique to build sums of as many squares as you want to a square. For example, here is a sum of seven squares to get a square:<br /><br /><b>34967<sup>2</sup> + 752<sup>2</sup> + 1128<sup>2 </sup>+ 1880<sup>2 </sup>+ 2632<sup>2</sup> + 4136<sup>2</sup> + 4888<sup>2</sup> = 35721<sup>2</sup></b><br /><br />_____________________________<br /><br />My basic result used to get an arbitrary length of sums of squares is that in general there must always exist nonzero x and y, such that for an integer n equal to 1 or higher, and an integer m equal to 3 or higher:<br /><br /><b>x<sup>2</sup> + (m-1)y<sup>2</sup> = m<sup>n</sup></b><br /><br />Where n starts at 1. Often I like to start it at zero so it's a count of iterations but is prettier starting at 1. And you get values for x and y using what I like to call a BQD Iterator, which is short for binary quadratic Diophantine iterator. I've talked about it a lot.<br /><br />For a sum of c+1 squares: <b>m = s<sub>1</sub><sup>2</sup> +...+s<sub>c</sub><sup>2</sup> + 1</b><br /><b><br /></b><b>x<sup>2</sup> + (</b><b>s<sub>1</sub><sup>2</sup> +...+s<sub>c</sub><sup>2</sup></b><b>)y<sup>2</sup> = m<sup>n</sup></b><br /><br />The BQD Iterator is:<br /><br />Given nonzero integers u and v with<br /><br />u<sup>2</sup> + (s<sub>1</sub><sup>2</sup> +...+ s<sub>c</sub><sup>2</sup>)v<sup>2</sup> = F<br /><br />then it must also be true that<br /><br />(u - (s<sub>1</sub><sup>2</sup> +..+s<sub>c</sub><sup>2</sup>)v)<sup>2</sup> + (s<sub>1</sub><sup>2</sup> +...+s<sub>c</sub><sup>2</sup>)(u + v)<sup>2</sup> = (s<sub>1</sub><sup>2</sup> +...+ s<sub>c</sub><sup>2</sup> + 1)*F<br /><br />So for 7 squares, I'll need 6 s's and I'll use primes: 2, 3, 5, 7, 11 and 13<br /><br />Then m = 4 + 9 + 25 + 49 + 121 + 169 + 1 = 378<br /><br />1<sup>2</sup> + 377*1<sup>2</sup> = 378<br /><br />First iteration: (-376)<sup>2</sup> + 377*(2)<sup>2</sup> = 378<sup>2</sup><br /><div><br /></div><div>Second iteration: (-1130)<sup>2</sup> + 377*(-374)<sup>2</sup> = 378<sup>3</sup></div><div><br /></div><div>Third iteration: (139868)<sup>2</sup> + 377*(-1504)<sup>2</sup> = 378<sup>4</sup></div><div><br /></div><div>Which is: (139868)<sup>2</sup> + 4*(-1504)<sup>2</sup> + 9*(-1504)<sup>2 </sup>+ 25*(-1504)<sup>2 </sup>+ 49*(-1504)<sup>2</sup> + 121*(-1504)<sup>2</sup> + 169*(-1504)<sup>2</sup> = 378<sup>4</sup></div><div><br /></div><div>Can divide both sides by 16, and get rid of negatives to get:</div><div><br /></div><div>Which is: 34967<sup>2</sup> + 752<sup>2</sup> + 9*(376)<sup>2 </sup>+ 25*(376)<sup>2 </sup>+ 49*(376)<sup>2</sup> + 121*(376)<sup>2</sup> + 169*(376)<sup>2</sup> = 189<sup>4</sup></div><div><br /></div><div>And now get final result where will show as all squares:</div><div><br /></div><div><div><b>34967<sup>2</sup> + 752<sup>2</sup> + 1128<sup>2 </sup>+ 1880<sup>2 </sup>+ 2632<sup>2</sup> + 4136<sup>2</sup> + 4888<sup>2</sup> = 35721<sup>2</sup></b></div></div><div><br /></div><div>Which is interesting to me, I think. Looks more impressive that way. Of course watch it get built maybe less impressive? But still is, a sum of seven squares to get a square.</div><div><br /></div><div>Don't really see a practical use, so to me? Is just pure math.<br /><br />Am curious, if you know a number theorist, why not ask that person to produce an example of sums of squares to a square? It's not like it's actually hard to do, if you know how.<br /><br />Of course, highlighting a cool result with mathematical tools I <i>pioneered</i>. Do I really know or care if number theorists can match me here? Not really.<br /><br />For the discoverer? It's all good.</div><div><br /></div><div><br /></div><div>James Harris</div>James Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-363064627862605312017-06-09T11:14:00.000-04:002017-10-03T08:54:43.919-04:00Talking my modular inverse discoveryFigured out my own way to calculate the modular inverse, adding now a third primary way, where before there were only two.<br /><br />The modular inverse is a rather simple thing from modular arithmetic, like consider:<br /><br />2(3) <span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">≡ </span>1 mod 5<br /><br />Here 2 is the modular inverse of 3 and vice versa because they multiply to have a residue of 1 modulo 5, which is the modulus. That can be written as:<br /><br />2 <span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">≡ 3<sup>-1</sup> mod 5</span><br /><br />Importantly in my research as I use SO much modular long ago tired of copying and pasting the modular congruence symbol so just use equals, so I have:<br /><br />2(3) = 1 mod 5 and then: 2 = 3<sup>-1</sup> mod 5<br /><br />May seem small but in my experience you can face purists who will be dismissive on such small matters! When am someone who is NOT going to waste time copying and pasting something all over a vast amount of research just to appease such people as is human convention. The math does not care.<br /><br />The modular inverse as a concept has been around for some time, but only a few basic approaches for finding it were previously known. One relies on something called the <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm" target="_blank">extended Euclidean algorithm</a>, which is very simple but will just link. The other approach depends on something called <a href="https://en.wikipedia.org/wiki/Euler%27s_theorem" target="_blank">Euler's theorem</a>, where learned the above from article on Wikipedia on what they call the <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a>.<br /><br />And now can add another basic approach which relies on a system of equations I discovered about a month ago. For some residue r modulo N, its modular inverse is:<br /><b><br class="Apple-interchange-newline" /> r<sup>-1</sup> = (n-1)(r + 2my<sub>0</sub>) - 2md mod N</b><br /><br />Where y<sub>0</sub> is chosen as is m, with m not equal to r, and n and d are to be determined. They are found from:<br /><br /><b>2mdF<sub>0</sub> = [F<sub>0</sub>(n-1) - 1](r + 2my<sub>0</sub>) mod N</b><br /><br />and<br /><br /><b>F<sub>0</sub> = r(r+2my<sub>0</sub>) mod N</b><br /><br />---------------------------------------------------<br /><br />Copied from my post: <a href="http://somemath.blogspot.com/2017/05/modular-inverse-innovation.html" target="_blank">Modular Inverse Innovation</a><br /><br />It is also derived there. And my system, is kind of more direct like that which follows from Euler's theorem, but is also iterative like what follows from extended Euclidean algorithm. But allows you to fiddle with things in a way that neither does. So you can pick two key variables: <b>m</b> and <b>y<sub>0</sub></b><br /><br />And they are so named because of how I discovered the system, as was just kind of <a href="http://somemath.blogspot.com/2017/05/chasing-modular-inverse.html" target="_blank">puzzling over some things</a>.<br /><br />Here is a <a href="http://somemath.blogspot.com/2017/06/iterative-example-with-my-modular.html" target="_blank">link to a post</a> showing an iterative example.<br /><br />It is one of my most direct discoveries which surprised me a bit, as it just <i>flowed</i>. And I'm beginning to accept that I have years of experience which has given me a certain level of expertise.<br /><br />Research about the modular inverse on the web I've done since, when yeah got REALLY interested, has indicated is also a practical result as calculations of the modular inverse are part of modern techniques, according to that research. So it has applied and pure math aspects.<br /><br />The result is definitive though in terms of evaluating social aspects of how discovery is actually treated versus how one might imagine. I've had lots of experience in this area with prior results.<br /><br />And the social problem label below covers that topic.<br /><br />Good news though, looks like first basic major result at this level in over a century. Probably MUCH longer. Notice prior methods go back to Euler and Euclid. Wow. Supposedly such a possibility of such a basic find no longer existed. Am thrilled to be the discoverer.<br /><br />So yeah, humanity has a new mathematical tool.<br /><br />Mathematics discovered belongs to the human race.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-3962881047289766802017-06-04T07:35:00.000-04:002017-09-28T08:09:26.341-04:00Iterative example with my modular inverse methodMy way to calculate the modular inverse at least gives a smaller modulus with another inverse to calculate and realized might help to show an iterative example.<br /><br />Will start with the system which I will copy from my reference post, and then will explain lots, where am not doing so much shown calculation as is tedious. So very wordy post I warn. Less with shown work. Interested readers are invited to work through themselves as I think greatly helps understanding to fill in what I'm leaving out.<br /><br />Also lets me explain some things a bit differently. Here is the system:<br /><b><br class="Apple-interchange-newline" /> r<sup>-1</sup> = (n-1)(r + 2my<sub>0</sub>) - 2md mod N</b><br /><br />Where y<sub>0</sub> is chosen as is m, with m not equal to r, and n and d are to be determined. They are found from:<br /><br /><b>2mdF<sub>0</sub> = [F<sub>0</sub>(n-1) - 1](r + 2my<sub>0</sub>) mod N</b><br /><br />and<br /><br /><b>F<sub>0</sub> = r(r+2my<sub>0</sub>) mod N</b><br /><br />---------------------------------------------------<br /><br />Copied from my post: <a href="http://somemath.blogspot.com/2017/05/modular-inverse-innovation.html" target="_blank">Modular Inverse Innovation</a><br /><br />It is also derived there.<br /><br />Importantly you have variables that follow from: x<sup>2</sup> - m<sup>2</sup>y<sup>2</sup> = F<br /><br />And you're solving for <b>n</b> and <b>d</b>, with other variables picked. Where I've tended to pick m such that m<sup>2</sup> is greater than N, though is NOT clear if that is necessary. Is a new area I just found.<br /><br />I do know that m should not equal r though. So let's try it all with N = 851 = 23(37).<br /><br />I tend to let y<sub>0</sub> = 1, where that is just for easy. Later research may indicate other more useful values. And will let m = 31, as that squared is greater than N and I like primes. Not necessary for m to be prime though.<br /><br />Oh, and let's let r = 97. I like using primes because things won't work if r shares factors with N, of course as then the modular inverse does not exist! So helps me just using primes often.<br /><br />Now can calculate F<sub>0</sub>, which is: 97(97+2(31)) mod 851.<br /><br />So F<sub>0</sub> = 105 mod 851.<br /><br />Plugging everything in and reducing things and simplifying, I get:<br /><br />298d = 325n - 166 mod 851<br /><br />So now to solve for n can just find: 325n - 166 = 0 mod 298<br /><br />That is: 27n = 166 mod 298, so now I need the modular inverse...oh wait. I notice that 298 - 166 has 3 as a factor, so can get:<br /><br />9n = -44 mod 298<br /><br />Oh, then I got clever. If we let n = 2z, then: 9z = -22 mod 149, as can divide 2 across everything.<br /><br />So now finally, can look for modular inverse of 9, modulo 149. It works. Not in the mood to put all that here though. But just use the system already given and this time it just gives the answer without further iteration needed. Turns out 9<sup>-1</sup> = 116 mod 149. Where just get the answer that time without needing to iterate further.<br /><br />Will leave as an exercise for the reader to get to: n = -38 mod 851, d = -42 mod 851<br /><br />(I think.)<br /><br />Where since is modular algebra those aren't the only ones that will work. But I liked them because they're small. Also shows you can use negative as well as positive, of course.<br /><br />Then r<sup>-1</sup> = -39(159) - 62(-42) mod 851<br /><br />And r<sup>-1</sup> = 658 mod 851. And 97(658) = 1 mod 851 as required.<br /><br />I think that's all ok, as to how it works. Copying from notes so may be minor errors here or there.<br /><br />Main point is: you definitely get to a smaller modulus as went from 851 to 149. And also can just iterate with THIS method, so it will solve for the modular inverse.<br /><br />Lots of research room though for best techniques.<br /><br />And I noted some open questions, like what is best choice for m? Or y<sub>0</sub>? And does it matter to work more to pick a smaller F<sub>0</sub>? I just went with whatever. You can fiddle with things to make coefficients of n and d as small as possible, I'd think!<br /><br />So much room for further research.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-68735446746988217132017-06-01T21:02:00.001-04:002017-06-07T17:29:27.029-04:00Solid result and am surprisedJust a quick update that my modular inverse solving method is solid. Luckily is easy math, so not much to check. For those who wonder, when an error is in there it usually is something simple. I have my own definition of mathematical proof for checking for errors, but human reality can be you just miss things. But my modular inverse innovation is perfect.<br /><br />It adds to my collection of infinity results. And that label is below <a href="http://somemath.blogspot.com/2017/05/modular-inverse-innovation.html" target="_blank">the post</a> for those curious about the others. Just click on labels below posts to get other posts where I've so labeled.<br /><br />But so wild was available! Am so glad just kind of was wondering and have had that modular factorization for YEARS and talked it up on this blog too. Oh yeah, decided had a responsibility to at least try and sent some emails to some mathematicians and one US Government agency. Felt like the right thing to do. No replies from the mathematicians. And just an auto-reply so far from US Government agency.<br /><br />That's ok. Just doing my due diligence. But for those who wonder? No, am not expecting mathematicians to reply to me any more as what can they say? Think about it. Any reply can force them to do more than just reply, like help champion a really massively cool discovery which greatly adds to human knowledge.<br /><br />Maybe I should give them the benefit of the doubt. Hasn't been that long. Still feel there is clearly indication of a certain poetic justice in play. Situation can be distressing for others am sure who may worry about controversy! But good news is, is more me disappointed than anything else. I have math ideas I'd just as soon see picked up by established mathematicians. Mostly though they just seem to ignore me.<br /><br />Regardless of any of that am SO excited with the find!<br /><br />Am so happy with this thing. Not my biggest result by far, but one that tells a lot. Why was it available for me?<br /><br />Because I went looking for it, I guess. I don't know. Am just babbling now. Then again is also would think another example of the analytical power of abstract reductionism.<br /><br />Main thing: is a solid result. May have a massive impact in many areas of number theory, remarkably enough. I suspect is ALREADY being used by now as information travels fast in our times, but not that folks tell me. But already discussed the why there.<br /><br />The math is there. People just have to go look for it. And mathematics IS an infinite subject.<br /><br />For those who love math? That is a reason for so much joy. You will never exhaust possibility.<br /><br />And a reality check too I think, as how can people lead the future of mathematics in our world, if they can't simply discover?<br /><br />Discovery defines mathematics. It is the base from which all else must build.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-9821072525929993092017-05-09T17:47:00.000-04:002017-07-04T07:39:22.827-04:00Modular inverse innovationFigured out a way to calculate the modular inverse of some residue r modulo some integer N, by leveraging a modular factorization. Will give the working system, show an example then give the derivation.<br /><br /><b>System:</b><br /><br /><b> r<sup>-1</sup> = (n-1)(r + 2my<sub>0</sub>) - 2md mod N</b><br /><br />Where y<sub>0</sub> is chosen as is m, with m not equal to r, and n and d are to be determined. They are found from:<br /><br /><b>2mdF<sub>0</sub> = [F<sub>0</sub>(n-1) - 1](r + 2my<sub>0</sub>) mod N</b><br /><br />and<br /><br /><b>F<sub>0</sub> = r(r+2my<sub>0</sub>) mod N</b><br /><br />---------------------------------------------------<br /><br /><b>Example:</b> <i>Calculate the modular inverse of 11 modulo 137</i>.<br /><br />With N = 137, I will use m = 12, as: 7 = 144 mod 137<br /><br />And looking at simple will use y<sub>0</sub> = 1, so:<br /><br />F<sub>0</sub> = 11(11+2(12)(1)) = 11(35) = 111 mod 137<br /><br />61d = 49n - 84 = 7(7n - 12) mod 137<br /><br />If we now let d = 7d', get to 61d' = 7n - 12 mod 137, and n = -7 works with d' = -1.<br /><br />So d = - 7, with n = -7, giving r<sup>-1</sup> = (-7-1)(11+2(12)(1)) - 2(12)(-7) mod 137<br /><br />So: r<sup>-1</sup> = -6 + 31 = 25 mod 137, and 11(25) = 1 mod 137 as required.<br /><br />----------------------------------------------------<br /><br /><b>Derivation:</b><br /><br />Given, some residue r modulo N whose modular inverse is to be determined, find D such that: m<sup>2</sup> = D mod N, and m does not equal r.<br /><br />Then for some x<sup>2</sup> - Dy<sup>2</sup> = F, I have the modular factorization modulo N:<br /><br />(x-my)(x+my) = x<sup>2</sup> - Dy<sup>2</sup> = F mod N, and can set:<br /><br />x - my = r mod N, then x+my =Fr<sup>-1</sup> mod N.<br /><br />Solving for x, with x = my + r mod N, and substituting into x<sup>2</sup> - Dy<sup>2</sup> = F gets me:<br /><br />r(r+2my) = F mod N<br /><br />So I can look at a y<sub>0</sub> which will give an F<sub>0</sub>, and a difference of d, such that:<br /><br />y = y<sub>0</sub> + d<br /><br />And subtract that F from a multiple n, of my initial F, substituting for y:<br /><br />nF<sub>0</sub> - F = r[(n-1)(r+2my<sub>0</sub>) - 2md] mod N<br /><br />Now consider, nF<sub>0</sub> - F = 1 mod N, which gives:<br /><br />r[(n-1)(r+2my<sub>0</sub>) - 2md] = 1 mod N<br /><br />And can solve from there for the modular inverse:<br /><b><br /></b><b> r<sup>-1</sup> = (n-1)(r + 2my<sub>0</sub>) - 2md mod N</b><br /><br />Now can substitute into x+my =Fr<sup>-1</sup> mod N, using x = my + r mod N, and simplify somewhat to get the control equation:<br /><br /><b>2mdF<sub>0</sub> = [F<sub>0</sub>(n-1) - 1](r + 2my<sub>0</sub>) mod N</b><br /><br />and from before I have to show the full system as given:<br /><br /><b>F<sub>0</sub> = r(r+2my<sub>0</sub>) mod N</b><br /><b><br /></b><i>Derivation complete.</i><br /><br /><br />James Harris<br />-------------------------------<br /><br />Want a PDF? You can get one at <a href="https://groups.google.com/forum/?fromgroups&hl=en#!forum/mymathgroup" target="_blank">my math group</a>. There is a post there with a PDF attached.James Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-42936811257994061502017-05-05T19:52:00.000-04:002017-05-28T07:25:08.510-04:00Chasing the modular inverseFor years I've talked about the easy modular factorization with x<sup>2</sup> - Dy<sup>2</sup> = F.<br /><br />Which is, when m<sup>2</sup> = D mod C, where C is some integer:<br /><br />(x-my)(x+my) = x<sup>2</sup> - Dy<sup>2</sup> = F mod C<br /><br />And then I'd use some residue r.<br /><br />Where one way is: x - my = r mod C, then x+my = Fr<sup>-1</sup> mod C<br /><br />Where for years have wondered about that modular inverse, and found myself pondering, can you use these equations to figure it out? So why now? I don't know. Just playing around.<br /><br />Next thing I knew was looking at C = 111 = 3(37) where picked for easy. And noticed that a close square is 121, so got m = 11, and D = 10.<br /><br />Then went for a prime for r, kind out of habit, and need one coprime to 111, wasn't going to use 2, so went with r = 5.<br /><br />So had: x - 11(1) = 5 mod 111, so x = 16 mod 111<br /><br />Then I calculated F, from x<sup>2</sup> - 10y<sup>2</sup> = F, and got F = 24 mod 111.<br /><br />So had 16 + 11(1) = 24r<sup>-1</sup> mod 111, so 27 = 24r<sup>-1</sup> mod 111<br /><br />Which didn't seem to get me anywhere. But I noted means: 5(27) = 24 mod 111<br /><br />So I'm like, ok, why not use y = 2? And after same process got: 5(49) = 23 mod 111<br /><br />And, I realized could subtract one from the other to get 5(27 - 49) = 5(-22) mod 111, so:<br /><br />5(89) = 1 mod 111<br /><br />So I got the modular inverse, but was that luck? And now finally decided to go more formal, so here is the full system:<br /><br /> x<sup>2</sup> - Dy<sup>2</sup> = F, m<sup>2</sup> = D mod C, where C is some integer.<br /><br />(x-my)(x+my) = x<sup>2</sup> - Dy<sup>2</sup> = F mod C, x - my = r mod C, then x+my =Fr<sup>-1</sup> mod C<br /><br />Solving for x, with x = my + r mod C, and substituting into x<sup>2</sup> - Dy<sup>2</sup> = F gets me:<br /><br />r(r+2my) = F mod C<br /><br />So I can look at a y<sub>0</sub> which will give an F<sub>0</sub>, and a difference of d, such that:<br /><br />y = y<sub>0</sub> + d<br /><br />And played around enough to know I needed a variable n, where will just give what I got without explaining everything in detail. Is easy math though, so not hard to retrace.<br /><br />nF<sub>0</sub> - F = r[(n-1)(r+2my<sub>0</sub>) - 2md] mod C<br /><br />And chasing after modular inverse, nF<sub>0</sub> - F = 1 mod C, would be nice, so have:<br /><br />r[(n-1)(r+2my<sub>0</sub>) - 2md] = 1 mod C<br /><br />And then:<br /><b><br /></b><b> r<sup>-1</sup> = (n-1)(r + 2my<sub>0</sub>) - 2md mod C</b><br /><br />Finally now then I have control equations with:<br /><br /><b>2mdF<sub>0</sub> = [F<sub>0</sub>(n-1) - 1](r + 2my<sub>0</sub>) mod C</b><br /><br />and<br /><br /><b>F<sub>0</sub> = r(r+2my<sub>0</sub>) mod C</b><br /><br />So now I don't even <i>see </i>the original x<sup>2</sup> - Dy<sup>2</sup> = F or the other equations. Just see those three, but originals must be valid for it all to work! Must keep that in mind. First was thinking oh, they just went away. Nope. Math knows they are there.<br /><br />Well now can see how n = 1, and d = 1 worked, with r = 5 mod 111.<br /><br />So was just luck, huh? So you CAN just say, pick n, but then have potential of needing a modular inverse to calculate d, or vice versa. Oh yeah, m cannot equal r for this approach to work! Should note that as well.<br /><br />Also may as well check my new equation since know n =1, works, and clips off the front too.<br /><br />And: r<sup>-1</sup> = -2(11) = 89 mod 111, as we got above.<br /><br />Went ahead and tried r = 41 mod 111, just to use something bigger, so again m = 11 and y<sub>0</sub> = 1. And got:<br /><br />105d = 3n - 66 mod 111, where d = 1 will work with: n = 57<br /><br />And that gives r<sup>-1</sup> = 65 mod 111, which works: 41(65) = 1 mod 111<br /><br />And just playing around. So yes, can calculate a modular inverse this way, potentially. Definitely can get to another modular inverse to solve for n or d, but may not be necessary if can just figure them out like with my simple experiments. But who knows how often is that easy? I don't.<br /><br />Wonder if could be proven.... Possibly something for some other time. These simple experiments have been rewarding and extremely interesting.<br /><br />Glad did some experiments and some derivation.<br /><br />Can be SO much fun to play with the math.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-22949715210049257562017-04-29T09:52:00.000-04:002017-05-24T07:22:24.531-04:00Thoughts on simplicity rulesUnderlying reality itself, in SO many ways mathematics rules the world.<br /><br />Theoretically as a human discipline mathematics should be the most objective, straightforward WITHOUT politics or social influence because mathematical logic does not care. But functionally have concluded that difficulty in understanding mathematical topics can bring those things BACK into the discipline.<br /><br />But difficulty should only be there out of necessity, and not for social purpose.<br /><br />So will admit would be so cool to flush mathematical industry of unnecessary complexity. And we should cheer simplicity and push the discipline away from worship of complexity as if it's a power to be not understood by most.<br /><br />For me simplicity improves access and am sure helps reach. Am not someone who has the assumption that people will pay attention for any other reason than my math discoveries WORK.<br /><br />Useless complexity though am sure can give room for charlatans to hide within mathematical field! And any such should be cleared to speed up mathematical discovery and progress. Humanity deserves that on the constant. And am sure science will need more advanced mathematical tools on the constant as well, where direction for tools with modular as a concept has unique appeal for its efficiency, simplicity and conciseness. Luckily have done lots of the groundwork over last decade plus which has a modular focus.<br /><br />In number theory have been fascinated with realization that much of my own research relies on what I decided to call abstract reductionism, and how that really is about simpler approaches, including modular but not only.<br /><br />For example one of my favorite results is the fastest way to count prime numbers for its size and complexity.<br /><br />For those who wish to code, with positive ints or longs--where p<sub>j</sub> is the jth prime:<br /><br />P(x,n) = x - 1 - sum for j=1 to n of {P(x/p<sub>j</sub>,j-1) - (j-1)}<br /><br />The P(x,n) function will count primes up to and including x, if n equals the count of primes up to sqrt(x), and if as you iterate you never let n be greater than the count of primes up to and including sqrt(x), if the function receives an n greater than that value it just needs to reset it to that count.<br /><br />That is the fastest algorithm for counting primes for its size.<br /><br />Turns out I noticed a neat trick which lets you use old ideas with an innovation that makes for a concise algorithm, but also <a href="http://somemath.blogspot.com/2017/01/my-partial-differential-equation.html" target="_blank">leads to a partial differential equation and an explanation</a> that eluded mathematicians for over a hundred years about the prime distribution. Simplicity ruled.<br /><br />And abstract reductionism is even more powerful with what I think may be the first true modular algebra, which I introduced with a tautological statement, also known as an identity:<br /><br />x+y+vz = 0(mod x+y+vz)<br /><br />I call that a tautological space and with that I found a way to generally reduce binary quadratic Diophantine equations, where suggest you use web search to find if don't know where is on this blog already.<br /><br />Finding by web search versus me just giving a link may be more impressive AND informative as can then see competing websites. And my way improves upon techniques put forward by Gauss himself! And as he is a HUGE hero for me that's a massive big deal. Simplicity rules again.<br /><br />These simplifications though to me help make number theory more fun--and accessible.<br /><br />Consider the irony, if some long, difficult mathematical argument which only a few people in the world understood--is simply wrong. And I <a href="http://somemath.blogspot.com/2017/02/more-explanation-for-curious.html" target="_blank">dramatically demonstrated</a> how it could even look correct under established rules of rigor.<br /><br />Have concerns about to what extent hero worship took over the math field. People chase the appearance of correctness, daring someone to catch them if they're wrong, but oh, how do you know? In a complex argument which few understand how dare you challenge?<br /><br />Shredding the incentives for empty celebrity I think helps mathematicians care for truth.<br /><br />There may be simple ways to remove such.<br /><br />Simplicity should rule.<br /><br class="Apple-interchange-newline" />That shatters political maneuverings, dismisses hero worship as basis for belief, and ends worship of position in mathematical fields, as who cares who figures out some math thing? I know the math does not.<br /><br />People can, and it can lead them astray.<br /><br />We should care in SOME way though I think. But what way is appropriate? Main thing is: irrelevant to mathematical truth who digs up that truth for the world.<br /><br />Simplicity rules.<br /><br />And simplicity has other benefits too, as being able to readily play with actual numbers is so great. Like my methods lead to a thing I wonder about usefulness. Consider:<br /><br /><b>4<sup>2</sup> + 6<sup>2 </sup>+ 10<sup>2 </sup>+ 14<sup>2 </sup>+ </b><b>86<sup>2</sup></b><b> = 88<sup>2</sup></b><br /><br />Which I copied <a href="http://somemath.blogspot.com/2015/01/square-sum-of-five-squares.html" target="_blank">from a post where I demonstrate</a> a general way to sum whatever number of squares you wish to get a square.<br /><br />What use is it? Um, for me is just a way...um is fun. I guess. I've debated if should make more examples with it, but will admit...so maybe not so much fun for me. Maybe someone, somewhere out there at some time in human history will find it useful.<br /><br />Main thing in my opinion is that you can just get to math. And will admit do cherish that I escaped the label of mathematician. The math does not care. Discovery should matter more than a label.<br /><br />But I think it DOES matter when people can easily check a person. Overly complex and abstruse mathematical discourse in my opinion can often be about making that difficult, to force relying on people who know what they're doing--<i>even when it may not actually be mathematically correct</i>.<br /><br />It can seem expedient to make a career over advancing your species.<br /><br />I have no career as a mathematician to advance as am NOT a mathematician. And for me simplicity helps me do what I like to do.<br /><br />And people should cherish valid knowledge. When you start looking at the person who discovered some mathematical truth, as if that decides if something is true or not--then you have lost mathematics.<br /><br />Mathematics does not care.<br /><br />Ultimately simplicity is a basic principle for obvious reasons.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0