Finding GCD of x,c,y,z: Fast & Easy

  • Thread starter Thread starter smslca
  • Start date Start date
  • Tags Tags
    Gcd
smslca
Messages
63
Reaction score
0
can we find the value of gcd(x c y , z) easily and very fast using a computer.

where
1. "c" represents "combinations" used in 'permutations and combinations'.
2. x is very very large number (ex: may be of 100 or 1000 numerical digits)
3. y is also large having 2 to 5 digits less than x.
4. z is also large having the same number of digits as x.
 
Physics news on Phys.org
What are some ideas that you have?

Not having put much thought into this, I would try to use the formula for C(x,y) to try to determine the prime factorization.
 

Thread '##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?'

I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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 '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 »

Similar threads

I Understanding the Results of gcd(x,n)
Replies
8
Views
2K
Factorize x^2 - z*y^2 with Gcd(x,y)=1, Gcd(x,z)=1, Gcd(y,z)=1, and z squarefree
Replies
15
Views
6K
I Did I figure-out z-translation of 2D-coordinates correctly?
Replies
4
Views
2K
I Dfns group action & group, written in terms of the other
Replies
26
Views
373
I Find f(z) given f(x, y) = u(x, y) + iv(x,y)
Replies
8
Views
247
How Many Values of i Change the Degree of gcd(f(x,i), g(x,i))?
Replies
6
Views
5K
MHB Is $C[x,y,z]/<y-x^2,z-x^3>$ an Integral Domain?
Replies
1
Views
1K
B Complex Number Solutions for |z+1| = |z+i| and |z| = 5
Replies
5
Views
2K
Find the constrained maxima and minima of ##f(x,y,z)=x+y^2+2z##
Replies
2
Views
1K
How many men, women, and children are there?
Replies
5
Views
2K

Hot Threads

Recent Insights

Back
Top