?gcd(x c y , z)

  • Thread starter smslca
  • Start date
  • #1
64
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.
 

Answers and Replies

  • #2
828
2
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.
 

Related Threads on ?gcd(x c y , z)

  • Last Post
Replies
13
Views
10K
  • Last Post
Replies
5
Views
3K
  • Last Post
3
Replies
59
Views
11K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
11
Views
3K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
15
Views
9K
Replies
6
Views
9K
  • Last Post
Replies
2
Views
2K
Top