tag:blogger.com,1999:blog-111191102017-08-18T08:05:57.641-04:00Some MathGlobal resource of innovative mathematical ideas.James Harrishttps://plus.google.com/104012861017102472975noreply@blogger.comBlogger260125tag:blogger.com,1999:blog-11119110.post-30389475371778424012017-08-12T09:07:00.002-04:002017-08-15T19:58:19.240-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, 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-08-12T04:27:37.298-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 which 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 the difference equations leads to a partial differential equation. That is so cool. And celebrate 15 years this month since first found.<br /><br />Moving on.<br /><br />Developed my own mathematical discipline using what I call tautological spaces, as rely on complex identities. Entire field call modular symbology, and it realizes the first true modular algebra. 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! That is finally for humanity 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-09T07:11:56.070-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 my research shows 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 established 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-08-01T20:19:50.863-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> + 36<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-07-13T09:27:53.485-04:00Talking my modular inverse discoveryThe 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 />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-06-04T18:43:12.302-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, d = -42<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.com0tag:blogger.com,1999:blog-11119110.post-76929782177573471562017-03-22T08:59:00.001-04:002017-04-25T19:23:03.215-04:00Valuing discovery and quadratic residue pairsYears ago discovered there were these powerful control equations that force things like distribution of quadratic residues. Learning that happened at some point where was long enough ago not sure when, but for sure one of the important revelations was found fortuitously from staring at:<br /><br />(n - m)<sup>2</sup> = m<sup>2</sup> + 1 mod D-1<br /><br />which follows from:<br /><br />(n-m)<sup>2</sup> - Dm<sup>2</sup> = 1<br /><br />Should note don't use ≡ because I use modular algebra SO much and why add some extra line under equals all over the place? Seems like useless work to me. Oh yeah, to try and help those who might need the info wrote a <a href="http://somemath.blogspot.com/2011/07/focus-on-modular-arithmetic.html" target="_blank">post explaining mod</a> years ago.<span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"> </span><br /><br />So was pondering a slight variation from the usual x<sup>2</sup> - Dy<sup>2</sup> = 1. And had been playing around with the different form and became fascinated by the forced quadratic residue there.<br /><br />Very glad I noticed it!<br /><br />Which lead me to finding out about <a href="https://en.wikipedia.org/wiki/Quadratic_residue#Pairs_of_residues_and_nonresidues" target="_blank">quadratic residue pairs</a>. Which I'd never heard of, until started searching to see if I'd found something new. So there, yes existence had been noticed before. Ok. Is cool to learn more historical number theory to research your own discovery. But then also I figured out how <i>to prove</i> some things, which was new.<br /><br />You can kind of see things from usual form as well:<br /><br />x<sup>2</sup> = y<sup>2</sup> + 1 mod D-1<br /><br />And you can easily solve for unknowns modulo D-1 with either form.<br /><br />Using my alternate: 2m = n<sup>-1</sup>(n<sup>2</sup> - 1) mod D-1<br /><br />Which you need for a proof, which is how to <a href="http://somemath.blogspot.com/2011/10/counting-quadratic-residue-pairs.html" target="_blank">derive the count of quadratic residue pairs</a> which for a long time was one of the most popular posts on this blog. And yeah can use it that way as IS one of the most powerful influences across integers, and yeah can use it to count. It is one of the infinity tools of number theory, which helps rule over quadratic residues.<br /><br />Prior explanations for the count I found, using web search, relied on the <a href="https://en.wikipedia.org/wiki/Pigeonhole_principle" target="_blank">pigeonhole principle</a>. They had no clue.<br /><br />For people into number theory, you can just go check! Web search. And is how I found much so I know information in this area is readily available. That reference reality is a major plus of our times.<br /><br />So far as I know I gave the <i>first direct derivation</i> which not only lets you know why, it allows you to do more. Will admit am more into the 'why' as exciting, so just talked more you can do in my post as can expand to counting in more situations! But didn't do myself. But is a good example to see how a derivation can give more.<br /><br />Especially is that odd feeling when you notice also an easy path that somehow escaped others. Why not figured out a century ago? Who knows. But probably because Gauss pioneered modular in his time, and I picked up where he left off, in ours.<br /><br />Is odd too. Looks like in past, mathematicians knew more of modular arithmetic, but didn't realize a full modular algebra, which I did. And for me to get there had to create an entire mathematical discipline and pioneer abstract reductionism so maybe is harder than I wish to accept!<br /><br />For me? Is just what I did. Guess that doesn't give me the perspective of looking at from a distance.<br /><br />The joy of discovery I guess can be hard to describe but it definitely can motivate to find more, which I think is great. There is that thrill, for what YOU find, with your mind, and mental effort. Is a thrill...hard to describe.<br /><br />Here again my modular approach leads to a short, powerful answer and in this case, a first derivation.<br /><br />And it dawns on me that modular as a first reach in problem solving may be something very new to the human species, but why?<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-87884373382268791872017-03-21T12:22:00.000-04:002017-04-01T07:29:35.123-04:00Supporting faith in the systemRole I want to play can seem mysterious or even a bit complicated until you consider what I see as strange things. And to me the strangest things have driven others that seem so dramatic, like why I put forward a definition of mathematical proof, which I noted at the time back in 2005, was motivated partly by behavior from mathematicians.<br /><br />And it's in the post what I found troubling, where had routinely seen in the news mathematical arguments presented as <i>possibly</i> proofs, which were called proofs, and mathematicians talking as if mathematical proofs were delicate. Huh?<br /><br />Such a bizarre contention was about trying to explain to press, when things called proofs were later shown to have error, and I say, should call mathematical arguments being checked by the system to see if are proofs instead of calling proofs to the public before that is even done.<br /><br />That behavior upset me. And surprised me too! Why talk as if mathematical proof was fragile or delicate? Why? Why? Why?<br /><br />Do try to feel empathy for academic mathematicians desperate to make a career or just keep one going, but there have to be limits on selfish behavior, and constant focus on what is good for the system as a whole.<br /><br />Political behavior from mathematicians or even worse, chasing fame with a claim is not an excuse for such disruption.<br /><br />It irritated me. So I wrote a definition of mathematical proof, which has a functional basis.<br /><br />Some of these things are SO wild, but true. It's like thinking about it later though, seems extraordinary. The explanations are worth nothing I guess. Usually I DO try to explain.<br /><br />And, also note that gave me the benefit of checking my own mathematical results with it. Which I also needed as why wouldn't I?<br /><br />With my one published paper, also note I've championed the system, as it passed anonymous peer review, and actually faced two reviewers.<br /><br />Questioning <i>their own system</i> by mathematicians is probably why things stand as they are. If they just followed the rules would be so much easier for them. And I'm NOT a mathematician so I can critique that while wryly noting my detachment from that system is a plus.<br /><br />Will also note my disdain for what have seen as quests for celebrity from certain mathematicians, and a disappointing amount of hero worship, which muddles the quest for truth from the established community. It's like math people want to believe based on SOURCE instead of argument. Naive hero worship worries me.<br /><br />Yes, I have my own ways of making fun of such things, as well as highlighting them. I'm functionally focused on what works, as I test, and see over time. And is a process where I try to lighten things up when I can, to the extent I can. Helps me feel better at least.<br /><br />I see myself currently as the biggest defender of the system, which is a responsibility I take very seriously. And that becomes more clear<i> in time</i>.<br /><br />If you thought something else, why?<br /><br />There is a LOT of hard evidence that I'm working hard to maintain certain things. Over and over again have gone to a lot of effort to support mathematics globally. Including taking the time to be careful as to how that is done.<br /><br />There is no rush for me. Mathematics is important enough.<br /><br />Feel like mostly done though, which is great! Heavy lifting? Over. Helping with mathematics is already mostly fond memories. Don't spend much time on these things now anyway. Just lately have been cleaning up a bit. Have other things to do too. Maybe have to do a little something else here or there if field of mathematics gets endangered again, but plan is soon NOTHING else, to fix. Can still talk things though. Is fun.<br /><br />Often have been forced to face things objectively, accept facts, and realize I'm lucky to have a role to play, and not think too hard about how big it might be or how strange it is. As then can feel all kinds of weird, which is not fun.<br /><br />Oh yeah, thankfully I haven't seen mathematicians trotting out mathematical arguments still under review as mathematical proofs that are delicate recently. If still happening, luckily not that I've noticed.<br /><br />I find that behavior undermines public confidence in mathematics. And be certain I consider that to be unacceptable.<br /><br />Mathematical proofs are NOT delicate. Never think otherwise.<br /><br />Mathematical proofs are absolute in a sense few things human beings can ever find can ever be.<br /><br />That will never change.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-78769935468661490042017-03-17T10:40:00.001-04:002017-03-19T07:38:27.860-04:00Critiquing math people realitySome tasks can be really difficult but really worth doing, even if you're not sure how it will all work out. Have learned to appreciate perspective and just working at things until done.<br /><br />So yeah back in 2003 I wrote a <a href="http://somemath.blogspot.com/2013/02/publishing-contradiction.html" target="_blank">paper which passed through</a> anonymous peer review and was published, where luckily paper is still available hosted by EMIS as part of its archive. And that paper looks correct. No mistakes under <i>established</i> mathematical rules. But its conclusion contradicts with very well established number theory! So you have to use a separate argument to know the paper must have something wrong.<br /><br />How is that possible?<br /><br />Forget that, how can that NOT freak out mathematicians?<br /><br />Since then I've noted, was demonstrating an esoteric and intriguing flaw with use of the ring of algebraic integers where that flaw is EASY to explain, but let's get back to that paper which has no errors under existing rules which can be shown to contradict with accepted number theory--how can that not just flabbergast mathematicians?<br /><br />Some may know that there WERE hostiles to my paper, which is SUCH an ironic thing to me, as they attacked it for doing what it was <i>supposed to do</i>. As they pointed out that by a separate argument it had an incorrect conclusion. The paper itself appears flawless--unless you know conclusion must be wrong.<br /><br />But um how is that possible? Can I ask that enough?<br /><br />The very ability of a paper to do such a thing challenges so much. And such a paper actually does stand alone. It should not be possible.<br /><br />The problem gives the potential of writing something that looks like it is correct, and checked against the established rules passes, which is nonetheless WRONG.<br /><br />To me more than a decade since that paper can find a way to get a bit of dark humor in the situation, which is very serious.<br /><br />Yes I critiqued the mathematical community--globally.<br /><br />If YOU could, would you?<br /><br />Did you pass? Or fail?<br /><br />Why would I test mathematicians all over the planet in this way? Why wouldn't I?<br /><br />It was a unique opportunity. Such an opportunity may never exist on this scale again in human history. Test mathematicians all over planet Earth with something THIS simple? Too cool.<br /><br />Yes, have struggled with the weight of it though, at times. Mathematics is so important for our world. Wondered the fate of our world if I failed. Wondered if I could fail--if reality would let me. Such concerns seem distant now.<br /><br />The test is perfect. Proper reaction is to understand that until fixed doubt can exist throughout the field of mathematics, though the problem does not exist for arguments that rely on fields. It only exists for number theory relying on the ring of algebraic integers.<br /><br />And it IS checkable by any mathematician as well as uses elementary methods. So a person doesn't have to be a number theorist, and other mathematicians have no excuse. And yeah I'm NOT a mathematician I note again. Is important, you know? Helps my detachment.<br /><br />Notice that the test remains until fixed as any math student can simply check the paper, and read through noting--<i>no error with argument under existing rules</i>. And then simply note that conclusion is false under existing number theory. <br /><br />Until things are fixed of course and is simply a matter of historical record and example is part of the curriculum for future math students.<br /><br />I have given the fix of course, which lead me to putting forward the object ring.<br /><br />So yeah the conclusion is wrong <i>in the ring of algebraic integers</i> but IS correct in the object ring.<br /><br />Oh, so how easy to explain? Imagine someone says they are only using evens and considering factors, so yeah 2, 4 and 8 are ok, and factor easily enough. But they trot out 6, and you say, NO! Because now with those rules 6 and 2 do not share factors because 3 is odd. And yeah evens are NOT a ring. And the ring of integers does NOT have this problem.<br /><br />But the ring of algebraic integers DOES have an equivalent problem which I've shown multiple ways and even given a full explanation lately. as apparently I just LOVE explaining it. So the problem with the paper is the ring declaration with which it begins.<br /><br />So why has the global mathematical community failed my simple test on the whole for so long?<br /><br />I do have theories.<br /><br />But not everyone really failed. My paper passed two anonymous reviewers and was published. Was chief editor who tried to pull later. And EMIS has kept it up. Am sure there are plenty of people out there who...I don't know. Maybe just figure there should be.<br /><br />And it could still take awhile. What's good now is EXPLANATION. For those who have wondered you can now finally see the <a href="http://somemath.blogspot.com/2017/01/refreshing-on-old-for-me-concepts.html" target="_blank">complete picture</a> that took about 13 years to fully get outlined by me. So much work too! But learned so much has been worth it.<br /><br />Now you can read not only the point of that paper that got published but see a full mathematical system explaining it all out in extreme detail. I think explanation is awesome. At least now people can know why.<br /><br />Reading through seems so dramatic though. Yup. And we are in the 21st century with new ways.<br /><br />To me am in a functional process where I see what works, and also it helps me to handle it all.<br /><br />Figuring it all out is a challenge so worth the effort.<br /><br />After all, our world's knowledge is what is important. And mathematics is important enough.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-58727780809004950862017-03-13T08:47:00.000-04:002017-03-14T14:34:37.277-04:00Some abstract reductionism demonstratedWith Diophantine equations in two variables you can see a LOT of apparent complexity with:<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 unknowns to be figured out, of course. But it turns out you can reduce which was known, but <a href="http://somemath.blogspot.com/2011/05/reducing-binary-quadratic-diophantines.html" target="_blank">my abstract reduction</a> methods make that easier in general to get to the basic form:<br /><br />u<sup>2</sup> + Dv<sup>2</sup> = C<br /><br />And with more generality than with other methods derived by Gauss.<br /><br />But on that form those same methods--iterate:<br /><br style="background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif; font-size: 14.85px;" /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">u</span><sup style="background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif;">2</sup><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"> + Dv</span><sup style="background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif;">2</sup><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"> = C</span><br /><br style="background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif; font-size: 14.85px;" /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">then it must also be true that</span><br /><br style="background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif; font-size: 14.85px;" /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">(u-Dv)</span><sup style="background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif;">2</sup><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"> + D(u+v)</span><sup style="background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif;">2</sup><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"> = C(D+1)</span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">___________________________</span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">And I decided to call that a binary quadratic Diophantine iterator, or BQD Iterator for short, and I find it <i>fascinating</i>. It stands alone in that you CAN verify it simply by multiplying out. And conceivably could have been discovered just by someone playing around but apparently was not.</span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="font-family: arial, tahoma, helvetica, freesans, sans-serif;"><span style="background-color: white; font-size: 14.85px;">Where yeah there are implications then of course for integer factorization too, which I usually don't like to mention, as EVERY integer factorization can be connected to an infinity of others, trivially.</span></span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">So now we know that the very complex looking expression, with integers, connects to very simple, and more formalized abstract reductionism makes that so much easier--was able to improve upon Gauss.</span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">And how many people can say THAT?</span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">I've played a lot with it, and you can see plenty of posts by clicking on the label below.</span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">That is just my favorite demonstration example of SOME abstract reductionism. Have pondered it for years. Why can find something one way which had NEVER been found by another? Maybe does help a lot when is EASIER from a formalized process. </span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">The point important to make then, being abstracted by a <i>process</i>, which I have used in more than one area. Just really easy to see quickly with certain things.</span><br /><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;"><br /></span><span style="background-color: white; font-family: "arial" , "tahoma" , "helvetica" , "freesans" , sans-serif; font-size: 14.85px;">James Harris</span>James Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-16801956046009591872017-03-06T08:50:00.002-05:002017-03-12T10:02:29.706-04:00Abstract reductionismRealized have developed expertise in certain mathematical areas because I invented a certain approach, though built on what came before. If you invent an approach then naturally you have expertise with it. And a consistent theme in much of my research actually is reducing to the most important elements which has been abstracted and standardized with modular algebra.<br /><br />That I rely on modular algebra is significant as often I see discussion is on modular arithmetic.<br /><br />And modular algebra offers stunning amounts of reduction as can be seen with my method for generally reducing binary quadratic Diophantine equations.<br /><br />So feel approaches in that area can be quite simply called abstract reductionism.<br /><br />Formalizing reductionism fascinates me will admit. And have done some additional work in that area to generalize what I call tautological spaces. The full system I call modular algebra symbology.<br /><br />Remarkably tautological spaces can be used to get to answers where they are not needed to be mentioned, so results can stand alone.<br /><br />My work in this area I believe flows naturally from foundations laid by Carl Gauss. In essence I just took modular in mathematics one step forward, and created a fully formed modular algebra.<br /><br />Modular is coming into its own as a key concept in the 21st century. Feel privileged to have my own place in that development.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-41508657882480018542017-03-03T16:53:00.000-05:002017-03-04T21:26:13.141-05:00Why went looking and found my prime counting functionNow I feel better as can fully explain a result which really floored me years ago, and turns out one of the first things that I'd harass myself with after I thought had something was: will that be it?<br /><br />Which <i>really irritated</i> me, and I wonder why I do these things. And yeah was also at the time still into that Fermat's Last Theorem thing but knew that the big thing was staring at me, I think. Is fuzzy as was over a decade ago, but to not have ONE THING I started playing around with counting primes.<br /><br />And few weeks or a couple as not so sure, later had figured out my prime counting function on which have discussed much on this blog, and that was August 2002.<br /><br />And then was like, oh so you're going to just have two things?<br /><br />It did relax me a BIT though as then I'd say to myself, well I have a backup.<br /><br />But reality was already had the sphere packing thing--I think. I can't find anything wrong with it, but still even now I don't claim that one SOLID on emotion. And I don't really need it, and it bothers me. Is too easy. How do I figure out something that Sir Isaac Newton didn't catch when he worked on same problem?<br /><br />And I don't need it. It'd be cool to have though, I guess. But that can work itself out over time.<br /><br />Maybe should admit that while I don't need for bragging rights, the approach I pioneered should have practical usage, and I suspect if so is probably being used.<br /><br />THANKFULLY, I finally stopped taunting myself with that, is that all you got?<br /><br />Which gives me more time to explain things.<br /><br />And laughing to myself, reading back through and I think is the weirdest thing, but is true! How do you go from thinking you have some great discovery to promptly taunting yourself to do more?<br /><br />Seems mean to me. But now is funny. So no, that wasn't all I had to discover. Now I'm like, I'm good. And inner voice is finding other things to mess with me over. Of course. Like that wouldn't be true.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-77769302081061464052017-02-26T10:41:00.000-05:002017-03-03T14:37:11.335-05:00More explanation for the curiousOne of the things I've noted often as is really important is that I found a way to show a mathematical result which follows established rules, so is in full mathematical rigor, which nonetheless leads to a conclusion which can be shown to be false. That is, the mathematical argument is perfect under established rules, but using those same rules you can use a separate mathematical argument to prove the conclusion is false.<br /><br />Which to me is rather fascinating. And you can check if you have knowledge of basic number theory by downloading a paper I got published where here is <a href="http://somemath.blogspot.com/2013/02/publishing-contradiction.html" target="_blank">link to post</a> that has a link to it, and have talked story often on this blog.<br /><br />What's cool is of course it stands on its own but for the curious can explain LOTS about how that's possible and implications for modern mathematics.<br /><br />What allows that actually is that the paper starts by declaring the ring to be the ring of algebraic integers. And the Wikipedia has an <a href="https://en.wikipedia.org/wiki/Algebraic_integer" target="_blank">article on the algebraic integer</a> for those who need a reference.<br /><br />While I'm NOT a mathematician, I stumbled across a problem with the ring of algebraic integers, where after YEARS can actually show very simply and won't give all details here, but is so short can enough.<br /><br />So consider <b>P(x) = (g<sub>1</sub>(x) + 1)(g<sub>2</sub>(x) + 2)</b><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 />Of course a simple <i>reducible</i> quadratic with those requirements is:<br /><br /><b>x<sup>2</sup> + 3x + 2 = (x+1)(x+2)</b><br /><br />And I can force symmetry by introducing k, where k is a nonzero integer, and not 1 or -1, and new functions f<sub>1</sub>(x), and f<sub>2</sub>(x), where:<br /><br /><b>g<sub>1</sub>(x) = f<sub>1</sub>(x)/k </b>and<b> g<sub>2</sub>(x) = f<sub>2</sub>(x) + k-2</b>,<br /><br />multiply both sides by k, and substitute for the g's, which gives me the now symmetrical form:<br /><br /><b>k*P(x) = (f<sub>1</sub>(x) + k)(f<sub>2</sub>(x) + k)</b><br /><br />If you want to see more, I found a really in-depth post where talk much more <a href="http://somemath.blogspot.com/2015/04/generalizing-non-polynomial.html" target="_blank">here</a>.<br /><br />The forcing symmetry is what does it really. As I put an asymmetrical form at the BOTTOM as the base, and then force a symmetrical one later, and that does it! So cool to me.<br /><br />Notice you have NO problems with our simple example:<br /><br />k(x<sup>2</sup> + 3x + 2) = (kx + k)((x+2-k) + k)<br /><br />But all kinds of awesome happens when you have non-reducible quadratics for P(x). That's when the fun starts.<br /><br />Turns out you can set things up so that it's easy to solve for the f's as roots of a monic polynomial with integer coefficients so they are DEFINITELY algebraic integers, but for the non-rational case you run into a problem with g<sub>1</sub>(x) = f<sub>1</sub>(x)/k as it forces one of the f's to have k as a factor.<br /><br />So you can force that factor into algebraic integers and then NOT be able to see it directly. Knowing is there from mathematical logic. So absolute proof tells you is there but no way to see directly.<br /><br />For example I often would show that 3+sqrt(-26) must have 7 as a factor for one of its two solutions which can seem strange if you follow human convention. But for example 5 + sqrt(4) is 5 ± 2 and equals 7 or 3. If that really bugs you not much I can do. Had wild arguments years ago where people would say that the convention is to take the positive so MUST be 7. And I'm like, what can you say to that?<br /><br />So you find that in such cases both g's can NOT be algebraic integers. And I used a neat trick, where the f's can be, but I constructed with a throw-away factor of k, which means if you remove it, and reduce, you're forced to have:<br /><br />P(x) = (g<sub>1</sub>(x) + 1)(g<sub>2</sub>(x) + 2)<br /><br />So you can't run from the problem. The algebra says you <i>can do it</i>.<br /><br />Logically it works! Is fascinating to me though, how human beings can struggle with it, and may be one of the best pure examples of such.<br /><br />There's no reason NOT to be able to do it, but our species didn't notice that over a hundred years ago in the late 1800's when coming up with algebraic integers, so it took me to show, in our time.<br /><br />Yeah it is just NOT intuitive to multiply by that k, and math folks get taught to go in <i>opposite direction</i>, removing factors if you can! Not adding them.<br /><br />So I went against the usual flow.<br /><br />And I showed how not knowing these things can let you use full mathematical rigor and come up with a wrong conclusion--in the ring of algebraic integers.<br /><br />So why would I get a paper published showing that?<br /><br />Well that was a great way to demonstrate, and may be the one key example known in human history to demonstrate the failure, where planned on a follow-up paper to explain the problem, thinking would have help from mathematicians, but that didn't happen.<br /><br />What can someone do with this error?<br /><br />Can appear to prove things with full mathematical rigor, which are NOT true.<br /><br />And yes, I talked the question on this blog: <a href="http://somemath.blogspot.com/2013/11/did-mathematical-rigour-fail.html" target="_blank">Did mathematical rigor fail</a>?<br /><br />Answer will go ahead and note here is, no.<br /><br />So yeah I had things not happen the way I expected. And was disappointed for years and acted out a bit online as well. But as time went on, I realized I had responsibilities and besides I could discover more things!<br /><br />Eventually I focused more on mathematical industry as healthy, which includes lots more people than mathematicians, as lots of people all over the world use mathematics. The problem I found is important but rather esoteric. It helps to be a number theory expert to fully understand it and its implications.<br /><br />And I am NOT a mathematician.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-77844729887104044322017-02-01T09:48:00.004-05:002017-02-02T10:40:08.861-05:00When connections can fascinateInterest from others has often intrigued me and on this blog my find of a deep connection between hyperbolas and ellipses is an area that keeps trending.<br /><br />Like I see a <a href="http://somemath.blogspot.com/2010/04/ellipses-hyperbolas-and-pells-equation.html" target="_blank">post where I discussed</a> much in 2010, which stays high in list of popular posts. Back then called what I now call the two conics equation "Pell's equation" which is one of those weird to me things described as a historical mistake. Problem was some guy named Pell didn't deserve credit? Then if is known, why keep giving to him? I followed convention for a while then stopped.<br /><br />For me my own results are too familiar so it helps to see what resonates with others. It's like, on any given day I can, if I wish, consider something I've discovered, but how do I choose? Looking at what interests others gives me a place to consider.<br /><br />So I discovered the connection and gave some examples.<br /><br />The connection is from x<sup>2</sup> - Dy<sup>2</sup> = 1, with D positive so you have hyperbolas to ellipses where it helps to see an example.<br /><br />Like consider: 17<sup>2</sup> - 2(12)<sup>2</sup> = 1<br /><br />and I have this key variable j, which is explained in the referenced post:<br /><br />j = ((17+2(12)-1)/2 = 20 is a solution giving:<br /><br />20<sup>2</sup> + 21<sup>2</sup> = 29<sup>2</sup><br /><br />And I notice that if D-1 is a perfect square relationship found connects to circles but otherwise gives non-circular ellipses.<br /><br />Also proved you can always find integer solutions for af<sup>2</sup> + g<sup>2</sup> = h<sup>2</sup> by using a <i>rational solution</i> to what I NOW call the two conics equation. In that post you see the other usage all over the place. And that is far as I can see one of the most consistently popular subjects for YEARS on this blog.<br /><br />But would be curious of any other situation where a rational engine drives integer and therefore Diophantine solutions. So yeah lots to ponder there. If you know of any other cases feel free to comment.<br /><br />Read referenced post for more, and also there are other posts with label tce, and that label can click below.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0tag:blogger.com,1999:blog-11119110.post-52940614428299950412017-01-25T07:37:00.000-05:002017-01-25T07:41:13.284-05:00When it seems impossibleFor those who read this blog you may realize that a conclusion I reached is that I found some new numbers previously not cataloged which should be impossible. And reality is I realized that back in 2003, and yeah to me is good to be at a full explanation level so quickly, now only around 13 years later.<br /><br />But that was the reason to figure out the object ring where a post talking it is the <a href="http://somemath.blogspot.com/2005/03/object-ring.html" target="_blank">FIRST post</a> on this blog.<br /><br />My feeling is that the assertion is so unbelievable that there are numbers that were missed that the greatest skepticism possible is required.<br /><br />So yeah, one <a href="http://www.emis.de/journals/SWJPAM/" target="_blank">dead math journal </a>in this story? Not a big deal considering.<br /><br />But is it true? The mathematical proof seems solid to me! But that's not enough.<br /><br /><br />James HarrisJames Harrishttps://plus.google.com/104012861017102472975noreply@blogger.com0