Need program for operating on 200-digited numbers

  • Thread starter Thread starter jobsism
  • Start date Start date
  • Tags Tags
    Numbers Program
jobsism
Messages
115
Reaction score
0
Hey guys! I desperately need a software for performing operations on large numbers (some 200-digits), and as I have no knowledge of programming, I think a complete software package is what I'm looking for.

I think I am onto something regarding the integer factorization problem, but I have no means of checking it for large numbers! It would be of great help to me, if you could list out some software packages (I have no idea about any of them!). Please provide links as well! Thanks :D
 
Physics news on Phys.org
I think you should test your program with smaller numbers ( like a 50 digit number ) before you move to bigger number. Here's a site which you can use to test the results from your own program:

http://www.alpertron.com.ar/ECM.HTM

It's fast and already tested. But I would not feed it a 200 digit number though.
 
you could use the groovy language which can handle Big Integers of arbitrary digit size:

Here's and example script for powers of two:

BigInteger ans = 1g
1000.times { ans=ans*2; println ans }


I run it in the GroovyConsole app and it generates some pretty huge numbers with the last ans being 303 digits long.

Groovy is a scripting lang that extends java with features some wished were in java.

Be aware that handling huge numbers is considerably slower than traditional computer datatypes like int and long or float and double.
 
Python can handle arbitrary digits off-the-shelf.

Code:
>>> 10**300
1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000L
>>>
 
##\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...
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...
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...
Back
Top