What is the Largest Integer Factored into Two Primes?

  • Thread starter Thread starter x_endlessrain_x
  • Start date Start date
x_endlessrain_x
Messages
11
Reaction score
0
hi! i am looking for the largest integer "n" had been factored into 2 primes.
eg. n=p*q where p,q are primes.

any idea?

thx
 
Physics news on Phys.org
Um, do you mean factored, or do you mean largest known n such that n=pq?

Not sure about the former. The latter probably grows by a couple of digits every week
 
yes, i mean the largest known n such that n=pq where p,q=primes

thx again
 
So really, what you're asking for is the two largest known primes. I'm not sure if this is the best option, but it's certainly big:
(2^{20996011}-1)(2^{13466917}-1)
is the product of two primes and has about 10 million digits.
 
this is where this should have gone :-p

no problem...

M^2 is the answer, where M is the largest known Prime.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
I Trouble understanding an online solution to an exercise in Dummit & Foote
Replies
16
Views
655
I Fundamental theorem of arithmetic from Jordan-Hölder theorem
Replies
5
Views
2K
I Localising a non integral domain at a prime
Replies
17
Views
1K
I ##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?
Replies
31
Views
1K
B Probability that 2 distinct integers are divisible by the same number
Replies
9
Views
2K
I Understanding the Results of gcd(x,n)
Replies
8
Views
2K
I How to Prove a Congruence Relation for Prime Numbers?
Replies
17
Views
2K
For ## n>1 ##, show that every prime divisor of ## n+1 ## is an odd integer
Replies
9
Views
2K
Show that 13 is the largest prime that can divide....
Replies
7
Views
2K

Hot Threads

Recent Insights

Back
Top