Is there a modern replacement for the Nvidia 8800GS?

Like other imac users my imac 24" (2008) Nvidia 8800GS graphics card has just stopped working, I'm wondering if there is a modern replacement for this card rather than buying a (expensive) reconditioned one?

http://forums.macrumors.com/showthread.php?t=1440627
There is a lot of conflicting data on whether the graphics card in the imac is replaceable. This stems from the fact that many of the older generation imacs have the GPU soldered to the logic board. This is NOT the case with the 2008 24 inch that has the card mentioned above. It is very difficult to get to. But with planning, patience and care, it can be replaced.

Similar Messages

  • Is there an alternative replacement for the JConsole?

    When I use the JConsole to look at certain JMX values then
    it occurs often that entry fields and info texts are very short and uncomfortable.
    Is there an alternative replacement for JConsole?
    Peter

    JoachimSauer wrote:
    [J]VisualVM has a useful MBean view as well.I really like that one. I have also used MX4J as JMX client a couple of years ago. It was good at that time, don't know how it is now.
    Kaj

  • Update for the NVIDIA GeForce GTX 680MX 2048 MB for MacPro3.1 primo 2008?

    Has there been an update for the NVIDIA GeForce GTX 680MX 2048 MB for MacPro3.1 primo 2008?
    I have had the MacPro restarts due to internal problems and the fault report going to Apple shows it is the N NVIDIA GeForce GTX creates the problems.
    I am running Apple products like Aperture 3.5.1 iTunes 11 etc…
    Besides the cresting the overall performance is SLOW
    My MacPro:
    Running OS X 10.9.1. on the MacPro3.1 primo 2008, 2 x 2,8 GHz Quad-Core Intel Xeon
    NVIDIA GeForce GTX 680:
      Chipset-model:            NVIDIA GeForce GTX 680
      Type:            GPU
      Bus:            PCIe
      Kortplads:            Slot-1
      Bredde på PCIe-kanal:            x16
      VRAM (i alt):            2048 MB
      Producent:            NVIDIA (0x10de)
      Enheds-id:            0x1180
      Revision-id:            0x00a2
      ROM-revision:            3731
    Skærme:
    CG246:
      Opløsning:            1920 x 1200
      Pixeldybde:            32 bit farve (ARGB8888)
      Dublering:            Fra
      Online:            Ja
      Rotation:            Understøttet
    Cintiq 12WX:
      Opløsning:            1280 x 800 @ 60 Hz
      Pixeldybde:            32 bit farve (ARGB8888)
      Skærms serienummer:            8HC000414   
      Hovedskærm:            Ja
      Dublering:            Fra
      Online:            Ja
      Rotation:            Understøttet
    Please advise :-)
    / Kim Andersen

    Dear Ms. Andersen:
    Evga handles GeForce GTX 680 MX. Apple has nothing to do with it. However, I can try to help you a little bit
    go here for Evga's Mac support: http://www.evga.com/support/download/default.aspx
    This is one of those video cards that needs 2 power cables connected to the mother board for it to work propertly. It needs 195 watts of power, which  the PCI-E slot will not provide on its own. If you have the power cables connected up okay, then the only advice I can give you is to telephone EVGA and see about a possible replacement.  Apple's policy, as I understand it, is to replace same with same, even if you have the money and are willing to pay extra. This is a 3rd party video card and as such, Apple is not responsible for any problems wth it.  I don't understand either: based on my knowledge of Norwegian,  your screen size is 1280x800 and your bit depth  is 32 bit, and you have 2 gigs Vram, so you should have no problem.
    maybe you have a bad card
    good luck to you
    JOhn b

  • Does anyone know how well the Intel Iris Pro installed on new 15" MacBook Pros performs using Photoshop and Lightroom. I have seen some differing opinions out there, and I would rather not shell out the extra cash for the Nvidia if I don't have to. I most

    Does anyone know how well the Intel Iris Pro installed on new 15" MacBook Pros performs using Photoshop and Lightroom?  I have seen some differing opinions out there, and I would rather not shell out the extra cash for the Nvidia if I don't have to. I mostly do photo editing for business and personal use. I have not used the 3D function in Photoshop, but I would like to know that I could.

    You could download a trial and see how well it works before committing to a subscription. You get 30 days to decide.
    Photo editor | Download free Adobe Photoshop CC trial
    Photo editor app | Download free Adobe Photoshop Lightroom 5 trial
    Gene

  • Is there a replacement for the canon 7d

    Is there a replacement for the canon 7d

    See this thread
    http://forums.usa.canon.com/t5/EOS/Is-there-going-to-be-another-canon-7d-with-ten-frames-a-second/m-...

  • Is there a decent replacement for Mack The Ripper that works with Mavericks?

    Is there a decent replacement for Mack The Ripper that works with Mavericks?

    But this is not a plugin, it's basically Adobe's Photoshop lite - a standalone program.
    The beauty of Intellihance was that is combined a few good native Photoshop adjustments into one menu which meant that you could perform a series of various adjustments and preview them all at once.
    Don't want to leave PS to do this if I don't have to.

  • A replacement for the Quicksort function in the C++ library

    Hi every one,
    I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
    of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
    The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
    Triple State Algorithm
    The classical way of doing Quicksort is as follows:
    - Choose one element p. Called pivot. Try to make it close to the median.
    - Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
    - Recursively sort the left and right parts using the same method above.
    - Stop recursion when a part reaches a size that can be trivially sorted.
     The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
    [ <=p | ? | >=p ]
    [ <p | >=p | ? ]
    [ <=p | =p | ? | >p ]
    [ =p | <p | ? | >p ]  Then swap = part to middle at the end
    [ =p | <p | ? | >p | =p ]  Then swap = parts to middle at the end
    Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
    [ <p | =p | >p ]
    The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
    put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
    The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
    [ <p | ? | =p | ? | >p ]
    Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
    large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
    Further reducing number of swaps
    A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
    while (l<=r)
    while (ar[l]<p)
    l++;
    while (ar[r]>p)
    r--;
    if (l<r)
    { Swap(ar[l],ar[r]);
    l++; r--;
    else if (l==r)
    { l++; r--; break;
    The Swap macro above does three copy operations:
    Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
    There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
    from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
    the empty space will remain there juggling left and right. The following code snippet explains.
    // Pre-scan from the right
    while (ar[r]>p)
    r--;
    temp = ar[r];
    // Main loop
    while (l<r)
    while (l<r && ar[l]<p)
    l++;
    if (l<r) ar[r--] = ar[l];
    while (l<r && ar[r]>p)
    r--;
    if (l<r) ar[l++] = ar[r];
    // After loop finishes, copy temp to left side
    ar[r] = temp; l++;
    if (temp==p) r--;
    (For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
    This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
    However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
    cases handling, it eventually proves more efficient than the classical swapping approach.
    Run time tests
    Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
    size std::sort() Triple State QuickSort
    5000 2039 1609
    6000 2412 1900
    7000 2733 2220
    8000 2993 2484
    9000 3361 2778
    10000 3591 3093
    It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
    size std::sort() Triple State QuickSort
    100000 1607 424
    200000 3165 845
    300000 4534 1287
    400000 6461 1700
    500000 7668 2123
    600000 9794 2548
    700000 10745 3001
    800000 12343 3425
    900000 13790 3865
    1000000 15663 4348
    Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
    sawtooth: ar[i] = i % arange
    random: ar[i] = GenRand() % arange + 1
    stagger: ar[i] = (i* arange + i) % n
    plateau: ar[i] = min(i, arange)
    shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
    I also add the following two input types, just to add a little torture:
    Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
    Organ Pipes: (see full code for details)
    Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
    Sorted, reversed, front half reversed, back half reversed, dithered, fort.
    Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
    The complete test results can be found here:
    http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
    or:
    https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
    Theoretical Analysis
    A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
    but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
    http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
    Using SSE2 instruction set
    SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
    In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
    decision is made only once when the function is called so it has minor overhead.
    Few other notes
    - The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
    defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
    I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
    - Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
    threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
    that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
    or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
    - You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
    -When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
    swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
    - The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
    a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
    Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
    You can find the complete VC++ project/code along with a minimal test program here:
    http://solostuff.net/tsqsort/
    Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
    it is!!
    Ammar Muqaddas

    Thanks for your interest.
    Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
    Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
    However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
    Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
    Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
    down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
    I Will try to look at your sorting code, lets see if I can compile it.

  • When is Verizon getting a replacement for the Casio Commando?!?!

    I have had my Commando for over 2 years now and love all the features and the ruggedness of it!!  I have MANY stories of how tough this phone is, but now it is having software issue and resets 3 or more times a day and I can't take it anymore!!!!  I know there is a replacement that the FCC has released a while ago called the Commando c811 according to the Verizon manual that is on the FCC website!  So my question is, What is taking Veizon SOOOO long to release it to us?!?!?!  I don't want any answers from Verizon support that tells me to sign up for the "latest news" from Verizon, because I've been signed up since last year and have only received one email from them!!!!!  Or that they still have 2000+ of the old Commando phones to get rid of!!!  Maybe they should have thought about the fact of having a pretty indestructible phone and not needed it to be replaced all the time!!   I want a REAL answer and so do many other Commando users!!!!!!!!!  My contract is up so maybe its time to move on after 10 years!

    Yeah same old answer I've gotten from Verizon!  Guess I and many others going to look into other services since Verizon is dragging their feet on this!  Casio and the FCC say the phone has been ready for a while now, so what is taking Verizon soooo long to give a REAL answer?!?!?!  NOT watch our website or sign up for emails on new products!  I need a rugged smart phone and I am not buying another 3G one!!!!  By the time they do release the Commando c811 on the FCC website it will be obsolete   Here's the FCC's website with the info: https://apps.fcc.gov/oetcf/eas/reports/ViewExhibitReport.cfm?mode=Exhibits&RequestTimeout=500&calledFromFrame=N&application_id=240582&fcc_id=TYK-JDS9507
    It has the complete Verizon manual available and everything, so what is the hold up?!?!?!
    Not a happy Verizon customer!!!!!

  • My pavilion dv6208nr needs an update for the NVIDIA card. Who has them?

    I am running Windows7.  Some of the newer games are causing system hangs when I exit the game.  I have been told I need newer drivers for the NVIDIA Geforce 6150 card.  The downloads from NVIDIA do not work, or I need some help with the download since I don't see a driver update on the HP sites for Windows7.

    I would be curios to know if you ran the automatic driver search function from NVIDIA as they don't actually list one for the Go 6 series anymore.
     If you haven't done so, try running that utility.
     http://www.nvidia.com/Download/index.aspx?lang=en-us
     From your support page I see you are also running NVIDIA chipset driver, run the utilty for the motherboard as well. Install the chipset driver first if it finds something.
     In all cases save the downloads to the desk top and install them from there, not from a temporary folder.
     Another possibility is that the computer is too out of date to run the newer video games and if you look at your specs, it only has 288 MB of video memory and 1 GB of RAM.
     http://h10025.www1.hp.com/ewfrf/wc/document?docname=c00844615&tmp_task=prodinfoCategory&cc=us&dlc=en...

  • I've only had my iphone 5s for a week. I keep getting an error message of "Server has stopped responding."  I need the server to work. Does anyone know if there is a "fix" for the problem? Other wise, I probably best return for a refund and get a Samsung.

    I've only had my iphone 5s for a week. I keep getting an error message of "Server has stopped responding."  I need the server to work. Does anyone know if there is a "fix" for the problem? Other wise, I probably best return for a refund and get a Samsung.  Thanks

    sandyzotz wrote:
    Other wise, I probably best return for a refund and get a Samsung.
    Unlikely.  Based on the complete lack of detail of the issue provided it is entirely possible the same issue would occur.
    Unless and until the user provides some actual details of the problem, there is nothing the indicate that the issue is with the iPhone.

  • Can not update iTunes because I have iMac with 10.5.8 . How I will sync my iphone 6.0 with an older version of iTunes on my iMac???? There is no update for the software of my iMac and no update for the iTunes.... So how can I sync????

    Can not update iTunes because I have iMac with 10.5.8 . How I will sync my iphone 6.0 with an older version of iTunes on my iMac???? There is no update for the software of my iMac and no update for the iTunes.... So how can I sync????

    Requirements for iPhone 5:
    Syncing with iTunes on a Mac or PC requires:
    Mac: OS X v10.6.8 or later
    PC: Windows 7; Windows Vista; or Windows XP Home or Professional with Service Pack 3 or later
    iTunes 10.7 or later
    The highest version of iTunes you can install is 10.6.3 which will not sync with the iPhone 5.
    Roger Wilmut1 wrote:
    It's always a good idea to check the requirements before purchasing.
    The person I spoke with at 1-800-MY-APPLE gave me totally different info...she said the iPhone 5 would in fact sync with the older version of iTunes and that I could restore from my previous iPhone 4 backup and also bring in my music that way.  Hmmm....
    I'm inclined to go by the published specs, but now I have to jump thru a bunch of hoops I wasn't expecting to.

  • Under Options , Applications There are multiple entries for the same item (Acrobat Document). how can I delete the duplicates?

    Under Options, Applications there are multiple entries for the same item. (Adobe Acrobat) . Three show Adobe Acrobat Reader 9.3 and the other shows (ask) or (save file) with no ability to select Acrobat Reader . Is there a way to edit this list to remove the duplicates and
    the incorrect entry? Adobe installed a very quick update today.

    They are all different. Hover your mouse pointer over each of the "Content Type" descriptions and you should see a "tooltip" to see that each has a different description.
    You need to update your plugins. It is important to keep them updated due to continuing security fixes and improvements in those plug-ins:
    * Adobe Shockwave for Director Netscape plug-in, version 11.5 (you '''<u>may</u>''' need to update)
    * Shockwave Flash 10.1 r53
    * Next Generation Java Plug-in 1.6.0_20 for Mozilla browsers
    #Check your plugin versions: http://www.mozilla.com/en-US/plugincheck/
    #*'''Note: plugin check page does not have information on all plugin versions'''
    #'''Update Shockwave for Director'''
    #*NOTE: this is not the same as Shockwave Flash; this installs the Shockwave Player.
    #*Use Firefox to download and SAVE the installer to your hard drive from the link in the article below (Desktop is a good place so you can find it).
    #*When the download is complete, exit Firefox (File > Exit)
    #*locate and double-click in the installer you just downloaded, let the install complete.
    #*Restart Firefox and check your plugins again.
    #*'''<u>Download link and more information</u>''': http://support.mozilla.com/en-US/kb/Using+the+Shockwave+plugin+with+Firefox
    #'''Update Shockwave Flash'''
    #*Use Firefox to Download and SAVE to your hard drive from the link in article below
    #*SAVE to your Desktop so you can find it
    #*After download completes, close Firefox
    #*Click on the file you just downloaded and install
    #**Note: Vista and Win7 users may need to right-click the installer downloaded and choose "Run as Administrator"
    #**Note: Most browsers other than IE will also get updated with this one download
    #**Note: To update IE, same procedure '''<u>but use IE</u>''' to go: http://fpdownload.macromedia.com/get/flashplayer/current/install_flash_player_ax.exe
    #*After installation, restart Firefox and check your version again.
    #*'''<u>Download link and other information</u>''': https://support.mozilla.com/en-US/kb/Managing+the+Flash+plugin#Updating_Flash
    #* Also see: http://support.mozilla.com/en-US/kb/Installing+the+Flash+plugin
    #* Also see (if needed): http://kb2.adobe.com/cps/191/tn_19166.html#main_Uninstall
    #'''Update Java:'''
    #* Download and update instructions: https://support.mozilla.com/en-US/kb/Using+the+Java+plugin+with+Firefox

  • Is there any Vga adaptor for the Ipad 2 that is VIDEO IN rather than OUT?

    Is there any Vga adaptor for the Ipad 2 that is VIDEO IN rather than VIDEO OUT? is for a student with visual impairment who needs to view the classroom digital board content from a very short distance, like the distance to an Ipad for example, so the Ipad would be ideal as an interactive monitor with typography and content easy to amplify.
    At the moment, this student has a traditional flat screen monitor taking over the table next to him, so no other child can seat in it, and he has no opportunity to befriend and sporadically joke with anybody else. So much for "inclusion".
    Please do let me know: [email protected]

    Speaking as a teacher ... Why can't he have a student on the other side of him?

  • Replacement for the Replacement? help!! 1st generation program

    Hi my name is Juan Robles I recently enter to the 1st generation ipod program replacement, and they do send me a better ipod touch nano 8 gb 6 generation.
    but it doesn't charge, i let it charge for a hole day and I even try it with a usb cable and a wall charger and once you  disconected, it goes dead not even a blink... but if i plug it back to the cable it turn on very fast in less than 5 seconds.
    My question is do they support a replacement for the replacement they send me, it is less than 90 days of from the date of service.
    The Fedex box, the one with the replacement new ipod don't have the return address like the first one, the one where i send my 1st generation ipod. So any one  resolve a similar issue , i will love to have the return address. I allready try the thec phone support but they put me on hold for more tha a hour and nothing.
    Thanks in advance...

    Apple Service Operations
    3011 Laguna Blvd., Building A
    ELk Grove, CA 95758

  • Does anyone know if there is an adapter for the new nano iPod to connect to a FS-2 iPort?

    Does anyone know if there is an adapter for the new nano iPod to connect to a FS-2 iPort?

    IIRC the very original Bose Dock had the old 30 pin wiring and was designed initially for the iPod
    If you have that version then you will need a converter to the later wiring ( sans firewire) as in Scosche .
    and then the 30 pin to lightning Apple adapter
    In theory it should work but who knows.
    If you have a later one which already works with current devices then just the lightning adapter
    It is important to get the genuine Apple adapter I have several and all work fine in several scenarios
    Avoid the eBay knock offs most only charge

Maybe you are looking for