Python factorisation help please

Hi, could someone tell me how to write a program that finds the primes p and q that multiply to make a number, n. e.g. 80209 × 92683 = 7434010747?

Please don't repeat threads. @ghostwalker gave a good starting point in your other thread. Post what you've done so far. It should be one loop and a couple of lines in the body.

I have
import math
def prime_multiplier(n):
n = p*q
if p / 3 <= sqrt(n)

Now what?

No real idea of what you're doing
* Why define a function? You're obviously just beginning to learn?
* You're doing the inverse of what you want. Given n, find p & q not the other way round
* Where is the loop, where is a zero remainder test, ...
As with all programming problems, it's better to start small and build it up. So why not get it working for the two prime factors of 35? Hard code numbers etc where necessary, but try a simple loop and decision. Also, Im not sure if you're clear about what the algorithm is you're trying to implement.

I don’t get your first two questions there?
I don’t know what a zero remainder test is?
No I’m not sure, we have to investigate the time taken to factorise a number that’s the product of 2 primes but I don’t know how to go about this.

A zero remainder test tests to see if the remainder is zero.

15%3=0

15%2=1

As you're just starting out with programming why not try a few simple exercises?

The following would do for a start.

Can you write a program that allows you to input a number and print the square root of the number?

yes I can I’m not that bad at python

Turns out what I did for the first question is completely wrong we're meant to use Bezout's identity?
ed+by=gcd
But ed=1+A(p-1)(q-1) where A is a constant and I've never used this formula before, nor do I know how to find A.
Could someone help please?

If you want to create a function where two numbers share the same GCD then you could define a function def prime_numbers( m,n):
# For both numbers to share the same factor use integer division (n) div (m) implies that any natural number divided by another natural number greater than 0, means m > 0.
Therefore define your function, def whatever_function(m,n): , use the if statement (m == 0): # first condition
return n
else: return whatever_function(m, # Second condition modular arithmetic)
Then assign values to variables let's say x,y , x = int(input("Enter num1: ") and y = int(input("Enter num2: ") and call the function with print(whatever_function(x,y)). So when you run it, the program will ask you to input two numbers and return the Greatest Common Divisor.
Alternatively you can use lambda functions and compare the run time.