Recent content by mikky05v

  1. M

    Solve Calc 1 Story Problem: Marathon Runner & Park Trail

    Alright I tried drawing it out but I don't think I see what you're going for here. I found r=25π but I am not seeing what to do with any of the rest of this. What type of problem is this? Maybe I can look up some information on the sections it's into help figure it out. I was thinking...
  2. M

    Solve Calc 1 Story Problem: Marathon Runner & Park Trail

    I'm attempting to help a tutoring student with this problem and I'm having trouble figuring out how to do it. 1. Homework Statement A marathon runner likes to practice by running in a large park that has a perfectly circular trail, with circumference 50 kilometers. She runs at a constant...
  3. M

    Operations research formulation question

    attempt 2: trying a strategy used in some solved problems from the book Objective: maximize the number of magnets, z that can be produced in a 10 day period if neither factory can be open more than 7 days (I don't know how to fit this into the problem, it sounds like a constraint but I don't...
  4. M

    Operations research formulation question

    I'm not sure where this subject is supposed to go but it seemed to fit better here than in calculus and beyond. Homework Statement Formulate the following problem and then use desmos or guess and check to solve it: The magnetic attraction company produces large and small magnets at 2 different...
  5. M

    1:1 correspondance between ints and ration

    I think i just don't have any background in what you are talking about. I understand on the surface what you are saying but "We can induce a bijection between positive integers and positive rational integers using any bijection between nonnegative integers and integers. For example if p(x) is a...
  6. M

    1:1 correspondance between ints and ration

    This explanation is still really confusing to me. i found the notes from a few semesters ago and I think the proof I am looking for involves basic countability. this is the video we watched and I know we went into how to prove this but I can not for life of me remember it or replicate it in a...
  7. M

    Discrete proofs involving divisibility

    umm I am given n is a linear combination of a,b and I am trying to show that n is a multiple of gcd (a,b)?
  8. M

    1:1 correspondance between ints and ration

    Your method may be a little to advanced for me. I am having trouble following what you're doing. Do you ha e a link to a website that explains this method or do you know a method in simpler language?
  9. M

    1:1 correspondance between ints and ration

    this isn't a homework problem it's just something our professor mentioned today that he didn't know how to do and I was curious. How would you go about proving that there is a 1 : 1 correspondence between the set of positive integers and the set of positive rationals. I think it would...
  10. M

    Discrete proofs involving divisibility

    n-sa=tb where do i go with that?
  11. M

    Commutative rings and unity element proof

    i think I got it! Suppose; 1Er=r ∀ r∈E. 1E2=2. since 1E can be written as 2k for k∈Z we have,(2k)(2)=2 this implies that 2l=1, which is false for ∀l∈Z. Contradiction Therefore, E does not have a unity element Does this look sound?
  12. M

    Commutative rings and unity element proof

    the cases were a guide I found to solving the same problem . I'm not entirely sure what they were talking about but it was about the exact same problem so i thought they might be important. What you are saying makes sense tho. I'm not sure where you are going with your question, are you saying I...
  13. M

    Commutative rings and unity element proof

    So this is a review problem in our book I came across and i really want to understand it but I am just not having any luck, I did some research and found a guide on solving it but that's not really helping either. We didn't talk about unity elements in class and there aren't any examples in our...
  14. M

    Discrete proofs involving divisibility

    ok this is what i have Prove: n∈Z n= a multiple pf gcd(a,b) ⇔ n is a linear combination of a and b ⇒ let gcd(a,b)=d. We are given that n=xd for some x∈Z Using Bezout’s identity we can expand d, d= sa+tb for some s,t∈Z Hence, n=xd=x(sa+tb)=xsa+xtb We recognise this as a linear combination of a...
  15. M

    Divisibility Proof Writing: Exploring the Cancellation Property in Z

    ok so this is what I've got Prove: ∀c∈Z, c≠0 and b both∈Z a|b⇔ca|cb a|b if and only if b=ak for some k∈Z if and only if cb=cak for some c∈Z if and only if ac|cb Is this a valid proof? It seems kind of short and it's lacking the "cancelation property" but I'm not sure I understand how to write...
Back
Top