i would like to solve these 2 problems ..(adsbygoogle = window.adsbygoogle || []).push({});

let be p and q two primes so n=p.q is known and we must determine the primes p and q is so easy as solving the system

[tex] n=p.q [/tex] and [tex] \sigma _{1} (n)=1+p+q+n [/tex]

with 'sigma' the divisor function that gives us the sum of the divisors of a certain number 'n' but is really so easy?

the second question is given the congruence [tex] f(x)=0 mod(p) [/tex] and N(x) the number of solutions of the congruence above on the interval [0,x] is there a generating function (of any type) to compute N(x) ??

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# 2 questions about numbers

Loading...

Similar Threads for questions numbers | Date |
---|---|

Question regarding imaginary numbers and euler's formula | Aug 26, 2012 |

Number theory divisibility question | Aug 12, 2012 |

Prime numbers : a math question for the pro | Jul 24, 2012 |

A Question About Prime Numbers and Goldbach's Conjecture | Jun 21, 2012 |

A Question about p-adic numbers | Jan 11, 2012 |

**Physics Forums - The Fusion of Science and Community**