first off, one of the requirements of A is that it only has prime factors less then or equal to x.
secondly, I already know that it is very possible for an example such as you have given to exist. What I want to know is:
Are there PARAMETERS that make it impossible for floor(B/A) to have common...
ok. hmm...
say you are looking at floor(B/A)
based on B and/or A, is there anyway to determine the factors of floor(B/A)?
specifically B will be equal to x! (x factorial for any x that is a pos int) with all common factors of A removed. A will be x-smooth, less than B, and based on the...
Yeah exactly: I'm looking for a function G(x,y) that would work exactly like the example you gave. G(2^10, 2) = 2^10.
The Algorithm would be extremely useful to me personally. I'm looking for as nice and clean and simple a function as possible. The best example i can think of so far would...
ok let me be more specific:
first off i am looking for a mathematical algorithm, something that could exist outside of a computer program
secondly, the equation given was purely just an example. What I need is an algorithm "G(x,y)" where, given two functions (a first function "x" and a second...
ok so is there a function that exists (for all intents and purposes let's call it G(x,y) )where
x= a^2*b^4*c
y=a^4*b^2*d
G(x,y) = a^2*b^4
basically gcd, but the exponents match those of the common prime factors of the first input (x)
********
equally useful would be a function where the...
hey so
if you are taking a floor function of a fraction >1, is there any way to predict anything about it's factorization?
what about when the numerator is a factorial and the denominator is made up of factors that divide said factorial but to larger exponents then those that divide the...
i'm trying to find a version of PARI or PARI/GP or a comparable number theory program that will run on my MacBook Pro.
if anyone knows of a site with an updated version or an emulator that will get older versions of PARI working on my computer or newer and better software for testing out long...