if we knew how to solve [tex] f(x)= 0 mod (p^{l-1}) [/tex] (1)(adsbygoogle = window.adsbygoogle || []).push({});

could we solve then [tex] f(x)= 0 mod (p^{l}) [/tex] for integer 'l'

the idea is, if it were easy to solve [tex] f(x)= 0 mod (p) [/tex] then we could easily find a solution to (1) but i do not know how to do it.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Solving Congruences

Loading...

Similar Threads - Solving Congruences | Date |
---|---|

I Solving System of Equations w/ Gauss-Jordan Elimination | Sep 18, 2017 |

I Solving a system of linear equations using back substitution | Aug 30, 2017 |

Solving Systems of Congruences when mods not pairwise relatively prime | Sep 25, 2011 |

Congruence Solving | Jun 8, 2011 |

Solving a System of Congruences with A Changing Modulus | Jun 11, 2007 |

**Physics Forums - The Fusion of Science and Community**