Fix a couple of errors in <ranges> concepts

Author: Rageking8

docs/standard-library/range-concepts.md

@@ -43,7 +43,7 @@ int main()
     DivideEmUp<int> dividerOfInts;
     std::cout << dividerOfInts.Divide(6, 3); // outputs 2
     // The following line will not compile because the template can't be instantiated 
-    // with char* because char* can be divided
+    // with char* because char* can't be divided
     DivideEmUp<char*> dividerOfCharPtrs; // compiler error: cannot deduce template arguments 
 }
 ```
@@ -163,7 +163,7 @@ The type to test to see if it's a `contiguous_range`.
 
 ### Remarks
 
-A `contiguous_range` can be accessed by pointer arithmetic because the elements are laid out sequentially in memory and are the same size. This kind of range supports [`continguous_iterator`](iterator-concepts.md#contiguous_iterator), which is the most flexible of all the iterators.
+A `contiguous_range` can be accessed by pointer arithmetic because the elements are laid out sequentially in memory and are the same size. This kind of range supports [`contiguous_iterator`](iterator-concepts.md#contiguous_iterator), which is the most flexible of all the iterators.
 
 Some examples of a `contiguous_range` are `std::array`, `std::vector`, and `std::string`.
 
@@ -270,7 +270,7 @@ bidirectional_range<T> && random_access_iterator<iterator_t<T>>;
 ### Parameters
 
 *`T`*\
-The type to test to see if it's a `sized_range`.
+The type to test to see if it's a `random_access_range`.
 
 ### Remarks