[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference rusure::math

Title:Mathematics at DEC
Moderator:RUSURE::EDP
Created:Mon Feb 03 1986
Last Modified:Fri Jun 06 1997
Last Successful Update:Fri Jun 06 1997
Number of topics:2083
Total number of notes:14613

1600.0. "Get PAID for Big O answers!!!" by KYOA::PEREZ (Welcome to My Nightmare) Sun Apr 26 1992 15:24

    Discrete Math help needed quickly.
    
    I need to get the answers to the following problems by 3pm or so on
    Monday 4/27/92.  Each corect answer is worth money!  Dollar amount for 
    each is listed next to the problem number. The first reply that is
    correct wins.  
    
    $7.00 - 1)  Show that (x^3+2x)/(2x+1) is O(x^2), x^2 is x squared
                     just need enough to prove its true.
    
    $7.00 - 2) show that xlogx is O(x^2) but x^2 is NOT O(xlogx)
    
    $12.00 -Give a Big O estimate for each function. For the function g
            in your estimate f=O(g) use a simple function g of smallest
            order.
    
    		a) (n^3+n^2logn)(logn+1) + (17logn+19)(n^3+2)   $4.00
                b) (2^n+n^2)(n^3+3^n)                            4.00
                c) (n^n+n2^n+5^n)(n!+5^n)                        4.00
    
                These are considered 3 separate problems and resposes are 
                treated as such.
    
    Honestly , a check will be mailed to winners.
    A faster reponse can be entered by sending mail to obiwan::perez
    on a first come first payed basis.
    
    Checks will be mailed 1 week from 4/27.
    
    Thanks, and good luck.
                                   
    tony
T.RTitleUserPersonal
Name
DateLines
1600.1additional help big O contestKYOA::PEREZWelcome to My NightmareSun Apr 26 1992 15:2910
    
    Additional help,
    
    If you would like to beat the rush, send vaxmail and specify which
    problem you have the answers to.  On a first come basis , i will call 
    back, and if correct you will be paid.
    
    good luck,
    tony
    
1600.2smells like homework to me3D::ROTHGeometry is the real life!Mon Apr 27 1992 08:370
1600.3WONDER::COYLEMon Apr 27 1992 09:565
    RE .2  
    
    Or maybe at the end of a semester a take home exam?
    
    -Joe
1600.4TRACE::GILBERTOwnership ObligatesMon Apr 27 1992 13:5321
1600.5I got an A anyway!!!KYOA::PEREZWelcome to My NightmareMon Apr 27 1992 23:2722
    
    Ok ok .....  I guess if i didn't offer money i would have gotten
    responses anyway.  But how do you know if other notes have been entered
    for homework or exam requests ???
    
    I think i was cut off a bit early here based on over-reactive 
    suspicious minds.
    
    I don't beleive that i should have to explain my motives when asking 
    for some good old fashion help ESPECIALLY if i am paying for it.
    
    For the hard record, these were not homework or exam questions! Not
    that its anyones business.
    
    So for the time it took some of you to read, think , and reply you
    could have just answered the questions (like most helpful noters)
    and took my money.  And some offline responses may have done just that.
    
    thanks for the fatherly concerns,
    
    tony (who got an A on the mistery final)
    
1600.6CREATV::QUODLINGKen, Me, and a cast of extras...Tue Apr 28 1992 07:5911
    It's not homework or exams but you got an A, care to elaborate?
    
    Re suspicious minds. And what would you think if someone came up to you
    and offered you money for quick answers to basic math problems...
    
    Irrespective of whether you are paying for a service or not.
    Professional and personal ethics would require that most people be
    given adequate assurance that they are not assisting you to cheat on an
    exam.
    
    q
1600.73D::ROTHGeometry is the real life!Tue Apr 28 1992 08:085
    If someone tells me they're doing a take home exam and want help
    that is fine, and I've helped people with their homework.  But
    being offered cash for something like that really turns me off.

    - Jim
1600.8Lets quit now.KYOA::PEREZWelcome to My NightmareTue Apr 28 1992 20:1915
    
    I'm always the one who reads these kind of notes and gets mad because 
    they are a waste of everyones time, So how about we forget the whole 
    thing.  I was just looking for some simple answers not analysis and
    felt that if you were unsure about giving possible exam or homework
    answers you should just skip to the next note.
    
    So lets cut this one off.  I believe that the moderator may want to 
    delete this entirely or better to unset hidden 1600.4 which has the 
    answers that may be helpful to someone in the future.
    
    Sorry for the inconvenience.
    thanks,
    tony
    
1600.9AUSSIE::GARSONTue Apr 28 1992 20:2013
    re .various
    
    And furthermore when .0 contains wording like
    
>   I need to get the answers to the following problems by 3pm or so on
>   Monday 4/27/92.  
    
    a certain amount of suspicion is justified. I mean to say! When was the
    last time you had to solve such life-threatening problems by some
    deadline except as part of a course of study, exam, etc.
    
    Just for (my) interest would someone care to define big O (in the
    context of mathematics, I mean (-:)?
1600.10BEING::EDPAlways mount a scratch monkey.Wed Apr 29 1992 08:5013
    Re .9:
    
    To say f(x) is O(g(x)) means the function f is on the order of g(x).  I
    think the definition is that f is O(g) if there exist finite numbers M
    and c such that f(x) < c*g(x) for all x > M.  You might need absolute
    values in there, depending on the domains being used.  E.g., abs(f(x))
    < abs(c*g(x)).
    
    Thus x^2+2x+3 is on the order of x^2.  This order expresses how quickly
    the function increases.
                 
    
    				-- edp
1600.11BEING::EDPAlways mount a scratch monkey.Wed Apr 29 1992 08:539
    At the dinner last month, Stan said he used to rule this conference
    with an iron hand.  I have given some slack here, but the author of .0
    still has not explained their note.  I would prefer not to see such
    notes posted in the future.       
    
    This is the Math conference, and discussion should be about math.
    
    
    				-- edp
1600.12on big OSTAR::ABBASIi^(-i) = SQRT(exp(PI))Wed Apr 29 1992 09:4016
    >I think the definition is that f is O(g) if there exist finite numbers M
    >and c such that f(x) < c*g(x) for all x > M.  You might need absolute
    
    i think the defintion should be applied for all x, i.e no need for the M.
    
    i.e if  there is a C,  s.t. |f(n)| <= c *|g(x)| for all x, then 
    f(x) = O(g(x))
    
    some big O rules:
    1. f(x) = O(f(x))
    2. O(f(x) g(x))= f(x) O g(x)
    3. O(f(x)) O(g(x)) = O(f(x) g(x))
    4. K O(f(x))= O(f(x))
    4. O(O(f(x)))= O(f(x))
    
    /nasser
1600.13X-range has to be specifiedHERON::BLOMBERGTrapped inside the universeWed Apr 29 1992 11:563
    
    No, not for all x. The x-range has to be specified in each case,
    e.g., f(x) = O(g(x)) when x->x0 (or whatever) if ...
1600.14TOOK::ALEXAlex AllisterMon May 04 1992 11:2311
    re .12:
    
   > i think the defintion should be applied for all x, i.e no need for the M.
    
   > i.e if  there is a C,  s.t. |f(n)| <= c *|g(x)| for all x, then 
   > f(x) = O(g(x))
    
    You really do need the M. E.g., 1 = O(x) by using c = 1 and M = 1.
    Otherwise, for x = 0 you get 1 <= 0, which is false.
    
    Alex