





'''simple docstring'''

from __future__ import annotations







def  a__    (    lowercase :					float, lowercase :					float, lowercase :					float, )		->		tuple:





     """simple docstring"""

     if (electron_conc, hole_conc, intrinsic_conc).count(0				) != 1:
          raise ValueError('''You cannot supply more or less than 2 values'''				)
     elif electron_conc < 0:
          raise ValueError('''Electron concentration cannot be negative in a semiconductor'''				)
     elif hole_conc < 0:
          raise ValueError('''Hole concentration cannot be negative in a semiconductor'''				)
     elif intrinsic_conc < 0:
          raise ValueError(
              '''Intrinsic concentration cannot be negative in a semiconductor'''				)
     elif electron_conc == 0:
          return (
              "electron_conc",
              intrinsic_conc**2 / hole_conc,
          )
     elif hole_conc == 0:
          return (
              "hole_conc",
              intrinsic_conc**2 / electron_conc,
          )
     elif intrinsic_conc == 0:
          return (
              "intrinsic_conc",
              (electron_conc * hole_conc) ** 0.5,
          )
     else:
          return (-1, -1)


if __name__ == "__main__":
   import doctest

   doctest.testmod()










'''simple docstring'''

from math import isclose, sqrt







def  a__    (    lowercase :					float, lowercase :					float, lowercase :					float				)		->		tuple[float, float, float]:





     """simple docstring"""

     _UpperCamelCase       =	point_y / 4 / point_x
     _UpperCamelCase       =	2 * normal_gradient / (1 + normal_gradient * normal_gradient)
     _UpperCamelCase       =	(1 - normal_gradient * normal_gradient) / (
         1 + normal_gradient * normal_gradient
     )
     _UpperCamelCase       =	(sa - ca * incoming_gradient) / (ca + sa * incoming_gradient)

     # to find the next point, solve the simultaeneous equations:
     # y^2 + 4x^2 = 100
     # y - b = m * (x - a)
     # ==> A x^2 + B x + C = 0
     _UpperCamelCase       =	outgoing_gradient**2 + 4
     _UpperCamelCase       =	2 * outgoing_gradient * (point_y - outgoing_gradient * point_x)
     _UpperCamelCase       =	(point_y - outgoing_gradient * point_x) ** 2 - 100

     _UpperCamelCase       =	(
         -linear_term - sqrt(linear_term**2 - 4 * quadratic_term * constant_term				)
     ) / (2 * quadratic_term)
     _UpperCamelCase       =	(
         -linear_term + sqrt(linear_term**2 - 4 * quadratic_term * constant_term				)
     ) / (2 * quadratic_term)

     # two solutions, one of which is our input point
     _UpperCamelCase       =	x_minus if isclose(lowercase, lowercase				) else x_plus
     _UpperCamelCase       =	point_y + outgoing_gradient * (next_x - point_x)

     return next_x, next_y, outgoing_gradient







def  a__    (    lowercase :					float = 1.4, lowercase :					float = -9.6				)		->		int:





     """simple docstring"""

     _UpperCamelCase       =	0
     _UpperCamelCase       =	first_x_coord
     _UpperCamelCase       =	first_y_coord
     _UpperCamelCase       =	(1_0.1 - point_y) / (0.0 - point_x)

     while not (-0.0_1 <= point_x <= 0.0_1 and point_y > 0):
          _UpperCamelCase   ,    _UpperCamelCase   ,    _UpperCamelCase       =	next_point(lowercase, lowercase, lowercase				)
          num_reflections += 1

     return num_reflections


if __name__ == "__main__":
   print(F"""{solution() = }""")



