 
Application in generalized Pascal's trianglesIn this section we apply the methods discussed in the previous subsection to prove exactly the prime property of a large number in a generalized Pascal's triangle. The theory of these triangles was presented by the author in 1997 ([7]). The general triangles were specified as follows:DEFINITION. (generalized Pascal's triangle) Let be integers. Then we can get the th element in the th row of the based triangle if we multiply the th element in the th row by , the th element in the th row by , , the th element in the th row by , the th element in the th row by , and add the products. If for some we have or (i.e. some element in the th row does not exist according to the traditional implementation) then we consider this element to be 0. The indices in the rows and columns of the triangle run from 0. In [7] the most important properties of these triangles were thoroughly investigated. Among others we gave a direct formula for the th element in the th row, thus we are able to specify an element somewhere in a generalized triangle without building the preceding rows. Investigating the elements in these triangles we can find a number of large primes. It is a conjecture, that we are able to find large primes too, so with the building of the triangles we get some kind of "prime formula". For example in the first 150 rows in the based triangle with a Maple program using the isprime function we found the elements
in the following (row, column) position to be prime:
Here the last element contains 93 decimal digits. In Figure 1 we present the first few row of this triangle. Analysing the structure of the based triangle, we conclude, that prime elements can only take place in the positions and  this follows from Theorem 2 in [7]. The elements in these positions are presented with bold characters. We mentioned above, if the isprime function says, that a number is
prime, it is not surely true. Thus if we would like to make sure about this
property, we have to use the methods discussed in the previous subsection.
Exact proof for a prime candidate In the following part we prove exactly the prime property of the element in the position , which is > a:=113339208484022902352005233461239034435177252913302015 > 128561961100032061289;a number containing digits. Testing this number with the isprime
function we get
> isprime(a); thus is very likely prime. To prove this, we need the factorization of . We use first the easy option, because else we can run in a
very long unsuccessful cycle.
> ifactor(a1,'easy'); > b:=(a1)/(2^3*3*5399); > isprime(b); Knowing that is not prime, we have a digit number to factorize. It is usually hopeless in a PC, but now we are lucky, with the pollard option we can break this number in approximately minutes
^{3}. Without this option, with the
basically interpreted MorrisonBrillhart
method, the ifactor will stay unsuccesful for much longer time.
> ifactor(b,'pollard'); > c:=b/80847131951:Observing, that the Maplesystem writes the complete factorization only if the factors are prime (in the other case e.g. for we would have _c59), we know, that investigating with the ifactor function we get the answer true.
However, we have to prove this too. The question arises, when can we believe
"surely" the Maplesystem if it says, that a number is prime.
Analysing the operation of the isprime function with the following
commands ^{4}
> interface(verboseproc=2): > print(isprime);we conclude, that the system examines gcds up to approximately , so very strictly this is the lower bound. However, the Maple guarantees the safety for much larger numbers, too. In this paper we fix our lower bound  considering the point of view of safety and decreasing the use up of space  at 20 decimal digits. Thus we believe the true answer of the isprime function without reservation up to
this bound (it is an easy exercise to check, that the prime numbers
below this bound are really primes).
Turning back to the number , we have to factorize .
> ifactor(c1,'easy'); > d:=(c1)/(2*23*617):Now we have a digit large prime candidate, let us continue with . > ifactor(d1,'easy'); > e:=(d1)/(4*5*49*11*13*29*853*17977*551231); We know surely, that this digit number is not prime. The Maple is able to factorize it in minutes. > ifactor(e); So finally we have a complete factorization, thus we begin the exact proofs. First we prove the prime property of with the method of POCKLINGTON. > f:=215944514907757: > g:=51386119357470140587: > modp(power(2,d1),d); Observing, that we have to check only two gcds. > gcd(modp(power(2,(d1)/f),d),d); > gcd(modp(power(2,(d1)/g),d),d); Thus is prime, we can continue with . Now we use the method of BRILLHART, LEHMER and SELFRIDGE, because has only a few prime divisors. > modp(power(2,(c1)/d),c); Similarly we get very large results for modp(power(2,(c1)/617),c) and
modp(power(2,(c1)/23),c) .
Here we disregarded the details.
With our last exponent first we are unsuccessful.
> modp(power(2,(c1)/2),c); Choosing another base we get > modp(power(3,(c1)/d),c); thus we are ready with . To the prime property of , we observe, that is much larger, than the product of the other factors of , i.e. with the POCKLINGTON method we need to compute only one gcd. > modp(power(2,a1),a); > gcd(modp(power(2,(a1)/c),a),a); With this we have proved exactly the prime property of . Conclusions Summarizing, we have found very large primes in the generalized Pascal's triangles, and the Maple system was able to prove exactly the prime property of one candidate.  
