- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Write the molecular formulae of all the compounds that can be formed by the combination of following ions Cu^{2+}, Na^{+}, Fe^{3+}, Cl^{ } SO_{4} ^{-2}, PO_{4} ^{-3}

Compounds are formed by the combination of cation and anion.

By combining all the possible positive ions with negative ions, we get:

CuCl

_{2}/ CuSO_{4}/ Cu_{3}(PO_{4})_{2}NaCl/ Na

_{2}SO_{4}/ Na_{3}PO_{4}FeCl

_{3}/ Fe_{2}(SO_{4})_{3}/ FePO_{4}- Related Questions & Answers
- All possible strings of any length that can be formed from a given string?
- Which of the following areas data mining technology can be applied?
- Find the largest number that can be formed with the given digits in C++
- Recursively print all sentences that can be formed from list of word lists in C++
- Print all distinct integers that can be formed by K numbers from a given array of N numbers in C++
- Find the count of numbers that can be formed using digits 3 and 4 only and having length at max N in C++
- Minimize the sum of squares of sum of N/2 paired formed by N numbers in C++
- Sum of the series 1 + (1+2) + (1+2+3) + (1+2+3+4) + ... + (1+2+3+4+...+n) in C++
- Return the minimum value that can be represented by the dtype of an object in Numpy
- Return the maximum value that can be represented by the dtype of an object in Numpy
- Count all possible groups of size 2 or 3 that have sum as multiple of 3 in C++
- Print all possible strings of length k that can be formed from a set of n characters in C++
- Maximum length cycle that can be formed by joining two nodes of a binary tree in C++
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array in C++
- Largest number with the given set of N digits that is divisible by 2, 3 and 5 in C++
- Sum of the series 1^1 + 2^2 + 3^3 + ... + n^n using recursion in C++

Advertisements