Miller Rabin implementation with gmp library

Question

First of all sorry for my english. I want to implement the Miller–Rabin primality test algorithm. I have to create two random numbers with 10 and 70 bits, respectively, and to check if that numbers are primes. I don't know a lot of stuff about programming so if someone could  help me i would very pleased.

respectively

Ge?a se ?????, ???? ?a ???p???s? t?? p??a??t??? a??????µ? t?? Miller-Rabin ?a? ?a e????? a? ??p???? t??a??? a???µ?? p?? ?a p??pe? e?? ?a d?µ??????s?, e??a? p??t??. ?? a???µ?? a?t?? ?a ????? µ??e??? 10 ?a? 70 bits a?t?st???a. ?e? ???? p???? ap? p????aµµat?sµ? a??? e?p??? p?? ?a? µe t?? d??? sa? ß???e?a ?a ß?e?e? ??p??a ????. ??? ??p??e? ?d?e? ?a? µ???? d? ?t? ?p???e? a?tap????se? st? ??µa ?a a?eß?s? t?p??? ?a? ?e???? ?p??a ß???e?a µp??? ?a p??sf??? ap? t?? µa??µat??? p?e??? t?? ??µat??. ?p???? ???e? ap? C pa?a?a?? a? ß????se?.