Author
contains
Subject
contains
Message
contains
Date
any
to
Special notice only

## 37 results from messages in primenumbers

• ### Re: Fermat's factorization

Hi Hugo, Thanks for your reply, and for your and one other member's followup private correspondence to me. It prompted me to do the obvious thing, which was to generate longer lists of x,y coordinates for both the actual data generated using Fermat's theorem[1] and the polynomial function by choosing more difficult numbers to factor, and sure enough the actual begins to differ from...
Ron Feb 7, 2007
• ### Question on modification of Fermat's method of factorization?

A problem regarding a variation on Fermat's method of integer factorization has been bugging me that I'm hoping someone here can help with. I'll start out with the questions, and then describe the problem: 1. What is the name (if any) of the technique described below? 2. Is it fundamentally sound, or have I made an invalid assumption somewhere? The Problem: I noticed that when the...
Ron Feb 6, 2007
• ### Quantum Computing

There's a pretty interesting discussion of quantum computing over at: http://science.slashdot.org/article.pl?sid=06/08/20/0417218 You have to sift through a lot of chaff to get to the good stuff, but a few people seem to know what they're talking about. You might even want to chime in and correct some of the misinformation. I'm RKBA in the thread, BTW. Ron
Ron Aug 21, 2006
• ### Line and integer point?

Suppose you are given the equation of a line (y=m*x+b, with known m and b) that passes through only one point in the Cartesian plane with integer coordinates, and are asked to find that point. Could you? Are there any potential approaches to the problem? It's probably a naive question and I assume the answer is no, that there is no way of easily finding such a point, but I couldn't...
Ron Aug 14, 2006
• ### Re: Search Power of PARI/GP

--- In primenumbers@^\$1, "Roahn Wynar" wrote: > I am looking for composite numbers with certain properties Such that the factors have the same number of significant binary bits perhaps? ;-)
Ron Jun 24, 2006
• ### Clarification and example

In case I haven't expressed my prior question clearly, here is a very simple example of what I mean by the multiplication of two binary polynomials. In the example below, the multiplication sign (*) means boolean AND, and the plus sign (+) means boolean XOR. Let: a= a2*2^2 + a1*2^1 + a0*2^0 b= b2*2^2 + b1*2^1 + b0*2^0 r= r5*2^5 + r4*2^4 + r3*2^3 + r2*2^2 + r1*2^1 + r0*2^0 Then for...
Ron Jan 27, 2006
• ### Multiplicative inverse for prime multiplication?

Since it's possible to multiply two prime binary polynomials together in order to obtain an exact result (if we ignore the ordering of the multiplicands) via a system of boolean (base 2) equations, is it safe to assume that those boolean equations must have an inverse (even though they're non-linear)? If so, has anyone looked for this inverse and what is it called? Thanks, Ron
Ron Jan 25, 2006