Trurl

Senior Members
  • Content count

    136
  • Joined

  • Last visited

Community Reputation

13 Neutral

About Trurl

  • Rank
    Quark

Contact Methods

  • Website URL
    http://www.constructorscorner.net

Profile Information

  • Gender
    Not Telling
  • Favorite Area of Science
    applied mathematics
  1. The Fly

    Ok, I have a thought experiment; a visual model. I used to run daily. I would run down the trail at an 8-minute mile. Somehow a fly that has a maximum speed of 5 mph lands on my neck. I swat the fly and it leaves my neck. Accordingly, I increase my speed to a 6-minute mile. The same fly somehow lands on me again. Every time it leaves my body from my swat in comes right back. The thing to ponder is that the fly moves slower than me yet can intercept me and after intercepting me leaves my body only to intercept me again. What are some physical properties behind this? I would like to get a variety of answers. But to show what I was thinking: suppose drones were set up to intercept a jet aircraft or missile. They don’t have the speed to match the missile or time to acquire exact coordinates. Could a drone intercept a missile as the fly has intercepted me (multiple times)? And would being able to intercept multiple times solve the problem of finding exact coordinates of the missile?
  2. Collatz Conjecture

    I think I have an understanding of what you are doing with factoring. You just want it in that form. I would like to see an updated proof, since this thread has so many explanations. This is the first time I saw this conjecture, so I hope some experts on this forum take interest. The problem is worth working through. Right or wrong it is a fresh approach. Just because the conjecture is unsolved does not mean the idea isn’t valid.
  3. Collatz Conjecture

    I think the approach is brilliant and maybe simple enough to work. But I am still not convinced. You take 2 to a power and multiply by Prime factors. I agree that you can build any number this way, but I don’t believe multiplying by 2 here is the same as dividing an even number by 2 in the conjecture. The order of operations. And I cannot test this algorithm in a computer since we cannot factor the numbers in this series. Again I’m probably wrong but this is not a linear series. My understanding is that you are building a pattern linearly and the conjecture is not a one-to-one function. This is just my understanding but if you can prove your method does this I will buy multiple copies when you get it published.
  4. Collatz Conjecture

    Ok, I’m listening. Where does this go from here? This is how I understand you: Add 1 to a Prime number and it can be written as a power of 2. Since all Composite numbers factors are Prime numbers, those Prime factors added to 1 reduce to a power of 2. This will reduce to 1 and prove the conjecture. Your job is to prove this is possible. My question is how do you factor the Primes and apply the conjecture without changing the value of original number. By this I mean you factor the number into two Prime numbers and add 2 (+1 each Prime) to coverage to 1 and prove the conjecture. But at the same time you did not apply 3x +1 to the original value breaking the series. I am probably wrong again. I just don’t follow the modifications to the conjecture series. I’m am just making clear if I am following what you are doing. But if you explain this, I’m onboard. I am still looking at the original proof to make sure my question made sense. I am not completely sure of all the functions affecting x. But if the above question is confusing I will simply ask this: Are you breaking the rules of the conjecture by apply functions?
  5. Collatz Conjecture

    Ok here is what I don’t yet understand. Try a series for 85. In your example you would multiply by 3 and add 1. This would find Prime factors for the new number and not 85. I believe that would make it hard to factor Primes or semi-Primes. But then again I don’t have a full understanding of the problem. You are the expert on this problem. This is your problem. I am just making you defend and explain it more clearly. Also I took interest in you explaining your idea. I don’t know if you are right or wrong. A mathematician must decide for himself if a problem is worth pursing. But if it doesn’t work on first explanation don’t give up. If x is even divide by 2 If x is odd multiple 3 add 1 gives you even so divide by 2 still even divide by 2 till equals 1 The conjecture shows a relationship in factors but does not show those factors. Let me know what you think. I am problem wrong in the understanding of this problem. But that is ok. It just leads to more discussion.
  6. Collatz Conjecture

    I am also an amateur mathematician. I agree your last example equals. But with all these posts the thread is out of control. I have read 3pages but all these changes confuse the reader. I know it is for your benefit to improve your proof, but I can’t understand it. I know it is bad practice to work with only limited examples, but could you show from the beginning an example? Here is an excerpt from the book Primes and Programing “The fundamental theorem 1.1 has a simple look about it, and indeed it is nice to know that every number greater than 1 is prime..or factors into primes. But actually finding the factorization…(or primality) can be very hard.” I request a through example because I don’t know what is the given and what we are solving. I think an example will show what you are describing and what variables we know. Can you write in 2 sentences what is the goal of the Proof. (A short abstract) Again I am also an amateur mathematician but for your proof to work everyone must understand what you are attempting to show. I like to work with examples when trying to understand series.
  7. Collatz Conjecture

    Are you saying that to add 1 to a number divisible by 2 will make it odd? And if you can determine if this odd number is a semi-Prime the Prime factors must be less than 2 to the power of the semi-Prime? My question is what way did you use the conjecture to solve the problem of factoring? This will increase in difficulty with larger numbers. Lemme 2, lines 48 & 49 lost me.
  8. Prime Products just one last time

    As you know I have a complex equation describing semi-Primes. The fact is I cannot at this time solve the polynomial. But instead, it is more of a guessing attack to discover Prime factors knowing only N. What I have discovered is more of a series. It only works with Prime factors. More importantly, the series works with the same Prime factor multiplied by other Prime factors. So: · The series is a guess attack, comparing N to computed N. · The series only works for semi-Prime factors that are Prime numbers. · The series works for a given Prime number and infinite other, different, Prime number factors, multiplied for different results of different N’s. (If the equation did not work for multiple factors, multiplied by the same factor, the equation would be useless.) · The equation that produces the series can be used to test if a number is truly Prime. Other significant facts of the equations: · The equation is too complex and factors with imaginary numbers. · The equation is simple algebra. · Even though the equation cannot be solved with a perfect mathematical answer, the series is beneficial to computer algorithms. · The equations may have relationships to logarithmic spirals. I have been working with Prime numbers and Logarithmic spirals since 2006. But have recently tried to switch my efforts to other projects. I haven’t posted to SFN for 5 months, in this thread. But instead of trying to defeat RSA and use my math series to factor p and q knowing only N; there is a twist. If you know p (also what I usually refer to as x), you can test to see if it is a Prime number by multiplying by Prime number test values. If the equations hold true, then a test for Primality exists. https://www.3dbuzz.com/forum/threads/200441-New-One-Way-Function I don’t know if anyone believes me when I say this series is significant. But I posted the link to me “old” work from the time before I found the more useful equations. Much of that work is just plain wrong. But it will show you how I ended up with the equations I promote now. So, if you think there is any meaning to my equations, please post me a message in this thread to let me know. I will respond with more information.
  9. How to get ,The Area of Trapezium from Triangle.

    Congrats on the minor discovery. Any discovery however little, is significant. But the next thing I would do is see where the discovery applies. It may seem like a simple polygon, but it is also a geometric construction. (What I am calling is using drawing and geometry to form shapes with measurable properties. Like dividing a line in half with 2 arcs of a compass.) I know it seems like the use for drawing this way is minor. However, what if this drawing method was applied to computer graphics. Imagine drawing a polygon mesh in 3DS Max and have that mesh be measurable by your polygons. It is difficult to come up with a major application, because this isn’t my design, but if you expand it to polygons of more sides with the inside of those polygons measured; you’d have a brick to build a polygon block and measure it at the same time. Now that isn’t a little discovery.
  10. I hope this is the right place to post this, but where is imatfaal? I always enjoyed her comments. I wanted to get her opinion. I don't know her. She could be anyone, as this is an Internet forum. But I was wondering why she hasn't returned.
  11. What is the Infinitesimal sign?

    I was wondering this the other day. How many infinity symbols are there? There is the car Infinity whose symbol I'm not sure what infinity it is. I wonder if infinity has the most symbols representing it than any other math symbol. For example this is infinity:
  12. Prime Products just one last time

    Ok, this is my final post to this thread, unless someone asks a question. I will continue to work on this problem. And I thank the community of SFN for letting me share my math problem, even when it sounded impossible. I wish more would have commented. As of this post it has been viewed 10,500 times. That is a significant amount. I am also asking permission to use my post in other writings. I know the forum is free, but is it still permissible to use those posts of members who ask questions? I am using them only so my posts make sense, in the proper context. Anyway, I hope you have enjoyed the work I put in on these posts. And I hope I made you believe that reversing the N = p * q problem is possible. But often in math, the idea is just as important as the solution. If you did not believe me these equations would solve anything, perhaps you considered it for one moment. Now that it has concluded, feel free to post any of your thoughts. I thought this problem would lead to great conversations. Don’t let a math thread get less response than one on astrology.
  13. Prime Products just one last time

    In[50]:= PNP = 85 x = 5 F = Sqrt[(((((x^2*PNP^4 + 2*PNP^2*x^5) + x^8)/ PNP^4) - ((1 - x^2/(2*PNP))))*((PNP^2/x^2)))] Out[50]= 85 Out[51]= 5 Out[52]= Sqrt[4179323/2]/17 In[53]:= N[F] Out[53]= 85.0333 Ok, the important thing about the above equations is equation F is the Cumulative Distribution Function of the factors of PNP! The values below are to show that with the proper x, F will equal (within small error) PNP. This is just to show that it works for Semi-Primes that are a little harder to do on a calculator. If someone knows how to program large numbers: millions of digits, then they could find larger Prime numbers or break encryption that use factorization as a one way function; RSA for example. But wait. If you put F into the following programming logic you have created a Normal Distribution Function! If [PNP - F > 0, x = x + Sqrt[PNP - F + x]] If [PNP - F < 0, x = ( x - Sqrt[F - PNP + x]) /2 ] These logic statements create a normal distribution when graphed. Of course it is centered at zero and can be used to correct the error of equation F. But we must note it is mirrored in the x-axis. But know we know where the distribution of the smaller factor that is multiplied to equal PNP. We have a Bell Curve; almost. I am only calling it that because that is what is usually though of with normal distribution. But I think as you read this it may add more credibility to my work. In[41]:= PNP = 2999* 6883 x = 2999 F = Sqrt[(((((x^2*PNP^4 + 2*PNP^2*x^5) + x^8)/ PNP^4) - ((1 - x^2/(2*PNP))))*((PNP^2/x^2)))] Out[41]= 20642117 Out[42]= 2999 Out[43]= Sqrt[40378385476407827918859/2]/6883 In[44]:= N[F] Out[44]= 2.06434*10^7 20180213NormalDistribution7PM02.nb
  14. Prime Products just one last time

    This is a question to the mathematicians on the forum: when you're trying to solve an open problem in pure mathematics, what are the first things you do? Do you test the conjecture with a few example problems? Do you look up recent theorems related to the question, or do you just dive right in? I wanted to answer your question without killing your thread and leave it to professional mathematicians to answer, so I answered here. I do math for fun. And I choose my topics simply by what interests me. I use an intuitive method. I try to picture the problem completely and think if I have any techniques that will take me in the direction I feel that will solve the problem. But most likely will revel other problems and become a learning experience. Now with the Internet, math research is easily accessed. This is great to research, but it often leads to an overwhelming amount of information or confusion when piecing together conflicting evidence. This is why finding your “own” problem you want to work on is difficult, because the start point is a judgement call. But nothing helps with math problems than just searching and solving as many as you can. The process comes with practice, because you must develop a personalized technique. I have read books on “Flow” where a psychologist is trying to figure what makes someone creative. I think it helps to know how they approach a problem and though processes they go through. But I also think you can be consumed by someone else’s methods while it is more important to develop your own. I will give you an example on a problem I want to research. Everyone is mining Ethereum, the most popular digital currency. I have been working on an algorithm that will test values to see if they are factors. (Yes, I know it needs improved.) So, the first thing I look at is the enciphering protocol that Ethereum uses for its contracts. I have a little understanding of RSA, but a search reveals AES is used. I look at AES and more reading reveals that this encryption standard is well proven and nothing to do with factoring. But more reading on Wikipedia gives me a layman’s explanation on how substitution and movement in many iterations across matrices. Ok so I have a little knowledge of matrices from linear algebra. And I know a public key is used to encipher the message. But there is no way I can solve the pattern the computer enciphers with. But I look to what I know. We often use matrices to solve vectors. And if I took plain text and enciphered it with the known, public key it may show more than expected. If I could somehow give values to the plain-text and treat it as a vector addition, isn’t the public key the resultant of the matrices. I know there are a lot of unknowns here. And the idea is just a hunch; an intuitive idea. But that doesn’t mean the hunch does not need explored further. But what if a free-body-diagram with the forces being “movements of data” and the result force being the public-key. I know the idea probably won’t work. I just wanted to share an idea and how it can lead to something worthwhile. For this reason, I put so much effort in “The Products of Primes” here in this thread.
  15. Prime Products just one last time

    Taking a break on rather you agree or disagree that my equation has any value to the products of semi-primes. Back in 2003, I was with a group of friends whom were killing time. There was talk about a simple check-book-balancing sheet. However, the discussion was not yet about math and we were not doing school work. But we found ourselves in a common room that had a clock. Somehow someone in our small group noticed this clock was different from his wrist-watch. After everyone became interested, someone in the group ask if both clocks continued to run how much would on clock have to lose each hour to eventually have the same time as the other clock. Yes, I now know we were discussing the modulus. However, there is a twist here. The test to see if the times will ever be the same is testing to see if the times are relatively Prime to each other. Also, if you pick the time lost in order to synchronize the clocks, you may actually increase the difficulty of the problem. But what if you add more clocks or use smaller time increments such as seconds and fractions of seconds. I know this problem, though original to our group, has been thought of before. But this problem is an extension of the common modulus represented by a clock. This may be significant to the semi-Prime products, because the problem of many small clocks is the same one to find products. Let me know what you think. I wrote this, and I think it has some solid thought. It has been awhile since we had this idea and I hope a recall it factually. The important part is that the idea stuck with me. I tried to keep the description short here. Adjusting one clock will affect how the other clocks need adjustment. I think the multiple-clock-description fits nicely with cryptography.