Decide whether it is more convenient to use the disk method or the shell method to find the volume of the solid of revolution. Explain your reasoning. (Do not find the volume.) y=4-e^x Graph can't copy | Numerade (2024)

`); let searchUrl = `/search/`; history.forEach((elem) => { prevsearch.find('#prevsearch-options').append(`

${elem}

`); }); } $('#search-pretype-options').empty(); $('#search-pretype-options').append(prevsearch); let prevbooks = $(false); [ {title:"Recently Opened Textbooks", books:previous_books}, {title:"Recommended Textbooks", books:recommended_books} ].forEach((book_segment) => { if (Array.isArray(book_segment.books) && book_segment.books.length>0 && nsegments<2) { nsegments+=1; prevbooks = $(`

  • ${book_segment.title}
  • `); let searchUrl = "/books/xxx/"; book_segment.books.forEach((elem) => { prevbooks.find('#prevbooks-options'+nsegments.toString()).append(`

    ${elem.title} ${ordinal(elem.edition)} ${elem.author}

    `); }); } $('#search-pretype-options').append(prevbooks); }); } function anon_pretype() { let prebooks = null; try { prebooks = JSON.parse(localStorage.getItem('PRETYPE_BOOKS_ANON')); }catch(e) {} if ('previous_books' in prebooks && 'recommended_books' in prebooks) { previous_books = prebooks.previous_books; recommended_books = prebooks.recommended_books; if (typeof PREVBOOKS !== 'undefined' && Array.isArray(PREVBOOKS)) { new_prevbooks = PREVBOOKS; previous_books.forEach(elem => { for (let i = 0; i < new_prevbooks.length; i++) { if (elem.id == new_prevbooks[i].id) { return; } } new_prevbooks.push(elem); }); new_prevbooks = new_prevbooks.slice(0,3); previous_books = new_prevbooks; } if (typeof RECBOOKS !== 'undefined' && Array.isArray(RECBOOKS)) { new_recbooks = RECBOOKS; for (let j = 0; j < new_recbooks.length; j++) { new_recbooks[j].viewed_at = new Date(); } let insert = true; for (let i=0; i < recommended_books.length; i++){ for (let j = 0; j < new_recbooks.length; j++) { if (recommended_books[i].id == new_recbooks[j].id) { insert = false; } } if (insert){ new_recbooks.push(recommended_books[i]); } } new_recbooks.sort((a,b)=>{ adate = new Date(2000, 0, 1); bdate = new Date(2000, 0, 1); if ('viewed_at' in a) {adate = new Date(a.viewed_at);} if ('viewed_at' in b) {bdate = new Date(b.viewed_at);} // 100000000: instead of just erasing the suggestions from previous week, // we just move them to the back of the queue acurweek = ((new Date()).getDate()-adate.getDate()>7)?0:100000000; bcurweek = ((new Date()).getDate()-bdate.getDate()>7)?0:100000000; aviews = 0; bviews = 0; if ('views' in a) {aviews = acurweek+a.views;} if ('views' in b) {bviews = bcurweek+b.views;} return bviews - aviews; }); new_recbooks = new_recbooks.slice(0,3); recommended_books = new_recbooks; } localStorage.setItem('PRETYPE_BOOKS_ANON', JSON.stringify({ previous_books: previous_books, recommended_books: recommended_books })); build_popup(); } } var whiletyping_search_object = null; var whiletyping_search = { books: [], curriculum: [], topics: [] } var single_whiletyping_ajax_promise = null; var whiletyping_database_initial_burst = 0; //number of consecutive calls, after 3 we start the 1 per 5 min calls function get_whiletyping_database() { //gets the database from the server. // 1. by validating against a local database value we confirm that the framework is working and // reduce the ammount of continuous calls produced by errors to 1 per 5 minutes. return localforage.getItem('whiletyping_last_attempt').then(function(value) { if ( value==null || (new Date()) - (new Date(value)) > 1000*60*5 || (whiletyping_database_initial_burst < 3) ) { localforage.setItem('whiletyping_last_attempt', (new Date()).getTime()); // 2. Make an ajax call to the server and get the search database. let databaseUrl = `/search/whiletype_database/`; let resp = single_whiletyping_ajax_promise; if (resp === null) { whiletyping_database_initial_burst = whiletyping_database_initial_burst + 1; single_whiletyping_ajax_promise = resp = new Promise((resolve, reject) => { $.ajax({ url: databaseUrl, type: 'POST', data:{csrfmiddlewaretoken: "sScgFiaZn7T0Sd8LM4oGzzVK91f4xjD8VB9Ta61mgq8NNSHyop7FrPjD5NcPQm6U"}, success: function (data) { // 3. verify that the elements of the database exist and are arrays if ( ('books' in data) && ('curriculum' in data) && ('topics' in data) && Array.isArray(data.books) && Array.isArray(data.curriculum) && Array.isArray(data.topics)) { localforage.setItem('whiletyping_last_success', (new Date()).getTime()); localforage.setItem('whiletyping_database', data); resolve(data); } }, error: function (error) { console.log(error); resolve(null); }, complete: function (data) { single_whiletyping_ajax_promise = null; } }) }); } return resp; } return Promise.resolve(null); }).catch(function(err) { console.log(err); return Promise.resolve(null); }); } function get_whiletyping_search_object() { // gets the fuse objects that will be in charge of the search if (whiletyping_search_object){ return Promise.resolve(whiletyping_search_object); } database_promise = localforage.getItem('whiletyping_database').then(function(database) { return localforage.getItem('whiletyping_last_success').then(function(last_success) { if (database==null || (new Date()) - (new Date(last_success)) > 1000*60*60*24*30 || (new Date('2023-04-25T00:00:00')) - (new Date(last_success)) > 0) { // New database update return get_whiletyping_database().then(function(new_database) { if (new_database) { database = new_database; } return database; }); } else { return Promise.resolve(database); } }); }); return database_promise.then(function(database) { if (database) { const options = { isCaseSensitive: false, includeScore: true, shouldSort: true, // includeMatches: false, // findAllMatches: false, // minMatchCharLength: 1, // location: 0, threshold: 0.2, // distance: 100, // useExtendedSearch: false, ignoreLocation: true, // ignoreFieldNorm: false, // fieldNormWeight: 1, keys: [ "title" ] }; let curriculum_index={}; let topics_index={}; database.curriculum.forEach(c => curriculum_index[c.id]=c); database.topics.forEach(t => topics_index[t.id]=t); for (j=0; j

    Solutions
  • Textbooks
  • `); } function build_solutions() { if (Array.isArray(solution_search_result)) { const viewAllHTML = userSubscribed ? `View All` : ''; var solutions_section = $(`
  • Solutions ${viewAllHTML}
  • `); let questionUrl = "/questions/xxx/"; let askUrl = "/ask/question/xxx/"; solution_search_result.forEach((elem) => { let url = ('course' in elem)?askUrl:questionUrl; let solution_type = ('course' in elem)?'ask':'question'; let subtitle = ('course' in elem)?(elem.course??""):(elem.book ?? "")+"    "+(elem.chapter?"Chapter "+elem.chapter:""); solutions_section.find('#whiletyping-solutions').append(` ${elem.text} ${subtitle} `); }); $('#search-solution-options').empty(); if (Array.isArray(solution_search_result) && solution_search_result.length>0){ $('#search-solution-options').append(solutions_section); } MathJax.typesetPromise([document.getElementById('search-solution-options')]); } } function build_textbooks() { $('#search-pretype-options').empty(); $('#search-pretype-options').append($('#search-solution-options').html()); if (Array.isArray(textbook_search_result)) { var books_section = $(`
  • Textbooks View All
  • `); let searchUrl = "/books/xxx/"; textbook_search_result.forEach((elem) => { books_section.find('#whiletyping-books').append(` ${elem.title} ${ordinal(elem.edition)} ${elem.author} `); }); } if (Array.isArray(textbook_search_result) && textbook_search_result.length>0){ $('#search-pretype-options').append(books_section); } } function build_popup(first_time = false) { if ($('#search-text').val()=='') { build_pretype(); } else { solution_and_textbook_search(); } } var search_text_out = true; var search_popup_out = true; const is_login = false; const user_hash = null; function pretype_setup() { $('#search-text').focusin(function() { $('#search-popup').addClass('show'); resize_popup(); search_text_out = false; }); $( window ).resize(function() { resize_popup(); }); $('#search-text').focusout(() => { search_text_out = true; if (search_text_out && search_popup_out) { $('#search-popup').removeClass('show'); } }); $('#search-popup').mouseenter(() => { search_popup_out = false; }); $('#search-popup').mouseleave(() => { search_popup_out = true; if (search_text_out && search_popup_out) { $('#search-popup').removeClass('show'); } }); $('#search-text').on("keyup", delay(() => { build_popup(); }, 200)); build_popup(true); let prevbookUrl = `/search/pretype_books/`; let prebooks = null; try { prebooks = JSON.parse(localStorage.getItem('PRETYPE_BOOKS_'+(is_login?user_hash:'ANON'))); }catch(e) {} if (prebooks && 'previous_books' in prebooks && 'recommended_books' in prebooks) { if (is_login) { previous_books = prebooks.previous_books; recommended_books = prebooks.recommended_books; if (prebooks.time && new Date().getTime()-prebooks.time<1000*60*60*6) { build_popup(); return; } } else { anon_pretype(); return; } } $.ajax({ url: prevbookUrl, method: 'POST', data:{csrfmiddlewaretoken: "sScgFiaZn7T0Sd8LM4oGzzVK91f4xjD8VB9Ta61mgq8NNSHyop7FrPjD5NcPQm6U"}, success: function(response){ previous_books = response.previous_books; recommended_books = response.recommended_books; if (is_login) { localStorage.setItem('PRETYPE_BOOKS_'+user_hash, JSON.stringify({ previous_books: previous_books, recommended_books: recommended_books, time: new Date().getTime() })); } build_popup(); }, error: function(response){ console.log(response); } }); } $( document ).ready(pretype_setup); $( document ).ready(function(){ $('#search-popup').on('click', '.search-view-item', function(e) { e.preventDefault(); let autoCompleteSearchViewUrl = `/search/autocomplete_search_view/`; let objectUrl = $(this).attr('href'); let selectedId = $(this).data('objid'); let searchResults = []; $("#whiletyping-solutions").find("a").each(function() { let is_selected = selectedId === $(this).data('objid'); searchResults.push({ objectId: $(this).data('objid'), contentType: $(this).data('contenttype'), category: $(this).data('category'), selected: is_selected }); }); $("#whiletyping-books").find("a").each(function() { let is_selected = selectedId === $(this).data('objid'); searchResults.push({ objectId: $(this).data('objid'), contentType: $(this).data('contenttype'), category: $(this).data('category'), selected: is_selected }); }); $.ajax({ url: autoCompleteSearchViewUrl, method: 'POST', data:{ csrfmiddlewaretoken: "sScgFiaZn7T0Sd8LM4oGzzVK91f4xjD8VB9Ta61mgq8NNSHyop7FrPjD5NcPQm6U", query: $('#search-text').val(), searchObjects: JSON.stringify(searchResults) }, dataType: 'json', complete: function(data){ window.location.href = objectUrl; } }); }); });
    Decide whether it is more convenient to use the disk method or the shell method to find the volume of the solid of revolution. Explain your reasoning. (Do not find the volume.) y=4-e^x Graph can't copy | Numerade (2024)

    FAQs

    When to use the disk method? ›

    If you have a function y=f(x) and you rotate it about the x axis, you should use disk (or ring, same thing in my mind). If you rotate y=f(x) about the y axis, you should use shell. Of course, you can always use both methods if you can find the inverse of the function.

    How to know whether to use the disk or washer method? ›

    You can always use either, the difference is that the washer method takes the cross-section of your final shape, then rotates it, while the disk method subtracts the entire volume of the shape enclosed by g(x) from the shape enclosed by f(x).

    What is the shell method of finding volume? ›

    Shell Method is used to find the volume by decomposing a solid of revolution into cylindrical shells. We slice the solid parallel to the axis of revolution that creates the shells. The volume of the cylindrical shell is the product of the surface area of the cylinder and the thickness of the cylindrical wall.

    How to find the volume of a disk? ›

    Volume of a Disk

    A circle is a two-dimensional figure, while a disk is a three-dimensional cylinder with a small height measurement. The volume of a disk is typically found using the same formula as a cylinder: V = π r 2 h .

    What is the shell method in chemistry? ›

    Shell Model of the Atom

    The shell which is closest to the nucleus is the first shell. The sequence in which the electrons occupy the shell is given as: 2, 8, 18, 32, 50, 72, 98. The atomic shell model also helps in understanding the chemical properties of the atoms.

    Is shell method on AP Calc BC? ›

    No need to fret - the Shell Method isn't specifically tested on the AP Calculus AB exam. The AB exam covers topics in differential and integral calculus, but the Shell Method, which is a technique for finding the volumes of solids of revolution, is actually part of the BC curriculum.

    Why is the disk method a special case of the general slicing method? ›

    We can observe that the disk method is a special case of the general slicing method by comparing their formulas. The disk method formula is simply the general slicing method formula with the area A(x) or A(y) being replaced by the area of a circular disk, that is, πR^2.

    What is the formula for the shell method? ›

    The Shell Method Formula

    The general shell method formula is V = ∫ a b 2 π r h ( r ) d r where r is the radius of the cylindrical shell, h(r) is a function of the shell's height based on the radius, and dr is the change in the radius.

    Top Articles
    Atomic Habits: An Easy & Proven Way to Build Good Habits & Break Bad Ones
    Freddie Hubbard “First Light” Vinyl record +35 more Jazz! - general for sale - by owner - craigslist
    Cappacuolo Pronunciation
    Wordscapes Level 5130 Answers
    Quick Pickling 101
    80 For Brady Showtimes Near Marcus Point Cinema
    ³µ¿Â«»ÍÀÇ Ã¢½ÃÀÚ À̸¸±¸ ¸íÀÎ, ¹Ì±¹ Ķ¸®Æ÷´Ï¾Æ ÁøÃâ - ¿ù°£ÆÄ¿öÄÚ¸®¾Æ
    Ingles Weekly Ad Lilburn Ga
    Us 25 Yard Sale Map
    Hawkeye 2021 123Movies
    True Statement About A Crown Dependency Crossword
    Weather Annapolis 10 Day
    Sitcoms Online Message Board
    Osrs Blessed Axe
    Chastity Brainwash
    Blog:Vyond-styled rants -- List of nicknames (blog edition) (TouhouWonder version)
    Nene25 Sports
    Used Sawmill For Sale - Craigslist Near Tennessee
    St Maries Idaho Craigslist
    Craigslist Portland Oregon Motorcycles
    Apply for a credit card
    Happy Life 365, Kelly Weekers | 9789021569444 | Boeken | bol
    Play It Again Sports Norman Photos
    Amelia Chase Bank Murder
    Dei Ebill
    Spectrum Outage in Queens, New York
    Ringcentral Background
    Uky Linkblue Login
    Diggy Battlefield Of Gods
    Jambus - Definition, Beispiele, Merkmale, Wirkung
    Metra Union Pacific West Schedule
    Cheap Motorcycles Craigslist
    Justin Mckenzie Phillip Bryant
    Peter Vigilante Biography, Net Worth, Age, Height, Family, Girlfriend
    Tamilyogi Ponniyin Selvan
    Jefferson Parish Dump Wall Blvd
    20+ Best Things To Do In Oceanside California
    9 oplossingen voor het laptoptouchpad dat niet werkt in Windows - TWCB (NL)
    The All-New MyUMobile App - Support | U Mobile
    Academy Sports New Bern Nc Coupons
    Ursula Creed Datasheet
    Wasmo Link Telegram
    Devon Lannigan Obituary
    Arcane Bloodline Pathfinder
    Dr Mayy Deadrick Paradise Valley
    Walmart Careers Stocker
    Dagelijkse hooikoortsradar: deze pollen zitten nu in de lucht
    The Cutest Photos of Enrique Iglesias and Anna Kournikova with Their Three Kids
    Graduation Requirements
    Erica Mena Net Worth Forbes
    60 Second Burger Run Unblocked
    Taterz Salad
    Latest Posts
    Article information

    Author: Patricia Veum II

    Last Updated:

    Views: 5603

    Rating: 4.3 / 5 (44 voted)

    Reviews: 91% of readers found this page helpful

    Author information

    Name: Patricia Veum II

    Birthday: 1994-12-16

    Address: 2064 Little Summit, Goldieton, MS 97651-0862

    Phone: +6873952696715

    Job: Principal Officer

    Hobby: Rafting, Cabaret, Candle making, Jigsaw puzzles, Inline skating, Magic, Graffiti

    Introduction: My name is Patricia Veum II, I am a vast, combative, smiling, famous, inexpensive, zealous, sparkling person who loves writing and wants to share my knowledge and understanding with you.