Real number Factorization Problem

Question

I know that Integer Factorization Problem is NP-Hard. It is very importance for RSA Cryptosystem. Let p and q are prime and $N=pq$, if we know $N$, it is very difficult to compute $p$ and $q$. However, what happen if one of them is a real number or at least not prime?

In detail, If we know the product $KR$ of a real number $R \in \mathbb{R}$ and an Integer number $K\in \mathbb{Z}$, is it difficult to compute K and R? Anf if it happened, how this assumption could be prove?

Answer 1

That problem has infinitely many solutions because $KR = (Ki) \cdot(R/i)$ are solutions for all $0\neq i \in \Bbb Z$.