Can a New Formula Factorize Large Prime Products in a Single Step?

  • Thread starter Thread starter smslca
  • Start date Start date
  • Tags Tags
    Work
smslca
Messages
63
Reaction score
0
Sorry if I am posting in the wrong section. I do not get where to post this query in the forum.
So I am posting it here.

I am working on factorization of prime product from 5 months. As I have no partner and being an average student It has been 5 months to get a formula and verifying it.

I have a formula to factorize large numbers like 244,691,047,451 into two factors in a single step. I can't really promise as this work is not already there. But as internet as a limit , I have searched it I found no traces of my work. Also I won't say It is the best work for factorization at present. Because my work is not checked by anyone and I got not mathematics lecturer neat to me and who can understand me. And the work now is in an uncomplete state to give it to websites like arxiv.

How large the number may be the numbers following the pattern of above number is only factorized in single step. Others need two, three and so on to factorize . What I mean is some times large numbers like above(244,691,047,451) require single step to factorize and small numbers like (581) require 3 steps to factorize.

But by doing further work on it can simplify other numbers into single step. May be As being a student, having my subjects to study or may be due to weary in the persistent work, I think Now need help of some one talented like teachers or professors or researchers or
students, I meant anyone.

So I am free now, For masters electronics and communication student I have applied to colleges in USA, So If I am qualified in visa interview , I should go to USA in the month of August. I said it because I want help before August.

As I believe there will be people from India browsing this forum. So I request anyone from INDIA, Andhra Pradesh, could help me.

My name is manikanta, I am from INDIA, Andhra Pradesh, West Godavari District , Eluru.
contacts: Landline :.. do not post phone numbers...
U can surely catch me up on landline, But Iam not sure about mobile.
 
Last edited by a moderator:
Physics news on Phys.org
Wow, you're posting all over! Here, mymathforum, sciforum, edaboard, boards.ie, ...
 
CRGreathouse said:
Wow, you're posting all over! Here, mymathforum, sciforum, edaboard, boards.ie, ...

yes I posted it because I need help personally. And there is chance that a member in one forum is not in another and viceversa.
 
further more it can factorize 56731475920891=7532027 * 7532033 in one single step.
 
you mean you CAN factorize a number into 2 primes ??

n=p.q i am not an expert in the subject so i can not help (sorry) but perhaps you should check your factorization time of your algorithm and compare it with others
 
##\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...

Similar threads

Replies
3
Views
1K
Replies
2
Views
1K
Replies
12
Views
2K
Replies
7
Views
3K
Replies
6
Views
4K
Replies
7
Views
4K
Replies
7
Views
3K
Back
Top