Recent content by Bellarosa

  1. B

    Add & Subtract Fibonacci Numbers: Explained

    just a correction ...I am trying to subtract f(2n) -( [f(2n+1)] - 1)
  2. B

    Add & Subtract Fibonacci Numbers: Explained

    [b]1. Can somebody please explain to me how you add Fibonacci numbers using the indices? [b]2. For example: f(2n+3) + f(2n) I am actually trying to subtract f(2n) - f(2n+1) - 1 I really have difficulty understanding Fibonacci numbers.
  3. B

    How to use the Euclidean Algorithm to find the gcd?

    or is it because I ended the last entry wrong...should I continue as follow? 5 = 1(3) +2 3 = 1(2) + 1 2 = 1(2) + 0 why can't I just end it at 5?
  4. B

    How to use the Euclidean Algorithm to find the gcd?

    ok I am using the Euclidean Algorithm to find the gcd of 111 and 169 which I know is 1 but the EA says otherwise 169 = 1(111) + 58 111 = 1(58) + 53 58 = 1(53) + 5 53 = 10(5) + 3 5 = 1(5) + 0 I can't understand why I am getting 3 when 3 does not even divide 169, neither does it divide...
  5. B

    How to use the Euclidean Algorithm to find the gcd?

    Ok I knew the answer couldn't be negative and I think I missed what the problem was saying by focusing on the general way of solving these types of equations. Just to be clear, are you saying that because we are given the amount of yens both in US and Cand. that all i have to solve is 122 x +...
  6. B

    How to use the Euclidean Algorithm to find the gcd?

    ok I think I see what I missed...there are two equations x + y = 15286, and 122 x + 112y = ? I don't know exactly what it should be... I know I am missing something but I can't quite figure it out
  7. B

    How to use the Euclidean Algorithm to find the gcd?

    [b]1. A Japanese businessman returning from a trip in North America exchanges his US and Canadian dollars for yen. If he receives 15286 yen, and received 122 yen for each US and 112 yen foer eac Canadian dollar, how many of each type of currency did he exchange? [b]2. I know in solving this...
  8. B

    Understanding Even Permutations in Abstract Algebra

    want to figure out whether a permutation is odd or even...my textbook gave the example (123) = (12)(13), (123) = (13)(23)(12)(13), (123)= (23)(13)(12)(13)(12)(23) they called it the factorization as a product of transformations. Now I see that (123) is even because for each factorization there...
  9. B

    Understanding Even Permutations in Abstract Algebra

    [b]1. This is not a question it's an example. [b]2.The permutation (123)= (13)(12)= (13)(23)(12(13)= (23)(13)(12)(13)(12)(23) is even. [b]3. I got the frist one because it is the product of tranposition...I just don't get the rest. I know that it is even depending on the number...
  10. B

    Number Theory - Elementary Cryptology

    ok I was just on this page the answer is 223...is there another way besides using the Euclidean Algorithm? just curious
  11. B

    Number Theory - Elementary Cryptology

    one more thing... finding the inverse is something I never get...for example 31x is congruent to 1 mod 6912
  12. B

    Number Theory - Elementary Cryptology

    ok ... I got it...I forgot to divide 6561 by 247...
  13. B

    Number Theory - Elementary Cryptology

    aren't you suppse to square 81?
Back
Top