solving_math_tasks 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f352858c5df4a67772fc009c4a938a90d9469698
+  data.tar.gz: 5744ba73bc2f608cd51cf9d77e3f2e46064f4c03
+SHA512:
+  metadata.gz: 92fa4dfcbd6b69dba07c3b97c9e4e459b2720fd01bb4b4a2d40bc9b05f10981b5b2373cf52816f3cf39997c3c26b64b19be859f1728466f3d2e740296db3a614
+  data.tar.gz: faa7e5624b806ea8968c5dad59f6f89b0a29cb32fcf933d4d22adacffe728cc2c8256d1fe4b2f2479f996bfb01b24ae69f2acd85996e666564b209d1cb8b4d75

data/CHANGELOG

@@ -0,0 +1,2 @@
+== 1.0.0 / 2018-11-04
+  * add solving math tasks gem

data/LICENSE

@@ -0,0 +1,339 @@
+GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc., <http://fsf.org/>
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    {description}
+    Copyright (C) {year}  {fullname}
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  {signature of Ty Coon}, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.

data/README.md

@@ -0,0 +1,10 @@
+SETUP
+
+Enter this command to install all gems
+```
+bundle install
+```
+This command will help you run tests.
+```
+rake test
+```

data/Rakefile

@@ -0,0 +1,6 @@
+load 'test/spec.rb'
+
+desc 'Run tests'
+task :test do
+  Spec.new.run_tests
+end

data/feature.gemspec

@@ -0,0 +1,34 @@
+Gem::Specification.new do |s|
+  s.name        = 'solving_math_tasks'
+  s.version     = '1.0.0'
+  s.date        = '2018-11-04'
+
+  s.summary     = "Solve some math task."
+  s.description = "This gem will help you solve some math task."
+
+  s.authors     = ["Semyz Serhii"]
+  s.email       = 'semizserhii@gmail.com'
+
+  s.files       = ["lib/feature.rb"]
+  s.homepage    = 'https://github.com/SemyzSerhii/Solving-math-tasks'
+  s.license = 'GPL-2.0'
+
+  s.require_paths = ['lib']
+
+  s.add_development_dependency 'quality_assurance', '~> 1.0.0'
+
+  s.files = [
+    'LICENSE',
+    'CHANGELOG',
+    'README.md',
+    'Rakefile',
+    'feature.gemspec',
+    'lib/feature.rb',
+    'test/spec.rb'
+  ]
+
+  s.test_files = [
+    'test/spec.rb'
+  ]
+
+end

data/lib/feature.rb

@@ -0,0 +1,341 @@
+class Feature
+
+  def sum_diff_product(first_number, second_number)
+    {
+      sum: first_number + second_number,
+      diff: first_number - second_number,
+      product: first_number * second_number
+    }
+  end
+
+  def formula_solution(value_x, value_y)
+    (value_x.abs - value_y.abs) / (1 + (value_x * value_y).abs).to_f
+  end
+
+  def volume_area_cube(length_of_the_edge)
+    {
+      volume: length_of_the_edge ** 3,
+      area: 6 * length_of_the_edge ** 2
+    }
+  end
+
+  def average_ar_geo_num(first_number, second_number)
+    {
+      arithmetical: (first_number + second_number) / 2.to_f,
+      geometrical: Math.sqrt(first_number * second_number)
+    }
+  end
+
+  def average_ar_num_and_geo_mod(first_number, second_number)
+    {
+      arithmetical: (first_number + second_number) / 2,
+      geometrical: Math.sqrt(first_number.abs * second_number.abs)
+    }
+  end
+
+  def area_hypot_triangle(first_leg, second_leg)
+    {
+      area: 0.5 * first_leg * second_leg,
+      hypotenuse: Math.sqrt(first_leg ** 2 + second_leg ** 2)
+    }
+  end
+
+  def value_temp_water(f_volue, f_temperature, s_value, s_temperature)
+    {
+      value: f_volue + s_value,
+      tempetature: ((f_volue * f_temperature) + (s_value * s_temperature)) / (f_volue + s_value).to_f
+    }
+  end
+
+  def permtr_multicutnik(number_of_corners, radius)
+    number_of_corners * 2 * radius * Math.sin(Math::PI / number_of_corners)
+  end
+
+  def compound_resistance(first_resistance, second_resistance, third_resistance)
+    1 / ((1 / first_resistance.to_f) + (1 / second_resistance.to_f) + (1 / third_resistance.to_f))
+  end
+
+  def fall_time(height, constant_g = 9.83)
+    Math.sqrt(2 * height / constant_g)
+  end
+
+  def calcul_value_a_b(value_x, value_y, value_z)
+    {
+      value_a: (2 * Math.cos(value_x - Math::PI / 6)) / (1 / 2 + Math.sin(value_y) ** 2),
+      value_b: 1 + (value_z ** 2 / 3 + value_z ** 2 / 5)
+    }
+  end
+
+  def area_triangle(side)
+    (1 / 2.to_f) * side * Math.sqrt(side ** 2 - side ** 2 / 2)
+  end
+
+  def period_of_oscillation(length, constant_g = 9.83)
+    2 * Math::PI * Math.sqrt(length / constant_g)
+  end
+
+  def force_of_gravity(first_mass, second_mass, distance, g = 0.000000000067385)
+    g * ((first_mass * second_mass) / distance ** 2)
+  end
+
+  def sec_leg_radius_inscr_circle(first_leg, hypotenuse)
+    second_leg = Math.sqrt(hypotenuse ** 2 - first_leg ** 2)
+    triangle_semi_perimeter = 0.5 * (first_leg + hypotenuse + second_leg)
+    {
+      radius: Math.sqrt((triangle_semi_perimeter - first_leg) * (triangle_semi_perimeter - hypotenuse) *
+        (triangle_semi_perimeter - second_leg)) / triangle_semi_perimeter,
+      second_leg: second_leg
+    }
+  end
+
+  def area_circle(circumference)
+    radius = circumference / (2 * Math::PI)
+    Math::PI * radius ** 2
+  end
+
+  def ring_area(inner_radius = 20, outer_radius)
+    (Math::PI * (inner_radius ** 2 - outer_radius ** 2)).to_i
+  end
+
+  def sides_triangle(angles_A, angles_B, angles_C, radius)
+    {
+      side_a: calcul_triangle_sides(radius, angles_A),
+      side_b: calcul_triangle_sides(radius, angles_B),
+      side_c: calcul_triangle_sides(radius, angles_C)
+    }
+  end
+
+  def meeting_time(acceleration_f, acceleration_s, speed_f, speed_s, distance)
+    average_acceleration = (acceleration_f + acceleration_s) / 2
+    average_speed = speed_f + speed_s
+    (-average_speed + Math.sqrt(-average_speed ** 2 + (4 * distance * average_acceleration))) / (2 * average_acceleration)
+  end
+
+  def sum_arith_progression(value_a, value_d, value_n)
+    ((2 * value_a + (value_n - 1) * value_d) / 2) * value_n
+  end
+
+  def trapezium_area(greater_base, smaller_base, angle)
+    (((greater_base + smaller_base) / 2) * ((greater_base - smaller_base) / 2) * Math.tan(angle)).to_i
+  end
+
+  def heig_med_bis_and_rad(side_a, side_b, side_c)
+    semiperimeter = ((side_a + side_b + side_c) / 2).to_f
+    {
+      #length height
+      height_a: calcul_triangle_height(side_a, side_b, side_c, side_a),
+      height_b: calcul_triangle_height(side_a, side_b, side_c, side_b),
+      height_c: calcul_triangle_height(side_a, side_b, side_c, side_c),
+      #length median
+      median_a: calcul_triangle_median(side_b, side_c, side_a),
+      median_b: calcul_triangle_median(side_a, side_c, side_b),
+      median_c: calcul_triangle_median(side_a, side_b, side_c),
+      #length bisector
+      bisector_a: calcul_triangle_bisector(side_b, side_c, side_a),
+      bisector_b: calcul_triangle_bisector(side_a, side_c, side_b),
+      bisector_c: calcul_triangle_bisector(side_a, side_b, side_c),
+      #radius circumscribed inscribed circle
+      radius_circumscribed: (side_a * side_b * side_c / (4 * Math.sqrt(semiperimeter *
+      (semiperimeter - side_a) * (semiperimeter - side_b) * (semiperimeter - side_c)))).round(1),
+      radius_inscribed: Math.sqrt((semiperimeter - side_a) * (semiperimeter - side_b) *
+        (semiperimeter - side_c) / semiperimeter).round(1)
+    }
+  end
+
+  def dist_between_points(coordinates_x_frt_point, coordinates_y_frt_point,
+    coordinates_x_scnd_point, coordinates_y_scnd_point)
+    distance = (Math.sqrt((coordinates_x_scnd_point - coordinates_x_frt_point) ** 2 +
+      (coordinates_y_scnd_point - coordinates_y_frt_point) ** 2)).round
+  end
+
+  def permtr_area_triangle(coordinates_x_point_a, coordinates_y_point_a, coordinates_x_point_b,
+    coordinates_y_point_b, coordinates_x_point_c, coordinates_y_point_c)
+    distance_a = calcuate_distance(coordinates_x_point_b, coordinates_x_point_a,
+      coordinates_y_point_b,coordinates_y_point_a)
+    distance_b = calcuate_distance(coordinates_x_point_b, coordinates_x_point_c,
+      coordinates_y_point_b, coordinates_y_point_c)
+    distance_c =  calcuate_distance(coordinates_x_point_c, coordinates_x_point_a,
+      coordinates_y_point_c, coordinates_y_point_a)
+    semiperimeter = ((distance_a + distance_b + distance_c) / 2)
+    {
+      perimeter: distance_a + distance_b + distance_c,
+      area: Math.sqrt(semiperimeter * (semiperimeter - distance_a) * (semiperimeter - distance_b) *
+        (semiperimeter - distance_c)).round
+    }
+  end
+
+  def area_sector(number_arc, radius = 13.7)
+    area = ((number_arc / 2.to_f) * radius ** 2).round
+  end
+
+  def angeles_triangle (side_a, side_b, side_c)
+    angele_b = ((side_a ** 2 + side_c ** 2) - side_b ** 2) / (2 * side_c * side_a).to_f * 180
+    angele_c = ((side_a ** 2 + side_b ** 2) - side_c ** 2) / (2 * side_b * side_a).to_f * 180
+    angele_a = 180 - angele_b + angele_c
+    {
+      angele_a: angele_a.abs.round,
+      angele_b: angele_b.abs.round,
+      angele_c: angele_c.abs.round
+    }
+  end
+
+  def calc_equation_1_number(number_x)
+    6 + number_x * (-5 + number_x * (4 - 3 * number_x + 2 * (number_x + number_x)))
+  end
+
+  def calc_equation_2_number(num_x, num_y)
+    num_x * (num_x + num_x + num_x - (num_y + num_y) - 7 * num_x + 15) + num_y * (10 - 4 * num_y) +
+      num_x * (num_x + num_x - 3) + 6
+  end
+
+  def calc_2_equations(num_x)
+    {
+      answer1: 1 + num_x * (-2 + num_x * (3 - 4 * num_x)),
+      answer2: 1 + num_x * (2 + num_x * (3 + 4 * num_x))
+    }
+  end
+
+  def max_min_2_number(num_x, num_y)
+    {
+      max: [num_x, num_y].max,
+      min: [num_x, num_y].min,
+      max_min: [num_x, num_y].minmax.reverse
+    }
+  end
+
+  def min_max_3_number(num_x, num_y, num_z)
+    {
+      max: [num_x, num_y, num_z].max,
+      min_max: [num_x, num_y, num_z].minmax
+    }
+  end
+
+  def min_max_2_equations(num_x, num_y, num_z)
+    sum = num_x + num_y + num_z
+    product = num_x * num_y * num_z
+    new_sum =  ((sum / 2.to_f) ** 2) + 1
+    new_product = product ** 2 + 1
+    {
+      max: sum > product ? sum : product,
+      min: new_sum < new_product ? new_sum : new_product
+    }
+  end
+
+  def a_less_b_less_c(num_a, num_b, num_c)
+    (num_a < num_b && num_b < num_c) ? true : false
+  end
+
+  def a_more_eq_b_more_eq_c(num_a, num_b, num_c)
+    (num_a >= num_b && num_b >= num_c) ? [num_a * 2, num_b * 2, num_c * 2] : [num_a.abs, num_b.abs, num_c.abs]
+  end
+
+  def calc_number_z(num_x, num_y)
+    num_x > num_y ? num_x - num_y : num_y - (num_x + 1)
+  end
+
+  def comp_x_y_and_output(num_x, num_y)
+    num_x > num_y ? num_x : [num_x, num_y]
+  end
+
+  def comp_x_y_or_x_by_0(num_x, num_y)
+    num_x <= num_y ? num_x = 0 : [num_x, num_y]
+  end
+
+  def less_halfsum_more_doubled(num_x, num_y)
+    num_x > num_y ? [x = (num_x + num_y) / 2.to_f, y = num_x * num_y * 2] :
+     [y = (num_x + num_y) / 2.to_f, x = (num_x * num_y) * 2 ]
+  end
+
+  def non_negative_number(num_x, num_y, num_z)
+    {
+      a_more_0: num_x >= 0 ? num_x ** 2 : nil,
+      b_more_0: num_y >= 0 ? num_y ** 2 : nil,
+      c_more_0: num_z >= 0 ? num_z ** 2 : nil
+    }
+  end
+
+  def floor_round_int_numb_x(number_x)
+    {
+      floor: number_x.floor,
+      round: number_x.round,
+      to_i: number_x.to_i
+    }
+  end
+
+  def determ_even_numb(number_x)
+    number_x % 2 == 0 ? true : false
+  end
+
+  def determ_remainder_div_r_s(num_a, num_b, num_r, num_s)
+    remainder = num_a % num_b
+    {
+      remainder_equal_r: remainder == num_r ? true : nil,
+      remainder_equal_s: remainder == num_s ? true : nil,
+      remainder_not_equal_r_or_s:  remainder != num_r && remainder != num_s ? true : nil
+    }
+  end
+
+  def determ_hund_in_numb(number_n)
+    number_n > 99 ? number_n / 100.to_i : false
+  end
+
+  def eq_squa_numb_n_cub_sum(number_n)
+    sum = number_n.to_s.split('').map.each {|x| x.to_i}.sum
+    number_n ** 2 == sum ** 3 ? true : false
+  end
+
+  def incl_sm_lst_frst_lst_b_on_n(num_n)
+    {
+      including: num_n.to_s.split("").length,
+      sum: num_n.to_s.split("").map.each {|x| x.to_i}.sum,
+      last: num_n.to_s.split("").last.to_i,
+      first: num_n.to_s.split("").first.to_i,
+      last_but_one: num_n.to_s[-2].to_i
+    }
+  end
+
+  def number_check(number)
+    {
+      palindrome: number == number.to_s.reverse.to_i ? true : false ,
+      three_identical_numbers: (number.to_s.split('').uniq.size == 2 && number != number.to_s.reverse.to_i) ?
+        true : false ,
+      numbers_different: number.to_s.split('') == number.to_s.split('').uniq ?
+        true : false
+    }
+  end
+
+  def calcul_the_progression
+    result = 1
+    (0.1..10).step(0.1) { |i| result *= 1 + Math.sin(i) }
+    result
+  end
+
+  private
+
+  def calcul_triangle_sides(r, angles)
+    r * 2 * Math.sin(angles).abs
+  end
+
+  def calcul_triangle_height(side_a, side_b, side_c, opositive_side)
+    semiperimeter = (side_a + side_b + side_c) / 2
+    area = Math.sqrt(semiperimeter * (semiperimeter - side_a) * (semiperimeter - side_b) * (semiperimeter - side_c))
+    (opositive_side / 2) * area.round(1)
+  end
+
+  def calcul_triangle_median(side_1, side_2, side_3)
+    (Math.sqrt((2 * side_1 ** 2 + 2 * side_2** 2 - side_3 ** 2) / 2)).round(1)
+  end
+
+  def calcul_triangle_bisector(side_1, side_2, side_3)
+    semiperimeter = (side_1 + side_2 + side_3) / 2
+    (2 * Math.sqrt(side_1 * side_2 * semiperimeter * (semiperimeter - side_3)) / (side_1 + side_2))  .round(1)
+  end
+  def calcuate_distance(coordinate_x_point_1, ccoordinate_x_point_2,coordinate_y_point_1,coordinate_y_point_2)
+    Math.sqrt((coordinate_x_point_1 - ccoordinate_x_point_2) ** 2 +
+      (coordinate_y_point_1 - coordinate_y_point_2) ** 2).round
+  end
+end
+
+
+
+

data/test/spec.rb

@@ -0,0 +1,319 @@
+load 'lib/feature.rb'
+require 'quality_assurance'
+
+class Spec
+  include QualityAssurance
+
+  def sum_diff_product_t1
+    expected_result = { sum: 6, diff: 2, product: 8 }
+    assert(expected: expected_result, actual: Feature.new.sum_diff_product(4, 2))
+  end
+
+  def sum_diff_product_t2
+    expected_result = { sum: 697, diff: -367, product: 87780 }
+    assert(expected: expected_result, actual: Feature.new.sum_diff_product(165, 532))
+  end
+
+  def formula_solution_t1
+    assert(expected: result = -0.04081632653061224, actual:Feature.new.formula_solution(6, 8))
+  end
+
+  def formula_solution_t2
+    assert(expected: result = 0.02560124127230411, actual:Feature.new.formula_solution(-56, -23))
+  end
+
+  def volume_area_cube_t
+    expected_result = { volume: 64, area: 96 }
+    assert(expected: expected_result, actual:Feature.new.volume_area_cube(4))
+  end
+
+  def volume_area_cube_t2
+    expected_result = { volume: 175616, area: 18816 }
+    assert(expected: expected_result, actual:Feature.new.volume_area_cube(56))
+  end
+
+  def average_ar_geo_num_t1
+    expected_result = { arithmetical: 49.5, geometrical: 49.07137658554119 }
+    assert(expected: expected_result, actual:Feature.new.average_ar_geo_num(56, 43))
+  end
+
+  def average_ar_geo_num_t2
+    expected_result = { arithmetical: 3, geometrical: 3 }
+    assert(expected: expected_result, actual:Feature.new.average_ar_geo_num(3, 3))
+  end
+
+  def average_ar_num_and_geo_mod_t
+    expected_result = { arithmetical: 5, geometrical: 5 }
+    assert(expected: expected_result, actual:Feature.new.average_ar_num_and_geo_mod(5, 5))
+  end
+
+  def area_hypot_triangle_t1
+    expected_result = { area: 12.5, hypotenuse: 7.0710678118654755 }
+    assert(expected: expected_result, actual:Feature.new.area_hypot_triangle(5, 5))
+  end
+
+  def area_hypot_triangle_t2
+    expected_result = {  area: 50, hypotenuse: 14.142135623730951}
+    assert(expected: expected_result, actual:Feature.new.area_hypot_triangle(10, 10))
+  end
+
+  def value_temp_water_t
+    assert(expected: { value: 8, tempetature: 43.75 }, actual:Feature.new.value_temp_water(5, 40, 3, 50))
+  end
+
+  def permtr_multicutnik_t1
+    assert(expected: perimeter = 35.26711513754839, actual:Feature.new.permtr_multicutnik(5, 6))
+  end
+
+  def permtr_multicutnik_t2
+    assert(expected: perimeter = 376.74311717588023, actual:Feature.new.permtr_multicutnik(50, 60))
+  end
+
+  def compound_resistance_t
+    assert(expected: resistance_connection = 1.0526315789473684, actual:Feature.new.compound_resistance(5, 4, 2))
+  end
+
+  def fall_time_t
+    assert(expected: time = 0.9021281496396893, actual:Feature.new.fall_time(4))
+  end
+
+  def calcul_value_a_b_t1
+    expected_result = { value_a: -2.0542392471657545, value_b: 26 }
+    assert(expected: expected_result, actual:Feature.new.calcul_value_a_b(4, 5, 7))
+  end
+
+  def calcul_value_a_b_t2
+    expected_result = { value_a: 3.830368057339472, value_b: 154 }
+    assert(expected: expected_result, actual:Feature.new.calcul_value_a_b(20, 15, 17))
+  end
+
+  def area_triangle_t
+    assert(expected: area = 5.656854249492381, actual:Feature.new.area_triangle(4))
+  end
+
+  def period_of_oscillation_t
+    assert(expected: oscillation_period = 5.302151459045603, actual:Feature.new.period_of_oscillation(7))
+  end
+
+
+  def force_of_gravity_t
+    assert(expected: force = 1.3477e-10, actual:Feature.new.force_of_gravity(6, 4, 3))
+  end
+
+  def sec_leg_radius_inscr_circle_t
+    expected_result = { second_leg: 3, radius: 0.40824829046386296 }
+    assert(expected: expected_result, actual:Feature.new.sec_leg_radius_inscr_circle(4, 5))
+  end
+
+  def area_circle_t
+    assert(expected: area = 2.864788975654116, actual:Feature.new.area_circle(6))
+  end
+
+  def ring_area_t
+    assert(expected: area = 942, actual:Feature.new.ring_area(10))
+  end
+
+  def sides_triangle_t
+    expected_result = { side_a: 12.108839924926851, side_b:15.342788394610215, side_c:4.470647971182814 }
+    assert(expected: expected_result, actual:Feature.new.sides_triangle(4, 5, 6, 8))
+  end
+
+  def meeting_time_t
+    assert(expected: time = 0.15831239517770007, actual:Feature.new.meeting_time(20, 60, 40, 80, 200))
+  end
+
+  def sum_arith_progressio_t
+    assert(expected: sum = 47600, actual:Feature.new.sum_arith_progression(20, 60, 40))
+  end
+
+  def trapezium_area_t
+    assert(expected: area = 768, actual:Feature.new.trapezium_area(100, 20, 60))
+  end
+
+  def heig_med_bis_and_rad_t
+    expected_result =
+      {
+        height_a: 13, height_b:13, height_c:19.5,
+        median_a: 7.3, median_b: 6.2, median_c: 4.8,
+        bisector_a: 4.6, bisector_b: 3.7, bisector_c: 2.6,
+        radius_circumscribed: 4.6, radius_inscribed: 0.9
+      }
+    assert(expected: expected_result, actual:Feature.new.heig_med_bis_and_rad(4, 5, 6))
+  end
+
+  def dist_between_points_t
+    assert(expected: distance = 28, actual:Feature.new.dist_between_points(20, 60, 40, 80))
+  end
+
+  def permtr_area_triangle_t
+    expected_result = { perimeter: 205, area: 500 }
+    assert(expected: expected_result, actual:Feature.new.permtr_area_triangle(40, 53, 73, 84, 91, 140))
+  end
+
+  def area_sector_t
+    assert(expected: area = 1877, actual:Feature.new.area_sector(20))
+  end
+
+  def angeles_triangle_t
+    expected_result = { angele_a: 14, angele_b: 127, angele_c: 39 }
+    assert(expected: expected_result, actual:Feature.new.angeles_triangle(40, 53, 73))
+  end
+
+  def calc_equation_1_number_t
+    assert(expected: 9506, actual:Feature.new.calc_equation_1_number(20))
+  end
+
+  def calc_equation_2_number_t
+    assert(expected: -5054, actual:Feature.new.calc_equation_2_number(20, 30))
+  end
+
+  def calc_2_equations_t
+    assert(expected: { answer1: -30839, answer2: 33241 }, actual:Feature.new.calc_2_equations(20))
+  end
+
+  def max_min_2_number_t
+    expected_result = { max: 5, min: 3, max_min: [5, 3]}
+    assert(expected: expected_result, actual:Feature.new.max_min_2_number(5, 3))
+  end
+
+  def min_max_3_number_t
+    expected_result = { max: 6 , min_max: [4, 6] }
+    assert(expected: expected_result, actual:Feature.new.min_max_3_number(4, 5, 6))
+  end
+
+  def min_max_2_equations_t
+    expected_result = { max: 120, min:  57.25 }
+    assert(expected: expected_result, actual:Feature.new.min_max_2_equations(4, 5, 6))
+  end
+
+  def a_less_b_less_c_t1
+    assert(expected: true , actual:Feature.new.a_less_b_less_c(4, 5, 6))
+  end
+
+  def a_less_b_less_c_t2
+    assert(expected: false ,actual:Feature.new.a_less_b_less_c(5, 4, 6))
+  end
+
+  def a_more_eq_b_more_eq_c_t1
+    assert(expected: [5, 4, 6], actual:Feature.new.a_more_eq_b_more_eq_c(-5, -4, -6))
+  end
+
+  def a_more_eq_b_more_eq_c_t2
+    assert(expected: [-10, -10, -10],
+      actual:Feature.new.a_more_eq_b_more_eq_c(-5, -5, -5))
+  end
+
+  def calc_number_z_t1
+    assert(expected: 1 , actual:Feature.new.calc_number_z(5, 4))
+  end
+
+  def calc_number_z_t2
+    assert(expected: 0 , actual:Feature.new.calc_number_z(4, 5))
+  end
+
+  def comp_x_y_and_output_t1
+    assert(expected: 5, actual:Feature.new.comp_x_y_and_output(5, 4))
+  end
+
+  def comp_x_y_and_output_t2
+    assert(expected: [4, 5], actual:Feature.new.comp_x_y_and_output(4, 5))
+  end
+
+  def comp_x_y_or_x_by_0_t1
+    assert(expected: 0 , actual:Feature.new.comp_x_y_or_x_by_0(5, 5))
+  end
+
+  def comp_x_y_or_x_by_0_t2
+    assert(expected: [5, 4], actual:Feature.new.comp_x_y_or_x_by_0(5, 4))
+  end
+
+  def less_halfsum_more_doubled_t1
+    assert(expected:  [x=4.5, y= 40],
+      actual:Feature.new.less_halfsum_more_doubled(5, 4))
+  end
+
+  def less_halfsum_more_doubled_t2
+    assert(expected: [y= 4.5, x= 40],
+      actual:Feature.new.less_halfsum_more_doubled(4, 5))
+  end
+
+  def non_negative_number_t1
+    expected_result = { a_more_0: 36, b_more_0: 25, c_more_0: 16 }
+    assert(expected: expected_result, actual:Feature.new.non_negative_number(6, 5, 4))
+  end
+
+  def non_negative_number_t2
+    expected_result = { a_more_0: nil, b_more_0: nil, c_more_0: nil }
+    assert(expected: expected_result, actual:Feature.new.non_negative_number(-6, -5, -4))
+  end
+
+  def floor_round_int_numb_x_t
+    expected_result = { floor: 2, round: 3, to_i: 2 }
+    assert(expected: expected_result, actual:Feature.new.floor_round_int_numb_x(2.6))
+  end
+
+  def determ_even_numb_t1
+    assert(expected: true , actual:Feature.new.determ_even_numb(4))
+  end
+
+  def determ_even_numb_t2
+    assert(expected: false , actual:Feature.new.determ_even_numb(5))
+  end
+
+  def determ_remainder_div_r_s_t1
+    expected_result = { remainder_equal_r: true, remainder_equal_s: nil, remainder_not_equal_r_or_s: nil}
+    assert(expected: expected_result, actual:Feature.new.determ_remainder_div_r_s(4, 2, 0, 4))
+  end
+
+  def determ_remainder_div_r_s_t2
+    expected_result = { remainder_equal_r: nil, remainder_equal_s: true, remainder_not_equal_r_or_s: nil}
+    assert(expected: expected_result, actual:Feature.new.determ_remainder_div_r_s(4, 2, 4, 0))
+  end
+
+  def determ_remainder_div_r_s_t3
+    expected_result = { remainder_equal_r: nil, remainder_equal_s: nil, remainder_not_equal_r_or_s: true}
+    assert(expected: expected_result, actual:Feature.new.determ_remainder_div_r_s(4, 2, 4, 2))
+  end
+
+  def determ_hund_in_numb_t1
+    assert(expected: 5, actual:Feature.new.determ_hund_in_numb(500))
+  end
+
+  def determ_hund_in_numb_t2
+    assert(expected: false, actual:Feature.new.determ_hund_in_numb(50))
+  end
+
+  def eq_squa_numb_n_cub_sum_t1
+    assert(expected: false , actual:Feature.new.eq_squa_numb_n_cub_sum(50))
+  end
+
+  def eq_squa_numb_n_cub_sum_t2
+    assert(expected: true, actual:Feature.new.eq_squa_numb_n_cub_sum(1))
+  end
+
+  def incl_sm_lst_frst_lst_b_on_n_t
+    expected_result = { including: 2, sum: 13, last: 7, first: 6, last_but_one: 6}
+    assert(expected: expected_result, actual:Feature.new.incl_sm_lst_frst_lst_b_on_n(67))
+  end
+
+  def number_check_t1
+    expected_result = {palindrome: true , three_identical_numbers: false , numbers_different: false }
+    assert(expected: expected_result, actual:Feature.new.number_check(2002))
+  end
+
+  def number_check_t2
+    expected_result = { palindrome: false , three_identical_numbers: true , numbers_different: false }
+    assert(expected: expected_result, actual:Feature.new.number_check(2022))
+  end
+
+  def number_check_t3
+    expected_result = { palindrome: false , three_identical_numbers: false , numbers_different: true }
+    assert(expected: expected_result, actual:Feature.new.number_check(2034))
+  end
+
+  def calcul_the_progression_t
+  assert(expected: 1.7298409468177145e-14, actual:Feature.new.calcul_the_progression )
+  end
+end
+
+

metadata

@@ -0,0 +1,65 @@
+--- !ruby/object:Gem::Specification
+name: solving_math_tasks
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Semyz Serhii
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2018-11-04 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: quality_assurance
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.0.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.0.0
+description: This gem will help you solve some math task.
+email: semizserhii@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- CHANGELOG
+- LICENSE
+- README.md
+- Rakefile
+- feature.gemspec
+- lib/feature.rb
+- test/spec.rb
+homepage: https://github.com/SemyzSerhii/Solving-math-tasks
+licenses:
+- GPL-2.0
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.6.14
+signing_key: 
+specification_version: 4
+summary: Solve some math task.
+test_files:
+- test/spec.rb